./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec4_product48.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec4_product48.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 3a211ea3558de7a91964968ab789e94c34171c05a0686de6a2a53ff72a198e9d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 20:55:06,429 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 20:55:06,495 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 20:55:06,501 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 20:55:06,503 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 20:55:06,536 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 20:55:06,537 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 20:55:06,537 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 20:55:06,538 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 20:55:06,538 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 20:55:06,538 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 20:55:06,539 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 20:55:06,539 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 20:55:06,540 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 20:55:06,540 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 20:55:06,540 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 20:55:06,541 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 20:55:06,545 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 20:55:06,545 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 20:55:06,546 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 20:55:06,546 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 20:55:06,546 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 20:55:06,547 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 20:55:06,547 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 20:55:06,547 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 20:55:06,547 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 20:55:06,548 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 20:55:06,548 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 20:55:06,548 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 20:55:06,548 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 20:55:06,549 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 20:55:06,549 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 20:55:06,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:55:06,549 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 20:55:06,549 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 20:55:06,550 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 20:55:06,550 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 20:55:06,553 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 20:55:06,553 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 20:55:06,554 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 20:55:06,554 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 20:55:06,555 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 20:55:06,555 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 -> 3a211ea3558de7a91964968ab789e94c34171c05a0686de6a2a53ff72a198e9d [2024-11-11 20:55:06,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 20:55:06,835 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 20:55:06,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 20:55:06,840 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 20:55:06,841 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 20:55:06,842 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec4_product48.cil.c [2024-11-11 20:55:08,280 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 20:55:08,494 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 20:55:08,495 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product48.cil.c [2024-11-11 20:55:08,508 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba679b14b/a4fb1258477b44e8a1e3996388398dd8/FLAG63f6d3690 [2024-11-11 20:55:08,840 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba679b14b/a4fb1258477b44e8a1e3996388398dd8 [2024-11-11 20:55:08,843 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 20:55:08,844 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 20:55:08,846 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 20:55:08,846 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 20:55:08,852 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 20:55:08,852 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:55:08" (1/1) ... [2024-11-11 20:55:08,855 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1094e4b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:08, skipping insertion in model container [2024-11-11 20:55:08,855 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:55:08" (1/1) ... [2024-11-11 20:55:08,895 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 20:55:09,161 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_product48.cil.c[11718,11731] [2024-11-11 20:55:09,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:55:09,207 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 20:55:09,218 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [49] [2024-11-11 20:55:09,219 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [78] [2024-11-11 20:55:09,220 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [444] [2024-11-11 20:55:09,220 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [453] [2024-11-11 20:55:09,220 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [557] [2024-11-11 20:55:09,220 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [783] [2024-11-11 20:55:09,220 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [877] [2024-11-11 20:55:09,221 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [946] [2024-11-11 20:55:09,285 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product48.cil.c[11718,11731] [2024-11-11 20:55:09,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:55:09,332 INFO L204 MainTranslator]: Completed translation [2024-11-11 20:55:09,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:09 WrapperNode [2024-11-11 20:55:09,332 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 20:55:09,333 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 20:55:09,334 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 20:55:09,334 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 20:55:09,340 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:09" (1/1) ... [2024-11-11 20:55:09,353 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:09" (1/1) ... [2024-11-11 20:55:09,385 INFO L138 Inliner]: procedures = 56, calls = 102, calls flagged for inlining = 24, calls inlined = 21, statements flattened = 212 [2024-11-11 20:55:09,386 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 20:55:09,387 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 20:55:09,387 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 20:55:09,387 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 20:55:09,400 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:09" (1/1) ... [2024-11-11 20:55:09,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:09" (1/1) ... [2024-11-11 20:55:09,403 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:09" (1/1) ... [2024-11-11 20:55:09,422 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 20:55:09,422 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:09" (1/1) ... [2024-11-11 20:55:09,423 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:09" (1/1) ... [2024-11-11 20:55:09,435 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:09" (1/1) ... [2024-11-11 20:55:09,443 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:09" (1/1) ... [2024-11-11 20:55:09,444 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:09" (1/1) ... [2024-11-11 20:55:09,445 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:09" (1/1) ... [2024-11-11 20:55:09,447 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 20:55:09,448 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 20:55:09,448 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 20:55:09,448 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 20:55:09,450 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:09" (1/1) ... [2024-11-11 20:55:09,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:55:09,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:55:09,489 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 20:55:09,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 20:55:09,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 20:55:09,543 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-11 20:55:09,543 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-11 20:55:09,543 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-11 20:55:09,544 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-11 20:55:09,544 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-11 20:55:09,544 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-11 20:55:09,544 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-11 20:55:09,544 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-11 20:55:09,544 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__methaneQuery [2024-11-11 20:55:09,545 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__methaneQuery [2024-11-11 20:55:09,545 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneAlarm [2024-11-11 20:55:09,545 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneAlarm [2024-11-11 20:55:09,545 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2024-11-11 20:55:09,545 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2024-11-11 20:55:09,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 20:55:09,546 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-11 20:55:09,546 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-11 20:55:09,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 20:55:09,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 20:55:09,645 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 20:55:09,647 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 20:55:09,956 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2024-11-11 20:55:09,956 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 20:55:09,970 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 20:55:09,971 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 20:55:09,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:55:09 BoogieIcfgContainer [2024-11-11 20:55:09,971 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 20:55:09,973 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 20:55:09,974 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 20:55:09,977 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 20:55:09,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 08:55:08" (1/3) ... [2024-11-11 20:55:09,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22a8219 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:55:09, skipping insertion in model container [2024-11-11 20:55:09,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:55:09" (2/3) ... [2024-11-11 20:55:09,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22a8219 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:55:09, skipping insertion in model container [2024-11-11 20:55:09,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:55:09" (3/3) ... [2024-11-11 20:55:09,979 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product48.cil.c [2024-11-11 20:55:09,993 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 20:55:09,993 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 20:55:10,046 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 20:55:10,052 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;@412bc2f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 20:55:10,053 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 20:55:10,058 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 72 states have (on average 1.375) internal successors, (99), 81 states have internal predecessors, (99), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-11 20:55:10,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-11 20:55:10,066 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:55:10,067 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:55:10,067 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:55:10,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:55:10,072 INFO L85 PathProgramCache]: Analyzing trace with hash 296222788, now seen corresponding path program 1 times [2024-11-11 20:55:10,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:55:10,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86085582] [2024-11-11 20:55:10,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:10,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:55:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:10,306 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-11 20:55:10,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:55:10,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86085582] [2024-11-11 20:55:10,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86085582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:55:10,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:55:10,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 20:55:10,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27389361] [2024-11-11 20:55:10,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:55:10,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 20:55:10,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:55:10,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 20:55:10,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 20:55:10,335 INFO L87 Difference]: Start difference. First operand has 96 states, 72 states have (on average 1.375) internal successors, (99), 81 states have internal predecessors, (99), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) 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-11 20:55:10,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:55:10,361 INFO L93 Difference]: Finished difference Result 184 states and 249 transitions. [2024-11-11 20:55:10,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 20:55:10,363 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-11 20:55:10,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:55:10,373 INFO L225 Difference]: With dead ends: 184 [2024-11-11 20:55:10,374 INFO L226 Difference]: Without dead ends: 87 [2024-11-11 20:55:10,377 INFO L434 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-11 20:55:10,381 INFO L435 NwaCegarLoop]: 121 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, 121 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:55:10,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:55:10,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-11 20:55:10,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-11 20:55:10,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 73 states have internal predecessors, (85), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-11 20:55:10,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 112 transitions. [2024-11-11 20:55:10,432 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 112 transitions. Word has length 19 [2024-11-11 20:55:10,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:55:10,432 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 112 transitions. [2024-11-11 20:55:10,432 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-11 20:55:10,433 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 112 transitions. [2024-11-11 20:55:10,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-11 20:55:10,434 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:55:10,435 INFO L218 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-11 20:55:10,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 20:55:10,435 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:55:10,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:55:10,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1405283452, now seen corresponding path program 1 times [2024-11-11 20:55:10,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:55:10,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779208815] [2024-11-11 20:55:10,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:10,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:55:10,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:10,541 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-11 20:55:10,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:55:10,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779208815] [2024-11-11 20:55:10,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779208815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:55:10,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:55:10,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 20:55:10,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544010295] [2024-11-11 20:55:10,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:55:10,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:55:10,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:55:10,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:55:10,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:55:10,546 INFO L87 Difference]: Start difference. First operand 87 states and 112 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-11 20:55:10,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:55:10,571 INFO L93 Difference]: Finished difference Result 135 states and 173 transitions. [2024-11-11 20:55:10,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:55:10,574 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-11 20:55:10,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:55:10,575 INFO L225 Difference]: With dead ends: 135 [2024-11-11 20:55:10,575 INFO L226 Difference]: Without dead ends: 78 [2024-11-11 20:55:10,576 INFO L434 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-11 20:55:10,579 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 17 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 176 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-11 20:55:10,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 176 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:55:10,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-11 20:55:10,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-11 20:55:10,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 67 states have internal predecessors, (78), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-11 20:55:10,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 100 transitions. [2024-11-11 20:55:10,598 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 100 transitions. Word has length 20 [2024-11-11 20:55:10,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:55:10,599 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 100 transitions. [2024-11-11 20:55:10,599 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-11 20:55:10,599 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 100 transitions. [2024-11-11 20:55:10,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-11 20:55:10,600 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:55:10,600 INFO L218 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] [2024-11-11 20:55:10,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 20:55:10,601 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:55:10,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:55:10,602 INFO L85 PathProgramCache]: Analyzing trace with hash 552185447, now seen corresponding path program 1 times [2024-11-11 20:55:10,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:55:10,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429788788] [2024-11-11 20:55:10,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:10,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:55:10,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:10,724 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-11 20:55:10,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:55:10,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429788788] [2024-11-11 20:55:10,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429788788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:55:10,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:55:10,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 20:55:10,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872584085] [2024-11-11 20:55:10,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:55:10,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:55:10,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:55:10,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:55:10,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:55:10,726 INFO L87 Difference]: Start difference. First operand 78 states and 100 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-11 20:55:10,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:55:10,776 INFO L93 Difference]: Finished difference Result 218 states and 285 transitions. [2024-11-11 20:55:10,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:55:10,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 25 [2024-11-11 20:55:10,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:55:10,784 INFO L225 Difference]: With dead ends: 218 [2024-11-11 20:55:10,784 INFO L226 Difference]: Without dead ends: 147 [2024-11-11 20:55:10,787 INFO L434 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-11 20:55:10,788 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 92 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:55:10,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 199 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:55:10,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-11 20:55:10,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2024-11-11 20:55:10,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 107 states have (on average 1.3457943925233644) internal successors, (144), 122 states have internal predecessors, (144), 22 states have call successors, (22), 14 states have call predecessors, (22), 14 states have return successors, (22), 15 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-11 20:55:10,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 188 transitions. [2024-11-11 20:55:10,828 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 188 transitions. Word has length 25 [2024-11-11 20:55:10,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:55:10,828 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 188 transitions. [2024-11-11 20:55:10,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-11 20:55:10,829 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 188 transitions. [2024-11-11 20:55:10,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-11 20:55:10,830 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:55:10,830 INFO L218 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] [2024-11-11 20:55:10,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 20:55:10,830 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:55:10,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:55:10,831 INFO L85 PathProgramCache]: Analyzing trace with hash -513532902, now seen corresponding path program 1 times [2024-11-11 20:55:10,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:55:10,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513987625] [2024-11-11 20:55:10,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:10,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:55:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:11,018 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-11 20:55:11,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:55:11,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513987625] [2024-11-11 20:55:11,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513987625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:55:11,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:55:11,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 20:55:11,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419195585] [2024-11-11 20:55:11,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:55:11,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:55:11,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:55:11,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:55:11,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 20:55:11,021 INFO L87 Difference]: Start difference. First operand 144 states and 188 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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-11 20:55:11,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:55:11,131 INFO L93 Difference]: Finished difference Result 406 states and 549 transitions. [2024-11-11 20:55:11,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:55:11,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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 28 [2024-11-11 20:55:11,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:55:11,137 INFO L225 Difference]: With dead ends: 406 [2024-11-11 20:55:11,138 INFO L226 Difference]: Without dead ends: 269 [2024-11-11 20:55:11,139 INFO L434 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-11 20:55:11,140 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 65 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:55:11,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 366 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:55:11,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-11 20:55:11,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2024-11-11 20:55:11,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 198 states have (on average 1.3232323232323233) internal successors, (262), 225 states have internal predecessors, (262), 44 states have call successors, (44), 28 states have call predecessors, (44), 26 states have return successors, (46), 28 states have call predecessors, (46), 44 states have call successors, (46) [2024-11-11 20:55:11,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 352 transitions. [2024-11-11 20:55:11,175 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 352 transitions. Word has length 28 [2024-11-11 20:55:11,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:55:11,176 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 352 transitions. [2024-11-11 20:55:11,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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-11 20:55:11,176 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 352 transitions. [2024-11-11 20:55:11,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-11 20:55:11,178 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:55:11,179 INFO L218 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-11 20:55:11,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 20:55:11,179 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:55:11,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:55:11,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1685401119, now seen corresponding path program 1 times [2024-11-11 20:55:11,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:55:11,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706649890] [2024-11-11 20:55:11,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:11,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:55:11,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:11,270 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-11 20:55:11,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:55:11,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706649890] [2024-11-11 20:55:11,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706649890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:55:11,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:55:11,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 20:55:11,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778922155] [2024-11-11 20:55:11,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:55:11,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:55:11,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:55:11,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:55:11,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 20:55:11,275 INFO L87 Difference]: Start difference. First operand 269 states and 352 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 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-11 20:55:11,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:55:11,333 INFO L93 Difference]: Finished difference Result 663 states and 883 transitions. [2024-11-11 20:55:11,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:55:11,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 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-11 20:55:11,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:55:11,336 INFO L225 Difference]: With dead ends: 663 [2024-11-11 20:55:11,337 INFO L226 Difference]: Without dead ends: 401 [2024-11-11 20:55:11,339 INFO L434 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-11 20:55:11,340 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 61 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:55:11,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 157 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:55:11,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-11-11 20:55:11,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 392. [2024-11-11 20:55:11,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 301 states have (on average 1.2790697674418605) internal successors, (385), 325 states have internal predecessors, (385), 47 states have call successors, (47), 45 states have call predecessors, (47), 43 states have return successors, (65), 42 states have call predecessors, (65), 47 states have call successors, (65) [2024-11-11 20:55:11,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 497 transitions. [2024-11-11 20:55:11,373 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 497 transitions. Word has length 30 [2024-11-11 20:55:11,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:55:11,373 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 497 transitions. [2024-11-11 20:55:11,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 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-11 20:55:11,374 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 497 transitions. [2024-11-11 20:55:11,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-11 20:55:11,378 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:55:11,379 INFO L218 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] [2024-11-11 20:55:11,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 20:55:11,379 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:55:11,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:55:11,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1358952576, now seen corresponding path program 1 times [2024-11-11 20:55:11,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:55:11,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664747827] [2024-11-11 20:55:11,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:11,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:55:11,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:11,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 20:55:11,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:11,474 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-11 20:55:11,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:55:11,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664747827] [2024-11-11 20:55:11,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664747827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:55:11,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:55:11,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:55:11,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770121115] [2024-11-11 20:55:11,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:55:11,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:55:11,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:55:11,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:55:11,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:55:11,478 INFO L87 Difference]: Start difference. First operand 392 states and 497 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 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-11 20:55:11,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:55:11,809 INFO L93 Difference]: Finished difference Result 458 states and 586 transitions. [2024-11-11 20:55:11,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:55:11,809 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 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 32 [2024-11-11 20:55:11,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:55:11,813 INFO L225 Difference]: With dead ends: 458 [2024-11-11 20:55:11,813 INFO L226 Difference]: Without dead ends: 456 [2024-11-11 20:55:11,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:55:11,815 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 129 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:55:11,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 282 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 20:55:11,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2024-11-11 20:55:11,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 454. [2024-11-11 20:55:11,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 347 states have (on average 1.2680115273775217) internal successors, (440), 381 states have internal predecessors, (440), 55 states have call successors, (55), 45 states have call predecessors, (55), 51 states have return successors, (85), 48 states have call predecessors, (85), 55 states have call successors, (85) [2024-11-11 20:55:11,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 580 transitions. [2024-11-11 20:55:11,866 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 580 transitions. Word has length 32 [2024-11-11 20:55:11,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:55:11,867 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 580 transitions. [2024-11-11 20:55:11,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 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-11 20:55:11,868 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 580 transitions. [2024-11-11 20:55:11,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-11 20:55:11,872 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:55:11,872 INFO L218 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:55:11,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 20:55:11,873 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:55:11,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:55:11,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1650408830, now seen corresponding path program 1 times [2024-11-11 20:55:11,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:55:11,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027885390] [2024-11-11 20:55:11,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:11,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:55:11,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:11,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 20:55:11,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:11,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:55:11,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:11,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:55:11,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:11,977 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-11 20:55:11,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:55:11,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027885390] [2024-11-11 20:55:11,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027885390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:55:11,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:55:11,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:55:11,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916678686] [2024-11-11 20:55:11,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:55:11,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:55:11,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:55:11,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:55:11,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:55:11,980 INFO L87 Difference]: Start difference. First operand 454 states and 580 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:55:12,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:55:12,243 INFO L93 Difference]: Finished difference Result 987 states and 1300 transitions. [2024-11-11 20:55:12,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:55:12,244 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2024-11-11 20:55:12,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:55:12,247 INFO L225 Difference]: With dead ends: 987 [2024-11-11 20:55:12,247 INFO L226 Difference]: Without dead ends: 540 [2024-11-11 20:55:12,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:55:12,250 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 127 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:55:12,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 255 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 20:55:12,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2024-11-11 20:55:12,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 498. [2024-11-11 20:55:12,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 385 states have (on average 1.251948051948052) internal successors, (482), 419 states have internal predecessors, (482), 55 states have call successors, (55), 45 states have call predecessors, (55), 57 states have return successors, (93), 52 states have call predecessors, (93), 55 states have call successors, (93) [2024-11-11 20:55:12,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 630 transitions. [2024-11-11 20:55:12,303 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 630 transitions. Word has length 51 [2024-11-11 20:55:12,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:55:12,303 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 630 transitions. [2024-11-11 20:55:12,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:55:12,304 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 630 transitions. [2024-11-11 20:55:12,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-11 20:55:12,305 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:55:12,306 INFO L218 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:55:12,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 20:55:12,306 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:55:12,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:55:12,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1431554112, now seen corresponding path program 1 times [2024-11-11 20:55:12,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:55:12,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698484948] [2024-11-11 20:55:12,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:12,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:55:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:12,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 20:55:12,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:12,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:55:12,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:12,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:55:12,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:12,425 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-11 20:55:12,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:55:12,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698484948] [2024-11-11 20:55:12,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698484948] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:55:12,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:55:12,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:55:12,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018862413] [2024-11-11 20:55:12,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:55:12,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:55:12,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:55:12,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:55:12,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:55:12,428 INFO L87 Difference]: Start difference. First operand 498 states and 630 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:55:12,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:55:12,691 INFO L93 Difference]: Finished difference Result 957 states and 1237 transitions. [2024-11-11 20:55:12,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 20:55:12,691 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2024-11-11 20:55:12,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:55:12,694 INFO L225 Difference]: With dead ends: 957 [2024-11-11 20:55:12,694 INFO L226 Difference]: Without dead ends: 466 [2024-11-11 20:55:12,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:55:12,697 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 133 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:55:12,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 298 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 20:55:12,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2024-11-11 20:55:12,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 382. [2024-11-11 20:55:12,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 295 states have (on average 1.2508474576271187) internal successors, (369), 320 states have internal predecessors, (369), 44 states have call successors, (44), 36 states have call predecessors, (44), 42 states have return successors, (66), 39 states have call predecessors, (66), 44 states have call successors, (66) [2024-11-11 20:55:12,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 479 transitions. [2024-11-11 20:55:12,728 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 479 transitions. Word has length 51 [2024-11-11 20:55:12,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:55:12,728 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 479 transitions. [2024-11-11 20:55:12,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:55:12,729 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 479 transitions. [2024-11-11 20:55:12,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-11 20:55:12,730 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:55:12,730 INFO L218 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:55:12,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 20:55:12,730 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:55:12,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:55:12,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1516395324, now seen corresponding path program 1 times [2024-11-11 20:55:12,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:55:12,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019443553] [2024-11-11 20:55:12,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:12,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:55:12,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:12,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 20:55:12,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:12,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:55:12,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:12,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:55:12,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:12,882 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-11 20:55:12,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:55:12,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019443553] [2024-11-11 20:55:12,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019443553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:55:12,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:55:12,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:55:12,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770408811] [2024-11-11 20:55:12,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:55:12,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:55:12,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:55:12,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:55:12,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:55:12,885 INFO L87 Difference]: Start difference. First operand 382 states and 479 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:55:13,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:55:13,360 INFO L93 Difference]: Finished difference Result 886 states and 1177 transitions. [2024-11-11 20:55:13,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-11 20:55:13,361 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2024-11-11 20:55:13,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:55:13,367 INFO L225 Difference]: With dead ends: 886 [2024-11-11 20:55:13,367 INFO L226 Difference]: Without dead ends: 595 [2024-11-11 20:55:13,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2024-11-11 20:55:13,369 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 203 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:55:13,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 416 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 20:55:13,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2024-11-11 20:55:13,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 570. [2024-11-11 20:55:13,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 443 states have (on average 1.2257336343115124) internal successors, (543), 475 states have internal predecessors, (543), 63 states have call successors, (63), 53 states have call predecessors, (63), 63 states have return successors, (121), 64 states have call predecessors, (121), 63 states have call successors, (121) [2024-11-11 20:55:13,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 727 transitions. [2024-11-11 20:55:13,421 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 727 transitions. Word has length 51 [2024-11-11 20:55:13,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:55:13,422 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 727 transitions. [2024-11-11 20:55:13,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-11 20:55:13,422 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 727 transitions. [2024-11-11 20:55:13,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-11 20:55:13,424 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:55:13,424 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:55:13,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 20:55:13,424 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:55:13,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:55:13,425 INFO L85 PathProgramCache]: Analyzing trace with hash 390530219, now seen corresponding path program 1 times [2024-11-11 20:55:13,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:55:13,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685866676] [2024-11-11 20:55:13,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:13,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:55:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:13,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 20:55:13,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:13,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-11 20:55:13,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:13,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 20:55:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:13,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:55:13,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:13,510 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:55:13,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:55:13,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685866676] [2024-11-11 20:55:13,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685866676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:55:13,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:55:13,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:55:13,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516405707] [2024-11-11 20:55:13,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:55:13,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:55:13,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:55:13,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:55:13,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:55:13,512 INFO L87 Difference]: Start difference. First operand 570 states and 727 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 4 states have internal predecessors, (65), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-11 20:55:13,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:55:13,782 INFO L93 Difference]: Finished difference Result 957 states and 1219 transitions. [2024-11-11 20:55:13,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:55:13,783 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 4 states have internal predecessors, (65), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 74 [2024-11-11 20:55:13,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:55:13,786 INFO L225 Difference]: With dead ends: 957 [2024-11-11 20:55:13,786 INFO L226 Difference]: Without dead ends: 394 [2024-11-11 20:55:13,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:55:13,788 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 319 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:55:13,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 253 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 20:55:13,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-11 20:55:13,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 377. [2024-11-11 20:55:13,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 295 states have (on average 1.2203389830508475) internal successors, (360), 317 states have internal predecessors, (360), 41 states have call successors, (41), 36 states have call predecessors, (41), 40 states have return successors, (71), 41 states have call predecessors, (71), 41 states have call successors, (71) [2024-11-11 20:55:13,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 472 transitions. [2024-11-11 20:55:13,812 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 472 transitions. Word has length 74 [2024-11-11 20:55:13,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:55:13,813 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 472 transitions. [2024-11-11 20:55:13,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 4 states have internal predecessors, (65), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-11 20:55:13,813 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 472 transitions. [2024-11-11 20:55:13,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-11 20:55:13,814 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:55:13,815 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:55:13,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 20:55:13,815 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:55:13,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:55:13,816 INFO L85 PathProgramCache]: Analyzing trace with hash -2087315147, now seen corresponding path program 1 times [2024-11-11 20:55:13,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:55:13,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199648993] [2024-11-11 20:55:13,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:13,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:55:13,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:13,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-11 20:55:13,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:13,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 20:55:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:13,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 20:55:13,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:13,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:55:13,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:13,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-11 20:55:13,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:13,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 20:55:13,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:13,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:55:13,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:13,993 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-11 20:55:13,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:55:13,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199648993] [2024-11-11 20:55:13,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199648993] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:55:13,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748324886] [2024-11-11 20:55:13,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:13,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:55:13,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:55:14,001 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:55:14,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 20:55:14,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:55:14,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-11 20:55:14,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:55:14,202 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:55:14,202 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:55:14,332 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-11 20:55:14,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748324886] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:55:14,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 20:55:14,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 9 [2024-11-11 20:55:14,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740965717] [2024-11-11 20:55:14,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 20:55:14,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 20:55:14,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:55:14,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 20:55:14,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:55:14,334 INFO L87 Difference]: Start difference. First operand 377 states and 472 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-11 20:55:14,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:55:14,953 INFO L93 Difference]: Finished difference Result 892 states and 1171 transitions. [2024-11-11 20:55:14,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-11 20:55:14,954 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 88 [2024-11-11 20:55:14,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:55:14,958 INFO L225 Difference]: With dead ends: 892 [2024-11-11 20:55:14,958 INFO L226 Difference]: Without dead ends: 590 [2024-11-11 20:55:14,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 188 SyntacticMatches, 7 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=198, Invalid=614, Unknown=0, NotChecked=0, Total=812 [2024-11-11 20:55:14,962 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 378 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 20:55:14,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 477 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 20:55:14,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2024-11-11 20:55:14,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 509. [2024-11-11 20:55:14,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 394 states have (on average 1.2258883248730965) internal successors, (483), 425 states have internal predecessors, (483), 58 states have call successors, (58), 51 states have call predecessors, (58), 56 states have return successors, (106), 54 states have call predecessors, (106), 58 states have call successors, (106) [2024-11-11 20:55:14,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 647 transitions. [2024-11-11 20:55:14,996 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 647 transitions. Word has length 88 [2024-11-11 20:55:14,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:55:14,996 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 647 transitions. [2024-11-11 20:55:14,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-11 20:55:14,997 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 647 transitions. [2024-11-11 20:55:14,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-11 20:55:14,999 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:55:14,999 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:55:15,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 20:55:15,199 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-11 20:55:15,200 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:55:15,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:55:15,201 INFO L85 PathProgramCache]: Analyzing trace with hash -717303076, now seen corresponding path program 2 times [2024-11-11 20:55:15,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:55:15,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334942170] [2024-11-11 20:55:15,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:55:15,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:55:15,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 20:55:15,224 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-11 20:55:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 20:55:15,301 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-11 20:55:15,302 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-11 20:55:15,303 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 20:55:15,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 20:55:15,307 INFO L421 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:55:15,386 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 20:55:15,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 08:55:15 BoogieIcfgContainer [2024-11-11 20:55:15,391 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 20:55:15,391 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 20:55:15,391 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 20:55:15,392 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 20:55:15,392 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:55:09" (3/4) ... [2024-11-11 20:55:15,393 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-11 20:55:15,490 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 20:55:15,490 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 20:55:15,491 INFO L158 Benchmark]: Toolchain (without parser) took 6646.39ms. Allocated memory was 184.5MB in the beginning and 251.7MB in the end (delta: 67.1MB). Free memory was 115.0MB in the beginning and 204.0MB in the end (delta: -89.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 20:55:15,491 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 117.4MB. Free memory is still 77.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 20:55:15,491 INFO L158 Benchmark]: CACSL2BoogieTranslator took 486.55ms. Allocated memory is still 184.5MB. Free memory was 114.8MB in the beginning and 93.2MB in the end (delta: 21.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-11 20:55:15,492 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.49ms. Allocated memory is still 184.5MB. Free memory was 93.2MB in the beginning and 90.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 20:55:15,492 INFO L158 Benchmark]: Boogie Preprocessor took 60.95ms. Allocated memory is still 184.5MB. Free memory was 90.9MB in the beginning and 88.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 20:55:15,492 INFO L158 Benchmark]: RCFGBuilder took 523.34ms. Allocated memory is still 184.5MB. Free memory was 88.6MB in the beginning and 144.6MB in the end (delta: -56.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-11 20:55:15,492 INFO L158 Benchmark]: TraceAbstraction took 5417.32ms. Allocated memory was 184.5MB in the beginning and 251.7MB in the end (delta: 67.1MB). Free memory was 143.5MB in the beginning and 213.5MB in the end (delta: -70.0MB). Peak memory consumption was 142.0MB. Max. memory is 16.1GB. [2024-11-11 20:55:15,493 INFO L158 Benchmark]: Witness Printer took 98.99ms. Allocated memory is still 251.7MB. Free memory was 213.5MB in the beginning and 204.0MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-11 20:55:15,494 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.18ms. Allocated memory is still 117.4MB. Free memory is still 77.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 486.55ms. Allocated memory is still 184.5MB. Free memory was 114.8MB in the beginning and 93.2MB in the end (delta: 21.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.49ms. Allocated memory is still 184.5MB. Free memory was 93.2MB in the beginning and 90.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.95ms. Allocated memory is still 184.5MB. Free memory was 90.9MB in the beginning and 88.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 523.34ms. Allocated memory is still 184.5MB. Free memory was 88.6MB in the beginning and 144.6MB in the end (delta: -56.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5417.32ms. Allocated memory was 184.5MB in the beginning and 251.7MB in the end (delta: 67.1MB). Free memory was 143.5MB in the beginning and 213.5MB in the end (delta: -70.0MB). Peak memory consumption was 142.0MB. Max. memory is 16.1GB. * Witness Printer took 98.99ms. Allocated memory is still 251.7MB. Free memory was 213.5MB in the beginning and 204.0MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. 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,"Specification4_spec.i","") [49] - GenericResultAtLocation [Line: 78]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [78] - GenericResultAtLocation [Line: 444]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [444] - GenericResultAtLocation [Line: 453]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [453] - GenericResultAtLocation [Line: 557]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [557] - GenericResultAtLocation [Line: 783]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [783] - GenericResultAtLocation [Line: 877]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [877] - GenericResultAtLocation [Line: 946]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [946] * 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: 449]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L248] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L454] int cleanupTimeShifts = 4; [L566] int pumpRunning = 0; [L567] int systemActive = 1; [L784] int waterLevel = 1; [L785] int methaneLevelCritical = 0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L535] int retValue_acc ; [L536] int tmp ; [L540] FCALL select_helpers() [L541] FCALL select_features() [L542] CALL, EXPR valid_product() [L973] int retValue_acc ; [L976] retValue_acc = 1 [L977] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L542] RET, EXPR valid_product() [L542] tmp = valid_product() [L544] COND TRUE \read(tmp) [L546] FCALL setup() [L547] CALL runTest() [L526] CALL test() [L879] int splverifierCounter ; [L880] int tmp ; [L881] int tmp___0 ; [L882] int tmp___1 ; [L883] int tmp___2 ; [L886] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L888] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L890] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L896] tmp = __VERIFIER_nondet_int() [L898] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L900] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L802] COND TRUE waterLevel < 2 [L803] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L900] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L906] tmp___0 = __VERIFIER_nondet_int() [L908] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L916] tmp___2 = __VERIFIER_nondet_int() [L918] COND TRUE \read(tmp___2) [L920] CALL startSystem() [L779] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L920] RET startSystem() [L935] CALL timeShift() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L573] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L580] COND TRUE \read(systemActive) [L582] CALL processEnvironment() [L628] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L631] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L646] CALL processEnvironment__wrappee__methaneQuery() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L602] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L605] COND TRUE ! pumpRunning [L607] CALL, EXPR isHighWaterLevel() [L742] int retValue_acc ; [L743] int tmp ; [L744] int tmp___0 ; [L748] CALL, EXPR isHighWaterSensorDry() [L864] int retValue_acc ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L867] COND FALSE !(waterLevel < 2) [L871] retValue_acc = 0 [L872] 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] [L748] RET, EXPR isHighWaterSensorDry() [L748] tmp = isHighWaterSensorDry() [L750] COND FALSE !(\read(tmp)) [L753] 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] [L755] retValue_acc = tmp___0 [L756] 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] [L607] RET, EXPR isHighWaterLevel() [L607] tmp = isHighWaterLevel() [L609] COND TRUE \read(tmp) [L611] CALL activatePump() [L661] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L665] CALL, EXPR isMethaneAlarm() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L686] int retValue_acc ; [L690] CALL, EXPR isMethaneLevelCritical() [L823] int retValue_acc ; [L826] retValue_acc = methaneLevelCritical [L827] 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] [L690] RET, EXPR isMethaneLevelCritical() [L690] retValue_acc = isMethaneLevelCritical() [L692] 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] [L665] RET, EXPR isMethaneAlarm() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L665] tmp = isMethaneAlarm() [L667] COND FALSE !(\read(tmp)) [L671] CALL activatePump__wrappee__highWaterSensor() [L656] pumpRunning = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L671] RET activatePump__wrappee__highWaterSensor() [L611] RET activatePump() [L646] RET processEnvironment__wrappee__methaneQuery() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L582] RET processEnvironment() [L588] CALL __utac_acc__Specification4_spec__1() [L54] int tmp ; [L55] int tmp___0 ; [L59] CALL, EXPR getWaterLevel() [L855] int retValue_acc ; [L858] retValue_acc = waterLevel [L859] 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] [L59] RET, EXPR getWaterLevel() [L59] tmp = getWaterLevel() [L61] COND FALSE !(tmp == 0) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L588] RET __utac_acc__Specification4_spec__1() [L935] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L888] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L890] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L896] tmp = __VERIFIER_nondet_int() [L898] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L906] tmp___0 = __VERIFIER_nondet_int() [L908] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L916] tmp___2 = __VERIFIER_nondet_int() [L918] COND TRUE \read(tmp___2) [L920] CALL startSystem() [L779] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L920] RET startSystem() [L935] CALL timeShift() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L573] COND TRUE \read(pumpRunning) [L575] CALL lowerWaterLevel() [L790] COND TRUE waterLevel > 0 [L791] waterLevel = waterLevel - 1 VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L575] RET lowerWaterLevel() [L580] COND TRUE \read(systemActive) [L582] CALL processEnvironment() [L628] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L631] COND TRUE \read(pumpRunning) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L633] CALL, EXPR isMethaneAlarm() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L686] int retValue_acc ; [L690] CALL, EXPR isMethaneLevelCritical() [L823] int retValue_acc ; [L826] retValue_acc = methaneLevelCritical [L827] 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] [L690] RET, EXPR isMethaneLevelCritical() [L690] retValue_acc = isMethaneLevelCritical() [L692] 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] [L633] RET, EXPR isMethaneAlarm() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L633] tmp = isMethaneAlarm() [L635] COND FALSE !(\read(tmp)) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L641] CALL processEnvironment__wrappee__methaneQuery() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L602] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L605] COND FALSE !(! pumpRunning) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L620] FCALL processEnvironment__wrappee__base() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L641] RET processEnvironment__wrappee__methaneQuery() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L582] RET processEnvironment() [L588] CALL __utac_acc__Specification4_spec__1() [L54] int tmp ; [L55] int tmp___0 ; [L59] CALL, EXPR getWaterLevel() [L855] int retValue_acc ; [L858] retValue_acc = waterLevel [L859] 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] [L59] RET, EXPR getWaterLevel() [L59] tmp = getWaterLevel() [L61] COND FALSE !(tmp == 0) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L588] RET __utac_acc__Specification4_spec__1() [L935] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L888] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L890] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L896] tmp = __VERIFIER_nondet_int() [L898] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L906] tmp___0 = __VERIFIER_nondet_int() [L908] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L916] tmp___2 = __VERIFIER_nondet_int() [L918] COND TRUE \read(tmp___2) [L920] CALL startSystem() [L779] systemActive = 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L920] RET startSystem() [L935] CALL timeShift() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L573] COND TRUE \read(pumpRunning) [L575] CALL lowerWaterLevel() [L790] COND TRUE waterLevel > 0 [L791] waterLevel = waterLevel - 1 VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L575] RET lowerWaterLevel() [L580] COND TRUE \read(systemActive) [L582] CALL processEnvironment() [L628] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L631] COND TRUE \read(pumpRunning) VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L633] CALL, EXPR isMethaneAlarm() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L686] int retValue_acc ; [L690] CALL, EXPR isMethaneLevelCritical() [L823] int retValue_acc ; [L826] retValue_acc = methaneLevelCritical [L827] 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] [L690] RET, EXPR isMethaneLevelCritical() [L690] retValue_acc = isMethaneLevelCritical() [L692] 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] [L633] RET, EXPR isMethaneAlarm() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L633] tmp = isMethaneAlarm() [L635] COND FALSE !(\read(tmp)) VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L641] CALL processEnvironment__wrappee__methaneQuery() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L602] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L605] COND FALSE !(! pumpRunning) VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L620] FCALL processEnvironment__wrappee__base() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L641] RET processEnvironment__wrappee__methaneQuery() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L582] RET processEnvironment() [L588] CALL __utac_acc__Specification4_spec__1() [L54] int tmp ; [L55] int tmp___0 ; [L59] CALL, EXPR getWaterLevel() [L855] int retValue_acc ; [L858] retValue_acc = waterLevel [L859] 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] [L59] RET, EXPR getWaterLevel() [L59] tmp = getWaterLevel() [L61] COND TRUE tmp == 0 [L63] CALL, EXPR isPumpRunning() [L697] int retValue_acc ; [L700] retValue_acc = pumpRunning [L701] 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] [L63] RET, EXPR isPumpRunning() [L63] tmp___0 = isPumpRunning() [L65] COND TRUE \read(tmp___0) [L67] CALL __automaton_fail() [L449] 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 9 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1554 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1524 mSDsluCounter, 3000 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2023 mSDsCounter, 363 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1710 IncrementalHoareTripleChecker+Invalid, 2073 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 363 mSolverCounterUnsat, 977 mSDtfsCounter, 1710 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 332 GetRequests, 237 SyntacticMatches, 8 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=570occurred in iteration=9, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 263 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 682 NumberOfCodeBlocks, 682 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 632 ConstructedInterpolants, 0 QuantifiedInterpolants, 1177 SizeOfPredicates, 2 NumberOfNonLiveVariables, 295 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 67/90 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-11 20:55:15,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE