./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec4_product37.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec4_product37.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 e3509f37a4190025a6bf9c4e7a81c42e49e3316a9582aab003e20039c8a6c594 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 14:20:51,042 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 14:20:51,118 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 14:20:51,125 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 14:20:51,126 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 14:20:51,151 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 14:20:51,153 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 14:20:51,154 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 14:20:51,154 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 14:20:51,155 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 14:20:51,155 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 14:20:51,155 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 14:20:51,156 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 14:20:51,156 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 14:20:51,158 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 14:20:51,158 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 14:20:51,159 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 14:20:51,161 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 14:20:51,162 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 14:20:51,162 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 14:20:51,163 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 14:20:51,164 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 14:20:51,164 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 14:20:51,164 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 14:20:51,165 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 14:20:51,165 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 14:20:51,165 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 14:20:51,165 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 14:20:51,166 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 14:20:51,166 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 14:20:51,166 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 14:20:51,167 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 14:20:51,167 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 14:20:51,168 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 14:20:51,168 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 14:20:51,168 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 14:20:51,169 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 14:20:51,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 14:20:51,169 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 14:20:51,170 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 14:20:51,170 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 14:20:51,171 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 14:20:51,171 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 -> e3509f37a4190025a6bf9c4e7a81c42e49e3316a9582aab003e20039c8a6c594 [2024-11-18 14:20:51,454 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 14:20:51,478 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 14:20:51,481 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 14:20:51,482 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 14:20:51,483 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 14:20:51,484 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec4_product37.cil.c [2024-11-18 14:20:53,005 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 14:20:53,255 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 14:20:53,256 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product37.cil.c [2024-11-18 14:20:53,270 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8dbc6ee3/30287b5cf1eb46f98e85c9f85f4d4a9f/FLAGe297228c0 [2024-11-18 14:20:53,283 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8dbc6ee3/30287b5cf1eb46f98e85c9f85f4d4a9f [2024-11-18 14:20:53,285 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 14:20:53,287 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 14:20:53,288 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 14:20:53,288 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 14:20:53,294 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 14:20:53,295 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:20:53" (1/1) ... [2024-11-18 14:20:53,296 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f56b400 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:20:53, skipping insertion in model container [2024-11-18 14:20:53,296 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:20:53" (1/1) ... [2024-11-18 14:20:53,339 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 14:20:53,605 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_product37.cil.c[6698,6711] [2024-11-18 14:20:53,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 14:20:53,702 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 14:20:53,711 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [49] [2024-11-18 14:20:53,714 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [87] [2024-11-18 14:20:53,714 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [156] [2024-11-18 14:20:53,717 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [343] [2024-11-18 14:20:53,718 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [439] [2024-11-18 14:20:53,719 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [448] [2024-11-18 14:20:53,719 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [543] [2024-11-18 14:20:53,719 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [909] [2024-11-18 14:20:53,737 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_product37.cil.c[6698,6711] [2024-11-18 14:20:53,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 14:20:53,818 INFO L204 MainTranslator]: Completed translation [2024-11-18 14:20:53,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:20:53 WrapperNode [2024-11-18 14:20:53,819 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 14:20:53,822 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 14:20:53,824 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 14:20:53,824 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 14:20:53,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:20:53" (1/1) ... [2024-11-18 14:20:53,847 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:20:53" (1/1) ... [2024-11-18 14:20:53,887 INFO L138 Inliner]: procedures = 53, calls = 97, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 198 [2024-11-18 14:20:53,888 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 14:20:53,888 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 14:20:53,889 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 14:20:53,889 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 14:20:53,898 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:20:53" (1/1) ... [2024-11-18 14:20:53,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:20:53" (1/1) ... [2024-11-18 14:20:53,900 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:20:53" (1/1) ... [2024-11-18 14:20:53,918 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-18 14:20:53,919 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:20:53" (1/1) ... [2024-11-18 14:20:53,919 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:20:53" (1/1) ... [2024-11-18 14:20:53,924 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:20:53" (1/1) ... [2024-11-18 14:20:53,929 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:20:53" (1/1) ... [2024-11-18 14:20:53,935 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:20:53" (1/1) ... [2024-11-18 14:20:53,939 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:20:53" (1/1) ... [2024-11-18 14:20:53,941 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 14:20:53,942 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 14:20:53,944 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 14:20:53,944 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 14:20:53,945 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:20:53" (1/1) ... [2024-11-18 14:20:53,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 14:20:53,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:20:53,972 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 14:20:53,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 14:20:54,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 14:20:54,024 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-18 14:20:54,024 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-18 14:20:54,024 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-18 14:20:54,024 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-18 14:20:54,024 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-18 14:20:54,024 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-18 14:20:54,024 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-11-18 14:20:54,025 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-11-18 14:20:54,025 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-18 14:20:54,025 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-18 14:20:54,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 14:20:54,025 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-18 14:20:54,025 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-18 14:20:54,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 14:20:54,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 14:20:54,095 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 14:20:54,098 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 14:20:54,325 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-11-18 14:20:54,325 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 14:20:54,339 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 14:20:54,341 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-18 14:20:54,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:20:54 BoogieIcfgContainer [2024-11-18 14:20:54,341 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 14:20:54,343 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 14:20:54,343 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 14:20:54,346 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 14:20:54,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 02:20:53" (1/3) ... [2024-11-18 14:20:54,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@172f28a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:20:54, skipping insertion in model container [2024-11-18 14:20:54,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:20:53" (2/3) ... [2024-11-18 14:20:54,348 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@172f28a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:20:54, skipping insertion in model container [2024-11-18 14:20:54,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:20:54" (3/3) ... [2024-11-18 14:20:54,349 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product37.cil.c [2024-11-18 14:20:54,364 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 14:20:54,364 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 14:20:54,414 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 14:20:54,421 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;@69d5ce0a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 14:20:54,421 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 14:20:54,432 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 62 states have (on average 1.403225806451613) internal successors, (87), 70 states have internal predecessors, (87), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-18 14:20:54,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-18 14:20:54,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:20:54,443 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:20:54,443 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:20:54,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:20:54,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1654845695, now seen corresponding path program 1 times [2024-11-18 14:20:54,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:20:54,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883153329] [2024-11-18 14:20:54,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:20:54,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:20:54,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:20:54,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:20:54,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:20:54,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883153329] [2024-11-18 14:20:54,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883153329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:20:54,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:20:54,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 14:20:54,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793997809] [2024-11-18 14:20:54,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:20:54,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 14:20:54,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:20:54,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 14:20:54,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 14:20:54,711 INFO L87 Difference]: Start difference. First operand has 80 states, 62 states have (on average 1.403225806451613) internal successors, (87), 70 states have internal predecessors, (87), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:20:54,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:20:54,745 INFO L93 Difference]: Finished difference Result 152 states and 209 transitions. [2024-11-18 14:20:54,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 14:20:54,747 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-18 14:20:54,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:20:54,754 INFO L225 Difference]: With dead ends: 152 [2024-11-18 14:20:54,754 INFO L226 Difference]: Without dead ends: 71 [2024-11-18 14:20:54,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 14:20:54,762 INFO L432 NwaCegarLoop]: 101 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, 101 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:20:54,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:20:54,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-18 14:20:54,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-18 14:20:54,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 55 states have (on average 1.3272727272727274) internal successors, (73), 62 states have internal predecessors, (73), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-18 14:20:54,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 92 transitions. [2024-11-18 14:20:54,799 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 92 transitions. Word has length 19 [2024-11-18 14:20:54,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:20:54,799 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 92 transitions. [2024-11-18 14:20:54,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:20:54,800 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 92 transitions. [2024-11-18 14:20:54,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-18 14:20:54,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:20:54,802 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:20:54,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 14:20:54,802 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:20:54,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:20:54,803 INFO L85 PathProgramCache]: Analyzing trace with hash -338550328, now seen corresponding path program 1 times [2024-11-18 14:20:54,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:20:54,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744689744] [2024-11-18 14:20:54,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:20:54,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:20:54,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:20:54,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:20:54,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:20:54,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744689744] [2024-11-18 14:20:54,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744689744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:20:54,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:20:54,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:20:54,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686553504] [2024-11-18 14:20:54,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:20:54,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:20:54,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:20:54,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:20:54,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:20:54,905 INFO L87 Difference]: Start difference. First operand 71 states and 92 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:20:54,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:20:54,930 INFO L93 Difference]: Finished difference Result 108 states and 140 transitions. [2024-11-18 14:20:54,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:20:54,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-18 14:20:54,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:20:54,934 INFO L225 Difference]: With dead ends: 108 [2024-11-18 14:20:54,934 INFO L226 Difference]: Without dead ends: 62 [2024-11-18 14:20:54,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:20:54,936 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 12 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:20:54,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 142 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:20:54,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-18 14:20:54,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-18 14:20:54,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 49 states have (on average 1.346938775510204) internal successors, (66), 56 states have internal predecessors, (66), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-18 14:20:54,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 80 transitions. [2024-11-18 14:20:54,948 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 80 transitions. Word has length 20 [2024-11-18 14:20:54,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:20:54,948 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 80 transitions. [2024-11-18 14:20:54,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:20:54,949 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 80 transitions. [2024-11-18 14:20:54,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-18 14:20:54,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:20:54,950 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:20:54,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 14:20:54,950 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:20:54,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:20:54,951 INFO L85 PathProgramCache]: Analyzing trace with hash -367201047, now seen corresponding path program 1 times [2024-11-18 14:20:54,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:20:54,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598278961] [2024-11-18 14:20:54,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:20:54,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:20:54,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:20:55,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:20:55,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:20:55,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598278961] [2024-11-18 14:20:55,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598278961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:20:55,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:20:55,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 14:20:55,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123500237] [2024-11-18 14:20:55,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:20:55,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 14:20:55,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:20:55,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 14:20:55,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-18 14:20:55,149 INFO L87 Difference]: Start difference. First operand 62 states and 80 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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-18 14:20:55,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:20:55,304 INFO L93 Difference]: Finished difference Result 117 states and 154 transitions. [2024-11-18 14:20:55,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 14:20:55,307 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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 24 [2024-11-18 14:20:55,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:20:55,308 INFO L225 Difference]: With dead ends: 117 [2024-11-18 14:20:55,308 INFO L226 Difference]: Without dead ends: 62 [2024-11-18 14:20:55,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-18 14:20:55,310 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 127 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:20:55,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 196 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:20:55,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-18 14:20:55,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-18 14:20:55,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 56 states have internal predecessors, (65), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-18 14:20:55,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2024-11-18 14:20:55,325 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 24 [2024-11-18 14:20:55,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:20:55,326 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2024-11-18 14:20:55,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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-18 14:20:55,326 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2024-11-18 14:20:55,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-18 14:20:55,328 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:20:55,328 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] [2024-11-18 14:20:55,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 14:20:55,328 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:20:55,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:20:55,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1324378912, now seen corresponding path program 1 times [2024-11-18 14:20:55,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:20:55,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134190490] [2024-11-18 14:20:55,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:20:55,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:20:55,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:20:55,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:20:55,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:20:55,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134190490] [2024-11-18 14:20:55,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134190490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:20:55,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:20:55,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:20:55,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903785206] [2024-11-18 14:20:55,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:20:55,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:20:55,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:20:55,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:20:55,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:20:55,413 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-18 14:20:55,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:20:55,458 INFO L93 Difference]: Finished difference Result 155 states and 204 transitions. [2024-11-18 14:20:55,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:20:55,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 30 [2024-11-18 14:20:55,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:20:55,462 INFO L225 Difference]: With dead ends: 155 [2024-11-18 14:20:55,462 INFO L226 Difference]: Without dead ends: 100 [2024-11-18 14:20:55,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:20:55,465 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 62 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:20:55,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 141 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:20:55,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-18 14:20:55,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2024-11-18 14:20:55,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 84 states have internal predecessors, (101), 10 states have call successors, (10), 10 states have call predecessors, (10), 10 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2024-11-18 14:20:55,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 125 transitions. [2024-11-18 14:20:55,497 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 125 transitions. Word has length 30 [2024-11-18 14:20:55,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:20:55,499 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 125 transitions. [2024-11-18 14:20:55,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-18 14:20:55,499 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 125 transitions. [2024-11-18 14:20:55,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-18 14:20:55,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:20:55,502 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] [2024-11-18 14:20:55,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 14:20:55,504 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:20:55,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:20:55,505 INFO L85 PathProgramCache]: Analyzing trace with hash 2145464363, now seen corresponding path program 1 times [2024-11-18 14:20:55,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:20:55,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069835218] [2024-11-18 14:20:55,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:20:55,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:20:55,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:20:55,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:20:55,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:20:55,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069835218] [2024-11-18 14:20:55,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069835218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:20:55,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:20:55,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 14:20:55,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844343407] [2024-11-18 14:20:55,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:20:55,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 14:20:55,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:20:55,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 14:20:55,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 14:20:55,631 INFO L87 Difference]: Start difference. First operand 98 states and 125 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 14:20:55,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:20:55,668 INFO L93 Difference]: Finished difference Result 192 states and 251 transitions. [2024-11-18 14:20:55,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 14:20:55,668 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2024-11-18 14:20:55,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:20:55,670 INFO L225 Difference]: With dead ends: 192 [2024-11-18 14:20:55,672 INFO L226 Difference]: Without dead ends: 101 [2024-11-18 14:20:55,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 14:20:55,675 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:20:55,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 298 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:20:55,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-18 14:20:55,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-18 14:20:55,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 80 states have (on average 1.3) internal successors, (104), 87 states have internal predecessors, (104), 10 states have call successors, (10), 10 states have call predecessors, (10), 10 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2024-11-18 14:20:55,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 128 transitions. [2024-11-18 14:20:55,701 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 128 transitions. Word has length 38 [2024-11-18 14:20:55,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:20:55,702 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 128 transitions. [2024-11-18 14:20:55,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 14:20:55,702 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 128 transitions. [2024-11-18 14:20:55,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-18 14:20:55,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:20:55,705 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] [2024-11-18 14:20:55,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 14:20:55,705 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:20:55,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:20:55,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1134347113, now seen corresponding path program 1 times [2024-11-18 14:20:55,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:20:55,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933608722] [2024-11-18 14:20:55,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:20:55,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:20:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:20:55,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:20:55,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:20:55,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933608722] [2024-11-18 14:20:55,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933608722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:20:55,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:20:55,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 14:20:55,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453608781] [2024-11-18 14:20:55,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:20:55,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 14:20:55,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:20:55,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 14:20:55,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 14:20:55,849 INFO L87 Difference]: Start difference. First operand 101 states and 128 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 14:20:55,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:20:55,894 INFO L93 Difference]: Finished difference Result 197 states and 260 transitions. [2024-11-18 14:20:55,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 14:20:55,897 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2024-11-18 14:20:55,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:20:55,898 INFO L225 Difference]: With dead ends: 197 [2024-11-18 14:20:55,898 INFO L226 Difference]: Without dead ends: 103 [2024-11-18 14:20:55,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 14:20:55,900 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:20:55,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 367 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:20:55,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-18 14:20:55,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-18 14:20:55,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 82 states have (on average 1.2926829268292683) internal successors, (106), 89 states have internal predecessors, (106), 10 states have call successors, (10), 10 states have call predecessors, (10), 10 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2024-11-18 14:20:55,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 130 transitions. [2024-11-18 14:20:55,912 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 130 transitions. Word has length 38 [2024-11-18 14:20:55,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:20:55,912 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 130 transitions. [2024-11-18 14:20:55,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-18 14:20:55,913 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 130 transitions. [2024-11-18 14:20:55,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-18 14:20:55,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:20:55,914 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] [2024-11-18 14:20:55,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 14:20:55,914 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:20:55,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:20:55,915 INFO L85 PathProgramCache]: Analyzing trace with hash 113278759, now seen corresponding path program 1 times [2024-11-18 14:20:55,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:20:55,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932659091] [2024-11-18 14:20:55,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:20:55,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:20:55,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:20:55,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:20:55,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:20:55,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932659091] [2024-11-18 14:20:55,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932659091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:20:55,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:20:55,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 14:20:55,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093379010] [2024-11-18 14:20:55,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:20:55,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 14:20:55,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:20:55,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 14:20:55,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 14:20:55,998 INFO L87 Difference]: Start difference. First operand 103 states and 130 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-18 14:20:56,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:20:56,089 INFO L93 Difference]: Finished difference Result 333 states and 438 transitions. [2024-11-18 14:20:56,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 14:20:56,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 38 [2024-11-18 14:20:56,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:20:56,093 INFO L225 Difference]: With dead ends: 333 [2024-11-18 14:20:56,095 INFO L226 Difference]: Without dead ends: 237 [2024-11-18 14:20:56,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 14:20:56,096 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 104 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:20:56,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 257 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:20:56,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-18 14:20:56,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 228. [2024-11-18 14:20:56,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 180 states have (on average 1.2777777777777777) internal successors, (230), 193 states have internal predecessors, (230), 23 states have call successors, (23), 23 states have call predecessors, (23), 24 states have return successors, (41), 24 states have call predecessors, (41), 23 states have call successors, (41) [2024-11-18 14:20:56,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 294 transitions. [2024-11-18 14:20:56,143 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 294 transitions. Word has length 38 [2024-11-18 14:20:56,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:20:56,144 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 294 transitions. [2024-11-18 14:20:56,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-18 14:20:56,144 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 294 transitions. [2024-11-18 14:20:56,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-18 14:20:56,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:20:56,147 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:20:56,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 14:20:56,148 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:20:56,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:20:56,150 INFO L85 PathProgramCache]: Analyzing trace with hash 2043069861, now seen corresponding path program 1 times [2024-11-18 14:20:56,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:20:56,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484139213] [2024-11-18 14:20:56,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:20:56,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:20:56,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:20:56,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:20:56,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:20:56,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484139213] [2024-11-18 14:20:56,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484139213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:20:56,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:20:56,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 14:20:56,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277757720] [2024-11-18 14:20:56,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:20:56,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 14:20:56,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:20:56,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 14:20:56,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 14:20:56,280 INFO L87 Difference]: Start difference. First operand 228 states and 294 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (3), 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-18 14:20:56,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:20:56,346 INFO L93 Difference]: Finished difference Result 447 states and 579 transitions. [2024-11-18 14:20:56,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 14:20:56,347 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (3), 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 40 [2024-11-18 14:20:56,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:20:56,351 INFO L225 Difference]: With dead ends: 447 [2024-11-18 14:20:56,353 INFO L226 Difference]: Without dead ends: 226 [2024-11-18 14:20:56,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-18 14:20:56,355 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 30 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 285 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-18 14:20:56,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 285 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:20:56,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-18 14:20:56,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2024-11-18 14:20:56,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 178 states have (on average 1.2696629213483146) internal successors, (226), 191 states have internal predecessors, (226), 23 states have call successors, (23), 23 states have call predecessors, (23), 24 states have return successors, (41), 24 states have call predecessors, (41), 23 states have call successors, (41) [2024-11-18 14:20:56,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 290 transitions. [2024-11-18 14:20:56,386 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 290 transitions. Word has length 40 [2024-11-18 14:20:56,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:20:56,388 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 290 transitions. [2024-11-18 14:20:56,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (3), 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-18 14:20:56,388 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 290 transitions. [2024-11-18 14:20:56,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-18 14:20:56,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:20:56,390 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, 1] [2024-11-18 14:20:56,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-18 14:20:56,392 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:20:56,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:20:56,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1243334323, now seen corresponding path program 1 times [2024-11-18 14:20:56,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:20:56,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858440381] [2024-11-18 14:20:56,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:20:56,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:20:56,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:20:56,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:20:56,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:20:56,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858440381] [2024-11-18 14:20:56,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858440381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:20:56,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:20:56,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 14:20:56,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617575920] [2024-11-18 14:20:56,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:20:56,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 14:20:56,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:20:56,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 14:20:56,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 14:20:56,522 INFO L87 Difference]: Start difference. First operand 226 states and 290 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-18 14:20:56,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:20:56,598 INFO L93 Difference]: Finished difference Result 472 states and 639 transitions. [2024-11-18 14:20:56,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 14:20:56,599 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2024-11-18 14:20:56,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:20:56,603 INFO L225 Difference]: With dead ends: 472 [2024-11-18 14:20:56,603 INFO L226 Difference]: Without dead ends: 293 [2024-11-18 14:20:56,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-18 14:20:56,604 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 43 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:20:56,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 430 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:20:56,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-18 14:20:56,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2024-11-18 14:20:56,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 229 states have (on average 1.25764192139738) internal successors, (288), 244 states have internal predecessors, (288), 31 states have call successors, (31), 31 states have call predecessors, (31), 32 states have return successors, (62), 32 states have call predecessors, (62), 31 states have call successors, (62) [2024-11-18 14:20:56,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 381 transitions. [2024-11-18 14:20:56,641 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 381 transitions. Word has length 42 [2024-11-18 14:20:56,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:20:56,641 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 381 transitions. [2024-11-18 14:20:56,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-18 14:20:56,642 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 381 transitions. [2024-11-18 14:20:56,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-18 14:20:56,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:20:56,644 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, 1, 1, 1] [2024-11-18 14:20:56,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-18 14:20:56,644 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:20:56,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:20:56,645 INFO L85 PathProgramCache]: Analyzing trace with hash -287011253, now seen corresponding path program 1 times [2024-11-18 14:20:56,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:20:56,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160874177] [2024-11-18 14:20:56,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:20:56,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:20:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:20:56,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:20:56,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:20:56,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160874177] [2024-11-18 14:20:56,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160874177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:20:56,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:20:56,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 14:20:56,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687668663] [2024-11-18 14:20:56,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:20:56,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 14:20:56,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:20:56,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 14:20:56,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 14:20:56,721 INFO L87 Difference]: Start difference. First operand 293 states and 381 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-18 14:20:56,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:20:56,899 INFO L93 Difference]: Finished difference Result 313 states and 407 transitions. [2024-11-18 14:20:56,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 14:20:56,900 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 44 [2024-11-18 14:20:56,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:20:56,902 INFO L225 Difference]: With dead ends: 313 [2024-11-18 14:20:56,902 INFO L226 Difference]: Without dead ends: 311 [2024-11-18 14:20:56,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-18 14:20:56,903 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 104 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:20:56,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 244 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:20:56,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-18 14:20:56,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2024-11-18 14:20:56,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 245 states have (on average 1.2408163265306122) internal successors, (304), 260 states have internal predecessors, (304), 31 states have call successors, (31), 31 states have call predecessors, (31), 34 states have return successors, (67), 32 states have call predecessors, (67), 31 states have call successors, (67) [2024-11-18 14:20:56,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 402 transitions. [2024-11-18 14:20:56,933 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 402 transitions. Word has length 44 [2024-11-18 14:20:56,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:20:56,933 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 402 transitions. [2024-11-18 14:20:56,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-18 14:20:56,933 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 402 transitions. [2024-11-18 14:20:56,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-18 14:20:56,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:20:56,936 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:20:56,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-18 14:20:56,936 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:20:56,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:20:56,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1326075952, now seen corresponding path program 1 times [2024-11-18 14:20:56,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:20:56,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705305570] [2024-11-18 14:20:56,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:20:56,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:20:56,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:20:57,089 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-18 14:20:57,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:20:57,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705305570] [2024-11-18 14:20:57,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705305570] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 14:20:57,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096610811] [2024-11-18 14:20:57,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:20:57,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:20:57,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:20:57,093 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 14:20:57,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 14:20:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:20:57,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-18 14:20:57,204 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 14:20:57,344 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:20:57,345 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 14:20:57,518 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-18 14:20:57,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096610811] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 14:20:57,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 14:20:57,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2024-11-18 14:20:57,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543476000] [2024-11-18 14:20:57,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 14:20:57,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 14:20:57,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:20:57,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 14:20:57,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-18 14:20:57,523 INFO L87 Difference]: Start difference. First operand 311 states and 402 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-18 14:20:57,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:20:57,657 INFO L93 Difference]: Finished difference Result 710 states and 972 transitions. [2024-11-18 14:20:57,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-18 14:20:57,659 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 74 [2024-11-18 14:20:57,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:20:57,663 INFO L225 Difference]: With dead ends: 710 [2024-11-18 14:20:57,663 INFO L226 Difference]: Without dead ends: 448 [2024-11-18 14:20:57,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 144 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-18 14:20:57,666 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 75 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:20:57,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 454 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:20:57,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-11-18 14:20:57,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 402. [2024-11-18 14:20:57,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 315 states have (on average 1.2412698412698413) internal successors, (391), 335 states have internal predecessors, (391), 41 states have call successors, (41), 41 states have call predecessors, (41), 45 states have return successors, (91), 39 states have call predecessors, (91), 41 states have call successors, (91) [2024-11-18 14:20:57,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 523 transitions. [2024-11-18 14:20:57,702 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 523 transitions. Word has length 74 [2024-11-18 14:20:57,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:20:57,702 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 523 transitions. [2024-11-18 14:20:57,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-18 14:20:57,703 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 523 transitions. [2024-11-18 14:20:57,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-18 14:20:57,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:20:57,704 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:20:57,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-18 14:20:57,908 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-18 14:20:57,909 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:20:57,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:20:57,909 INFO L85 PathProgramCache]: Analyzing trace with hash -257680621, now seen corresponding path program 2 times [2024-11-18 14:20:57,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:20:57,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098185558] [2024-11-18 14:20:57,910 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 14:20:57,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:20:57,947 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 14:20:57,948 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-18 14:20:57,948 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 14:20:57,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 14:20:58,001 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 14:20:58,002 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 14:20:58,003 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 14:20:58,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-18 14:20:58,007 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:20:58,083 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 14:20:58,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 02:20:58 BoogieIcfgContainer [2024-11-18 14:20:58,086 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 14:20:58,087 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 14:20:58,087 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 14:20:58,087 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 14:20:58,089 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:20:54" (3/4) ... [2024-11-18 14:20:58,090 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-18 14:20:58,180 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-18 14:20:58,180 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 14:20:58,181 INFO L158 Benchmark]: Toolchain (without parser) took 4894.35ms. Allocated memory was 167.8MB in the beginning and 216.0MB in the end (delta: 48.2MB). Free memory was 112.0MB in the beginning and 112.3MB in the end (delta: -313.2kB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB. [2024-11-18 14:20:58,181 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 125.8MB. Free memory was 95.8MB in the beginning and 95.8MB in the end (delta: 16.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 14:20:58,182 INFO L158 Benchmark]: CACSL2BoogieTranslator took 533.42ms. Allocated memory is still 167.8MB. Free memory was 111.8MB in the beginning and 135.8MB in the end (delta: -24.1MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. [2024-11-18 14:20:58,182 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.88ms. Allocated memory is still 167.8MB. Free memory was 135.8MB in the beginning and 133.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 14:20:58,182 INFO L158 Benchmark]: Boogie Preprocessor took 53.38ms. Allocated memory is still 167.8MB. Free memory was 133.7MB in the beginning and 131.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 14:20:58,182 INFO L158 Benchmark]: RCFGBuilder took 398.83ms. Allocated memory is still 167.8MB. Free memory was 131.0MB in the beginning and 113.8MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-18 14:20:58,182 INFO L158 Benchmark]: TraceAbstraction took 3743.57ms. Allocated memory was 167.8MB in the beginning and 216.0MB in the end (delta: 48.2MB). Free memory was 113.2MB in the beginning and 119.7MB in the end (delta: -6.4MB). Peak memory consumption was 43.4MB. Max. memory is 16.1GB. [2024-11-18 14:20:58,183 INFO L158 Benchmark]: Witness Printer took 93.56ms. Allocated memory is still 216.0MB. Free memory was 119.7MB in the beginning and 112.3MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-18 14:20:58,184 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.16ms. Allocated memory is still 125.8MB. Free memory was 95.8MB in the beginning and 95.8MB in the end (delta: 16.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 533.42ms. Allocated memory is still 167.8MB. Free memory was 111.8MB in the beginning and 135.8MB in the end (delta: -24.1MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.88ms. Allocated memory is still 167.8MB. Free memory was 135.8MB in the beginning and 133.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.38ms. Allocated memory is still 167.8MB. Free memory was 133.7MB in the beginning and 131.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 398.83ms. Allocated memory is still 167.8MB. Free memory was 131.0MB in the beginning and 113.8MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3743.57ms. Allocated memory was 167.8MB in the beginning and 216.0MB in the end (delta: 48.2MB). Free memory was 113.2MB in the beginning and 119.7MB in the end (delta: -6.4MB). Peak memory consumption was 43.4MB. Max. memory is 16.1GB. * Witness Printer took 93.56ms. Allocated memory is still 216.0MB. Free memory was 119.7MB in the beginning and 112.3MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [49] - GenericResultAtLocation [Line: 87]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [87] - GenericResultAtLocation [Line: 156]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [156] - GenericResultAtLocation [Line: 343]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [343] - GenericResultAtLocation [Line: 439]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [439] - GenericResultAtLocation [Line: 448]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [448] - GenericResultAtLocation [Line: 543]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [543] - GenericResultAtLocation [Line: 909]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [909] * 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: 444]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L165] int pumpRunning = 0; [L166] int systemActive = 1; [L344] int cleanupTimeShifts = 4; [L450] int waterLevel = 1; [L451] int methaneLevelCritical = 0; [L713] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L417] int retValue_acc ; [L418] int tmp ; [L422] FCALL select_helpers() [L423] FCALL select_features() [L424] CALL, EXPR valid_product() [L79] int retValue_acc ; [L82] retValue_acc = 1 [L83] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L424] RET, EXPR valid_product() [L424] tmp = valid_product() [L426] COND TRUE \read(tmp) [L428] FCALL setup() [L429] CALL runTest() [L411] CALL test() [L93] int splverifierCounter ; [L94] int tmp ; [L95] int tmp___0 ; [L96] int tmp___1 ; [L97] int tmp___2 ; [L100] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L102] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L104] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L110] tmp = __VERIFIER_nondet_int() [L112] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L114] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L468] COND TRUE waterLevel < 2 [L469] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L114] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L120] tmp___0 = __VERIFIER_nondet_int() [L122] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L130] tmp___2 = __VERIFIER_nondet_int() [L132] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L145] CALL timeShift() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L173] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L180] COND TRUE \read(systemActive) [L182] CALL processEnvironment() [L228] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L231] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L246] CALL processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L202] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L205] COND TRUE ! pumpRunning [L207] CALL, EXPR isHighWaterLevel() [L325] int retValue_acc ; [L326] int tmp ; [L327] int tmp___0 ; [L331] CALL, EXPR isHighWaterSensorDry() [L530] int retValue_acc ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L533] COND FALSE !(waterLevel < 2) [L537] retValue_acc = 0 [L538] 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] [L331] RET, EXPR isHighWaterSensorDry() [L331] tmp = isHighWaterSensorDry() [L333] COND FALSE !(\read(tmp)) [L336] 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] [L338] retValue_acc = tmp___0 [L339] 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] [L207] RET, EXPR isHighWaterLevel() [L207] tmp = isHighWaterLevel() [L209] COND TRUE \read(tmp) [L211] CALL activatePump() [L256] pumpRunning = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L211] RET activatePump() [L246] RET processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L182] RET processEnvironment() [L188] CALL __utac_acc__Specification4_spec__1() [L911] int tmp ; [L912] int tmp___0 ; [L916] CALL, EXPR getWaterLevel() [L521] int retValue_acc ; [L524] retValue_acc = waterLevel [L525] 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] [L916] RET, EXPR getWaterLevel() [L916] tmp = getWaterLevel() [L918] COND FALSE !(tmp == 0) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L188] RET __utac_acc__Specification4_spec__1() [L145] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L102] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L104] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L110] tmp = __VERIFIER_nondet_int() [L112] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L120] tmp___0 = __VERIFIER_nondet_int() [L122] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L130] tmp___2 = __VERIFIER_nondet_int() [L132] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L145] CALL timeShift() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L173] COND TRUE \read(pumpRunning) [L175] CALL lowerWaterLevel() [L456] COND TRUE waterLevel > 0 [L457] waterLevel = waterLevel - 1 VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L175] RET lowerWaterLevel() [L180] COND TRUE \read(systemActive) [L182] CALL processEnvironment() [L228] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L231] COND TRUE \read(pumpRunning) [L233] CALL, EXPR isMethaneAlarm() [L269] int retValue_acc ; [L273] CALL, EXPR isMethaneLevelCritical() [L489] int retValue_acc ; [L492] retValue_acc = methaneLevelCritical [L493] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L273] RET, EXPR isMethaneLevelCritical() [L273] retValue_acc = isMethaneLevelCritical() [L275] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L233] RET, EXPR isMethaneAlarm() [L233] tmp = isMethaneAlarm() [L235] COND FALSE !(\read(tmp)) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L241] CALL processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L202] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L205] COND FALSE !(! pumpRunning) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L220] FCALL processEnvironment__wrappee__base() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L241] RET processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L182] RET processEnvironment() [L188] CALL __utac_acc__Specification4_spec__1() [L911] int tmp ; [L912] int tmp___0 ; [L916] CALL, EXPR getWaterLevel() [L521] int retValue_acc ; [L524] retValue_acc = waterLevel [L525] 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] [L916] RET, EXPR getWaterLevel() [L916] tmp = getWaterLevel() [L918] COND FALSE !(tmp == 0) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L188] RET __utac_acc__Specification4_spec__1() [L145] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L102] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L104] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L110] tmp = __VERIFIER_nondet_int() [L112] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L120] tmp___0 = __VERIFIER_nondet_int() [L122] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L130] tmp___2 = __VERIFIER_nondet_int() [L132] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L145] CALL timeShift() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L173] COND TRUE \read(pumpRunning) [L175] CALL lowerWaterLevel() [L456] COND TRUE waterLevel > 0 [L457] waterLevel = waterLevel - 1 VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L175] RET lowerWaterLevel() [L180] COND TRUE \read(systemActive) [L182] CALL processEnvironment() [L228] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L231] COND TRUE \read(pumpRunning) [L233] CALL, EXPR isMethaneAlarm() [L269] int retValue_acc ; [L273] CALL, EXPR isMethaneLevelCritical() [L489] int retValue_acc ; [L492] retValue_acc = methaneLevelCritical [L493] 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] [L273] RET, EXPR isMethaneLevelCritical() [L273] retValue_acc = isMethaneLevelCritical() [L275] 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] [L233] RET, EXPR isMethaneAlarm() [L233] tmp = isMethaneAlarm() [L235] COND FALSE !(\read(tmp)) VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L241] CALL processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L202] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L205] COND FALSE !(! pumpRunning) VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L220] FCALL processEnvironment__wrappee__base() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L241] RET processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L182] RET processEnvironment() [L188] CALL __utac_acc__Specification4_spec__1() [L911] int tmp ; [L912] int tmp___0 ; [L916] CALL, EXPR getWaterLevel() [L521] int retValue_acc ; [L524] retValue_acc = waterLevel [L525] 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] [L916] RET, EXPR getWaterLevel() [L916] tmp = getWaterLevel() [L918] COND TRUE tmp == 0 [L920] CALL, EXPR isPumpRunning() [L280] int retValue_acc ; [L283] retValue_acc = pumpRunning [L284] 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] [L920] RET, EXPR isPumpRunning() [L920] tmp___0 = isPumpRunning() [L922] COND TRUE \read(tmp___0) [L924] CALL __automaton_fail() [L444] 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 7 procedures, 80 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 563 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 557 mSDsluCounter, 2915 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1918 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 361 IncrementalHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 997 mSDtfsCounter, 361 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 219 GetRequests, 170 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=402occurred in iteration=11, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 57 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 587 NumberOfCodeBlocks, 587 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 542 ConstructedInterpolants, 0 QuantifiedInterpolants, 1018 SizeOfPredicates, 2 NumberOfNonLiveVariables, 260 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 42/60 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-18 14:20:58,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE