./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product41.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec1_product41.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 7e401b19fa73801dafa3ee94892588c53fc375d864d82edcc9ff671172238c8c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 23:15:20,784 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 23:15:20,866 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 23:15:20,870 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 23:15:20,872 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 23:15:20,895 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 23:15:20,896 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 23:15:20,896 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 23:15:20,896 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 23:15:20,897 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 23:15:20,897 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 23:15:20,897 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 23:15:20,898 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 23:15:20,898 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 23:15:20,899 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 23:15:20,899 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 23:15:20,899 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 23:15:20,900 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 23:15:20,900 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 23:15:20,900 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 23:15:20,901 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 23:15:20,901 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 23:15:20,901 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 23:15:20,902 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 23:15:20,902 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 23:15:20,903 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 23:15:20,903 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 23:15:20,903 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 23:15:20,904 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 23:15:20,904 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 23:15:20,904 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 23:15:20,905 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 23:15:20,905 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:15:20,905 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 23:15:20,906 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 23:15:20,906 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 23:15:20,906 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 23:15:20,907 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 23:15:20,907 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 23:15:20,907 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 23:15:20,907 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 23:15:20,908 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 23:15:20,908 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 -> 7e401b19fa73801dafa3ee94892588c53fc375d864d82edcc9ff671172238c8c [2024-11-09 23:15:21,167 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 23:15:21,187 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 23:15:21,189 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 23:15:21,190 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 23:15:21,191 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 23:15:21,192 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product41.cil.c [2024-11-09 23:15:22,635 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 23:15:22,859 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 23:15:22,863 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product41.cil.c [2024-11-09 23:15:22,880 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bafe6f68/53d45ebc6ea14363ad3a370a74d95336/FLAG43ed450bd [2024-11-09 23:15:23,201 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bafe6f68/53d45ebc6ea14363ad3a370a74d95336 [2024-11-09 23:15:23,203 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 23:15:23,204 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 23:15:23,205 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 23:15:23,205 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 23:15:23,216 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 23:15:23,216 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:15:23" (1/1) ... [2024-11-09 23:15:23,217 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@673e140e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:15:23, skipping insertion in model container [2024-11-09 23:15:23,218 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:15:23" (1/1) ... [2024-11-09 23:15:23,263 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 23:15:23,557 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product41.cil.c[17493,17506] [2024-11-09 23:15:23,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:15:23,584 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 23:15:23,594 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [49] [2024-11-09 23:15:23,597 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [415] [2024-11-09 23:15:23,597 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [484] [2024-11-09 23:15:23,597 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [583] [2024-11-09 23:15:23,597 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [758] [2024-11-09 23:15:23,598 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [857] [2024-11-09 23:15:23,598 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [892] [2024-11-09 23:15:23,598 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [901] [2024-11-09 23:15:23,662 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product41.cil.c[17493,17506] [2024-11-09 23:15:23,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:15:23,693 INFO L204 MainTranslator]: Completed translation [2024-11-09 23:15:23,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:15:23 WrapperNode [2024-11-09 23:15:23,694 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 23:15:23,695 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 23:15:23,695 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 23:15:23,695 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 23:15:23,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:15:23" (1/1) ... [2024-11-09 23:15:23,714 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:15:23" (1/1) ... [2024-11-09 23:15:23,738 INFO L138 Inliner]: procedures = 53, calls = 95, calls flagged for inlining = 21, calls inlined = 18, statements flattened = 180 [2024-11-09 23:15:23,738 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 23:15:23,739 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 23:15:23,739 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 23:15:23,739 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 23:15:23,749 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:15:23" (1/1) ... [2024-11-09 23:15:23,749 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:15:23" (1/1) ... [2024-11-09 23:15:23,754 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:15:23" (1/1) ... [2024-11-09 23:15:23,779 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-09 23:15:23,782 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:15:23" (1/1) ... [2024-11-09 23:15:23,782 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:15:23" (1/1) ... [2024-11-09 23:15:23,791 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:15:23" (1/1) ... [2024-11-09 23:15:23,791 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:15:23" (1/1) ... [2024-11-09 23:15:23,792 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:15:23" (1/1) ... [2024-11-09 23:15:23,797 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:15:23" (1/1) ... [2024-11-09 23:15:23,799 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 23:15:23,800 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 23:15:23,800 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 23:15:23,801 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 23:15:23,801 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:15:23" (1/1) ... [2024-11-09 23:15:23,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:15:23,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:15:23,843 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-09 23:15:23,850 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-09 23:15:23,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 23:15:23,897 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-09 23:15:23,897 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-09 23:15:23,898 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-11-09 23:15:23,898 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-11-09 23:15:23,898 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-09 23:15:23,898 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-09 23:15:23,898 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-09 23:15:23,899 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-09 23:15:23,899 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-09 23:15:23,899 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-09 23:15:23,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 23:15:23,900 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-09 23:15:23,900 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-09 23:15:23,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 23:15:23,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 23:15:23,986 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 23:15:23,989 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 23:15:24,045 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L534: #res := ~retValue_acc~3; [2024-11-09 23:15:24,174 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L700-1: isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~7#1; [2024-11-09 23:15:24,175 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L755-1: isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~8#1; [2024-11-09 23:15:24,175 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L691-1: isMethaneAlarm_#res#1 := isMethaneAlarm_~retValue_acc~6#1; [2024-11-09 23:15:24,175 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L580-1: isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~5#1; [2024-11-09 23:15:24,257 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L889-1: valid_product_#res#1 := valid_product_~retValue_acc~11#1; [2024-11-09 23:15:24,257 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L854-1: main_#res#1 := main_~retValue_acc~9#1; [2024-11-09 23:15:24,300 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2024-11-09 23:15:24,302 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 23:15:24,327 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 23:15:24,328 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 23:15:24,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:15:24 BoogieIcfgContainer [2024-11-09 23:15:24,328 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 23:15:24,333 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 23:15:24,334 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 23:15:24,338 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 23:15:24,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:15:23" (1/3) ... [2024-11-09 23:15:24,339 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@406a6a3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:15:24, skipping insertion in model container [2024-11-09 23:15:24,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:15:23" (2/3) ... [2024-11-09 23:15:24,339 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@406a6a3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:15:24, skipping insertion in model container [2024-11-09 23:15:24,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:15:24" (3/3) ... [2024-11-09 23:15:24,342 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product41.cil.c [2024-11-09 23:15:24,359 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 23:15:24,360 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 23:15:24,415 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 23:15:24,420 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;@43ad572b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 23:15:24,420 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 23:15:24,423 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 71 states have internal predecessors, (89), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 23:15:24,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 23:15:24,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:15:24,433 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:15:24,434 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:15:24,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:15:24,439 INFO L85 PathProgramCache]: Analyzing trace with hash -140383391, now seen corresponding path program 1 times [2024-11-09 23:15:24,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:15:24,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906322755] [2024-11-09 23:15:24,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:15:24,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:15:24,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:24,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 23:15:24,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:24,645 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-09 23:15:24,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:15:24,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906322755] [2024-11-09 23:15:24,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906322755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:15:24,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:15:24,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 23:15:24,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570208674] [2024-11-09 23:15:24,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:15:24,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 23:15:24,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:15:24,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 23:15:24,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 23:15:24,678 INFO L87 Difference]: Start difference. First operand has 83 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 71 states have internal predecessors, (89), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 23:15:24,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:15:24,707 INFO L93 Difference]: Finished difference Result 157 states and 212 transitions. [2024-11-09 23:15:24,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 23:15:24,710 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-11-09 23:15:24,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:15:24,719 INFO L225 Difference]: With dead ends: 157 [2024-11-09 23:15:24,719 INFO L226 Difference]: Without dead ends: 72 [2024-11-09 23:15:24,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 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-09 23:15:24,726 INFO L432 NwaCegarLoop]: 102 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, 102 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-09 23:15:24,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:15:24,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-09 23:15:24,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-09 23:15:24,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 61 states have internal predecessors, (73), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 23:15:24,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2024-11-09 23:15:24,764 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 25 [2024-11-09 23:15:24,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:15:24,765 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2024-11-09 23:15:24,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 23:15:24,766 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2024-11-09 23:15:24,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 23:15:24,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:15:24,768 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:15:24,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 23:15:24,768 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:15:24,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:15:24,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1493462393, now seen corresponding path program 1 times [2024-11-09 23:15:24,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:15:24,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979849952] [2024-11-09 23:15:24,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:15:24,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:15:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:24,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 23:15:24,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:24,919 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-09 23:15:24,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:15:24,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979849952] [2024-11-09 23:15:24,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979849952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:15:24,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:15:24,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:15:24,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278387544] [2024-11-09 23:15:24,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:15:24,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:15:24,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:15:24,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:15:24,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:15:24,927 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 23:15:24,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:15:24,949 INFO L93 Difference]: Finished difference Result 109 states and 139 transitions. [2024-11-09 23:15:24,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:15:24,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-11-09 23:15:24,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:15:24,951 INFO L225 Difference]: With dead ends: 109 [2024-11-09 23:15:24,951 INFO L226 Difference]: Without dead ends: 62 [2024-11-09 23:15:24,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:15:24,953 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 11 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 140 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-09 23:15:24,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 140 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:15:24,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-09 23:15:24,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-09 23:15:24,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 54 states have internal predecessors, (65), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 23:15:24,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2024-11-09 23:15:24,962 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 27 [2024-11-09 23:15:24,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:15:24,963 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2024-11-09 23:15:24,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 23:15:24,963 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2024-11-09 23:15:24,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 23:15:24,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:15:24,964 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:15:24,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 23:15:24,965 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:15:24,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:15:24,966 INFO L85 PathProgramCache]: Analyzing trace with hash 351906342, now seen corresponding path program 1 times [2024-11-09 23:15:24,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:15:24,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589824055] [2024-11-09 23:15:24,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:15:24,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:15:24,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:25,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 23:15:25,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:25,088 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-09 23:15:25,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:15:25,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589824055] [2024-11-09 23:15:25,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589824055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:15:25,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:15:25,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:15:25,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436802468] [2024-11-09 23:15:25,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:15:25,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:15:25,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:15:25,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:15:25,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:15:25,095 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 23:15:25,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:15:25,112 INFO L93 Difference]: Finished difference Result 117 states and 152 transitions. [2024-11-09 23:15:25,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:15:25,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2024-11-09 23:15:25,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:15:25,113 INFO L225 Difference]: With dead ends: 117 [2024-11-09 23:15:25,113 INFO L226 Difference]: Without dead ends: 62 [2024-11-09 23:15:25,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:15:25,115 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 61 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 77 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-09 23:15:25,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 77 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:15:25,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-09 23:15:25,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-09 23:15:25,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 54 states have internal predecessors, (64), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 23:15:25,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 78 transitions. [2024-11-09 23:15:25,121 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 78 transitions. Word has length 29 [2024-11-09 23:15:25,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:15:25,121 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 78 transitions. [2024-11-09 23:15:25,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 23:15:25,121 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2024-11-09 23:15:25,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 23:15:25,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:15:25,122 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:15:25,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 23:15:25,122 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:15:25,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:15:25,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1815153013, now seen corresponding path program 1 times [2024-11-09 23:15:25,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:15:25,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965487314] [2024-11-09 23:15:25,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:15:25,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:15:25,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:25,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 23:15:25,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:25,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 23:15:25,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:25,187 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-09 23:15:25,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:15:25,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965487314] [2024-11-09 23:15:25,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965487314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:15:25,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:15:25,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:15:25,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202153276] [2024-11-09 23:15:25,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:15:25,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:15:25,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:15:25,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:15:25,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:15:25,190 INFO L87 Difference]: Start difference. First operand 62 states and 78 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 23:15:25,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:15:25,221 INFO L93 Difference]: Finished difference Result 157 states and 201 transitions. [2024-11-09 23:15:25,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:15:25,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 34 [2024-11-09 23:15:25,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:15:25,223 INFO L225 Difference]: With dead ends: 157 [2024-11-09 23:15:25,224 INFO L226 Difference]: Without dead ends: 102 [2024-11-09 23:15:25,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-09 23:15:25,225 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 67 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:15:25,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 136 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:15:25,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-09 23:15:25,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2024-11-09 23:15:25,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 77 states have (on average 1.2987012987012987) internal successors, (100), 84 states have internal predecessors, (100), 11 states have call successors, (11), 10 states have call predecessors, (11), 10 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-09 23:15:25,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 124 transitions. [2024-11-09 23:15:25,247 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 124 transitions. Word has length 34 [2024-11-09 23:15:25,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:15:25,247 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 124 transitions. [2024-11-09 23:15:25,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 23:15:25,248 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 124 transitions. [2024-11-09 23:15:25,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 23:15:25,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:15:25,249 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:15:25,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 23:15:25,250 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:15:25,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:15:25,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1123493991, now seen corresponding path program 1 times [2024-11-09 23:15:25,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:15:25,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667739414] [2024-11-09 23:15:25,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:15:25,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:15:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:25,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:15:25,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:25,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-09 23:15:25,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:25,398 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-09 23:15:25,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:15:25,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667739414] [2024-11-09 23:15:25,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667739414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:15:25,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:15:25,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:15:25,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804864044] [2024-11-09 23:15:25,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:15:25,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:15:25,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:15:25,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:15:25,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:15:25,401 INFO L87 Difference]: Start difference. First operand 99 states and 124 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 23:15:25,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:15:25,479 INFO L93 Difference]: Finished difference Result 102 states and 126 transitions. [2024-11-09 23:15:25,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:15:25,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2024-11-09 23:15:25,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:15:25,485 INFO L225 Difference]: With dead ends: 102 [2024-11-09 23:15:25,485 INFO L226 Difference]: Without dead ends: 99 [2024-11-09 23:15:25,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 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-09 23:15:25,487 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 52 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:15:25,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 287 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:15:25,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-09 23:15:25,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-09 23:15:25,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 77 states have (on average 1.2857142857142858) internal successors, (99), 84 states have internal predecessors, (99), 11 states have call successors, (11), 10 states have call predecessors, (11), 10 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-09 23:15:25,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 123 transitions. [2024-11-09 23:15:25,509 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 123 transitions. Word has length 40 [2024-11-09 23:15:25,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:15:25,509 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 123 transitions. [2024-11-09 23:15:25,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 23:15:25,513 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 123 transitions. [2024-11-09 23:15:25,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 23:15:25,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:15:25,514 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:15:25,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 23:15:25,515 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:15:25,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:15:25,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1556087064, now seen corresponding path program 1 times [2024-11-09 23:15:25,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:15:25,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416514620] [2024-11-09 23:15:25,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:15:25,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:15:25,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:25,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:15:25,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:25,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 23:15:25,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:25,685 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 23:15:25,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:15:25,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416514620] [2024-11-09 23:15:25,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416514620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:15:25,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:15:25,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:15:25,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044714418] [2024-11-09 23:15:25,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:15:25,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:15:25,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:15:25,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:15:25,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:15:25,690 INFO L87 Difference]: Start difference. First operand 99 states and 123 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 23:15:25,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:15:25,724 INFO L93 Difference]: Finished difference Result 194 states and 247 transitions. [2024-11-09 23:15:25,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:15:25,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2024-11-09 23:15:25,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:15:25,726 INFO L225 Difference]: With dead ends: 194 [2024-11-09 23:15:25,726 INFO L226 Difference]: Without dead ends: 102 [2024-11-09 23:15:25,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:15:25,727 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:15:25,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 293 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:15:25,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-09 23:15:25,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-09 23:15:25,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 80 states have (on average 1.275) internal successors, (102), 87 states have internal predecessors, (102), 11 states have call successors, (11), 10 states have call predecessors, (11), 10 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-09 23:15:25,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 126 transitions. [2024-11-09 23:15:25,738 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 126 transitions. Word has length 46 [2024-11-09 23:15:25,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:15:25,739 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 126 transitions. [2024-11-09 23:15:25,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 23:15:25,739 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 126 transitions. [2024-11-09 23:15:25,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 23:15:25,741 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:15:25,741 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:15:25,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 23:15:25,741 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:15:25,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:15:25,742 INFO L85 PathProgramCache]: Analyzing trace with hash 661670889, now seen corresponding path program 1 times [2024-11-09 23:15:25,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:15:25,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843855986] [2024-11-09 23:15:25,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:15:25,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:15:25,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:25,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:15:25,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:25,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 23:15:25,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:25,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 23:15:25,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:15:25,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843855986] [2024-11-09 23:15:25,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843855986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:15:25,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:15:25,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 23:15:25,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765630287] [2024-11-09 23:15:25,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:15:25,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 23:15:25,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:15:25,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 23:15:25,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 23:15:25,811 INFO L87 Difference]: Start difference. First operand 102 states and 126 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 23:15:25,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:15:25,835 INFO L93 Difference]: Finished difference Result 199 states and 252 transitions. [2024-11-09 23:15:25,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 23:15:25,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2024-11-09 23:15:25,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:15:25,837 INFO L225 Difference]: With dead ends: 199 [2024-11-09 23:15:25,837 INFO L226 Difference]: Without dead ends: 104 [2024-11-09 23:15:25,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 23:15:25,840 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:15:25,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 222 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:15:25,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-09 23:15:25,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-09 23:15:25,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 82 states have (on average 1.2682926829268293) internal successors, (104), 89 states have internal predecessors, (104), 11 states have call successors, (11), 10 states have call predecessors, (11), 10 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-09 23:15:25,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 128 transitions. [2024-11-09 23:15:25,859 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 128 transitions. Word has length 46 [2024-11-09 23:15:25,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:15:25,859 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 128 transitions. [2024-11-09 23:15:25,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 23:15:25,860 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 128 transitions. [2024-11-09 23:15:25,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 23:15:25,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:15:25,862 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:15:25,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 23:15:25,862 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:15:25,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:15:25,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1710068373, now seen corresponding path program 1 times [2024-11-09 23:15:25,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:15:25,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500782403] [2024-11-09 23:15:25,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:15:25,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:15:25,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:25,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:15:25,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:25,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 23:15:25,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:25,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 23:15:25,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:15:25,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500782403] [2024-11-09 23:15:25,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500782403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:15:25,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:15:25,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:15:25,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179869365] [2024-11-09 23:15:25,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:15:25,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:15:25,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:15:25,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:15:25,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:15:25,961 INFO L87 Difference]: Start difference. First operand 104 states and 128 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 23:15:25,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:15:25,989 INFO L93 Difference]: Finished difference Result 242 states and 302 transitions. [2024-11-09 23:15:25,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:15:25,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2024-11-09 23:15:25,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:15:25,995 INFO L225 Difference]: With dead ends: 242 [2024-11-09 23:15:25,995 INFO L226 Difference]: Without dead ends: 145 [2024-11-09 23:15:25,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-09 23:15:25,996 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 34 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:15:25,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 143 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:15:25,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-09 23:15:26,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-11-09 23:15:26,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 114 states have (on average 1.2456140350877194) internal successors, (142), 122 states have internal predecessors, (142), 16 states have call successors, (16), 15 states have call predecessors, (16), 14 states have return successors, (18), 15 states have call predecessors, (18), 16 states have call successors, (18) [2024-11-09 23:15:26,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 176 transitions. [2024-11-09 23:15:26,013 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 176 transitions. Word has length 46 [2024-11-09 23:15:26,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:15:26,013 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 176 transitions. [2024-11-09 23:15:26,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 23:15:26,014 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 176 transitions. [2024-11-09 23:15:26,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 23:15:26,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:15:26,015 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:15:26,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 23:15:26,015 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:15:26,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:15:26,017 INFO L85 PathProgramCache]: Analyzing trace with hash -523530931, now seen corresponding path program 1 times [2024-11-09 23:15:26,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:15:26,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688688344] [2024-11-09 23:15:26,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:15:26,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:15:26,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:26,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 23:15:26,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:26,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 23:15:26,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:26,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:15:26,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:26,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 23:15:26,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:15:26,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688688344] [2024-11-09 23:15:26,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688688344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:15:26,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:15:26,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:15:26,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446153993] [2024-11-09 23:15:26,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:15:26,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:15:26,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:15:26,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:15:26,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:15:26,176 INFO L87 Difference]: Start difference. First operand 145 states and 176 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 23:15:26,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:15:26,435 INFO L93 Difference]: Finished difference Result 505 states and 633 transitions. [2024-11-09 23:15:26,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 23:15:26,436 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2024-11-09 23:15:26,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:15:26,438 INFO L225 Difference]: With dead ends: 505 [2024-11-09 23:15:26,441 INFO L226 Difference]: Without dead ends: 367 [2024-11-09 23:15:26,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-09 23:15:26,442 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 116 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:15:26,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 348 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:15:26,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-11-09 23:15:26,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 360. [2024-11-09 23:15:26,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 283 states have (on average 1.2190812720848057) internal successors, (345), 308 states have internal predecessors, (345), 42 states have call successors, (42), 30 states have call predecessors, (42), 34 states have return successors, (55), 40 states have call predecessors, (55), 42 states have call successors, (55) [2024-11-09 23:15:26,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 442 transitions. [2024-11-09 23:15:26,490 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 442 transitions. Word has length 50 [2024-11-09 23:15:26,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:15:26,490 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 442 transitions. [2024-11-09 23:15:26,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 23:15:26,490 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 442 transitions. [2024-11-09 23:15:26,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 23:15:26,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:15:26,493 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:15:26,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 23:15:26,493 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:15:26,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:15:26,493 INFO L85 PathProgramCache]: Analyzing trace with hash 616340622, now seen corresponding path program 1 times [2024-11-09 23:15:26,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:15:26,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275588044] [2024-11-09 23:15:26,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:15:26,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:15:26,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:26,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 23:15:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:26,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 23:15:26,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:26,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 23:15:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:26,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 23:15:26,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:26,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 23:15:26,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:15:26,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275588044] [2024-11-09 23:15:26,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275588044] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:15:26,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073928257] [2024-11-09 23:15:26,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:15:26,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:15:26,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:15:26,700 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-09 23:15:26,701 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-09 23:15:26,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:15:26,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 23:15:26,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:15:26,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:15:26,948 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 23:15:26,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073928257] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:15:26,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 23:15:26,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 17 [2024-11-09 23:15:26,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305438870] [2024-11-09 23:15:26,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:15:26,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:15:26,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:15:26,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:15:26,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2024-11-09 23:15:26,950 INFO L87 Difference]: Start difference. First operand 360 states and 442 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 23:15:27,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:15:27,055 INFO L93 Difference]: Finished difference Result 709 states and 875 transitions. [2024-11-09 23:15:27,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 23:15:27,056 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 54 [2024-11-09 23:15:27,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:15:27,058 INFO L225 Difference]: With dead ends: 709 [2024-11-09 23:15:27,058 INFO L226 Difference]: Without dead ends: 356 [2024-11-09 23:15:27,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2024-11-09 23:15:27,060 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 48 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:15:27,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 632 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:15:27,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-11-09 23:15:27,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 345. [2024-11-09 23:15:27,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 271 states have (on average 1.2029520295202951) internal successors, (326), 293 states have internal predecessors, (326), 40 states have call successors, (40), 30 states have call predecessors, (40), 33 states have return successors, (48), 38 states have call predecessors, (48), 40 states have call successors, (48) [2024-11-09 23:15:27,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 414 transitions. [2024-11-09 23:15:27,086 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 414 transitions. Word has length 54 [2024-11-09 23:15:27,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:15:27,087 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 414 transitions. [2024-11-09 23:15:27,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 23:15:27,087 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 414 transitions. [2024-11-09 23:15:27,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-09 23:15:27,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:15:27,089 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-11-09 23:15:27,106 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-09 23:15:27,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 23:15:27,294 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:15:27,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:15:27,294 INFO L85 PathProgramCache]: Analyzing trace with hash 47898826, now seen corresponding path program 1 times [2024-11-09 23:15:27,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:15:27,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878208891] [2024-11-09 23:15:27,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:15:27,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:15:27,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 23:15:27,314 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 23:15:27,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 23:15:27,354 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 23:15:27,354 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 23:15:27,355 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 23:15:27,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 23:15:27,358 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:15:27,423 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 23:15:27,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 11:15:27 BoogieIcfgContainer [2024-11-09 23:15:27,425 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 23:15:27,425 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 23:15:27,425 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 23:15:27,425 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 23:15:27,426 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:15:24" (3/4) ... [2024-11-09 23:15:27,426 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 23:15:27,486 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 23:15:27,486 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 23:15:27,487 INFO L158 Benchmark]: Toolchain (without parser) took 4282.69ms. Allocated memory was 167.8MB in the beginning and 207.6MB in the end (delta: 39.8MB). Free memory was 109.2MB in the beginning and 87.5MB in the end (delta: 21.8MB). Peak memory consumption was 64.5MB. Max. memory is 16.1GB. [2024-11-09 23:15:27,487 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 167.8MB. Free memory is still 129.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 23:15:27,487 INFO L158 Benchmark]: CACSL2BoogieTranslator took 488.63ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 87.1MB in the end (delta: 21.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-09 23:15:27,488 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.96ms. Allocated memory is still 167.8MB. Free memory was 87.1MB in the beginning and 84.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 23:15:27,488 INFO L158 Benchmark]: Boogie Preprocessor took 60.29ms. Allocated memory is still 167.8MB. Free memory was 84.9MB in the beginning and 82.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 23:15:27,488 INFO L158 Benchmark]: IcfgBuilder took 528.39ms. Allocated memory was 167.8MB in the beginning and 207.6MB in the end (delta: 39.8MB). Free memory was 82.9MB in the beginning and 177.0MB in the end (delta: -94.1MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. [2024-11-09 23:15:27,489 INFO L158 Benchmark]: TraceAbstraction took 3091.67ms. Allocated memory is still 207.6MB. Free memory was 177.0MB in the beginning and 93.8MB in the end (delta: 83.2MB). Peak memory consumption was 83.2MB. Max. memory is 16.1GB. [2024-11-09 23:15:27,489 INFO L158 Benchmark]: Witness Printer took 61.28ms. Allocated memory is still 207.6MB. Free memory was 93.8MB in the beginning and 87.5MB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 23:15:27,490 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 167.8MB. Free memory is still 129.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 488.63ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 87.1MB in the end (delta: 21.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.96ms. Allocated memory is still 167.8MB. Free memory was 87.1MB in the beginning and 84.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.29ms. Allocated memory is still 167.8MB. Free memory was 84.9MB in the beginning and 82.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 528.39ms. Allocated memory was 167.8MB in the beginning and 207.6MB in the end (delta: 39.8MB). Free memory was 82.9MB in the beginning and 177.0MB in the end (delta: -94.1MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3091.67ms. Allocated memory is still 207.6MB. Free memory was 177.0MB in the beginning and 93.8MB in the end (delta: 83.2MB). Peak memory consumption was 83.2MB. Max. memory is 16.1GB. * Witness Printer took 61.28ms. Allocated memory is still 207.6MB. Free memory was 93.8MB in the beginning and 87.5MB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [49] - GenericResultAtLocation [Line: 415]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [415] - GenericResultAtLocation [Line: 484]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [484] - GenericResultAtLocation [Line: 583]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [583] - GenericResultAtLocation [Line: 758]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [758] - GenericResultAtLocation [Line: 857]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [857] - GenericResultAtLocation [Line: 892]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [892] - GenericResultAtLocation [Line: 901]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [901] * 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: 897]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L219] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; [L490] int waterLevel = 1; [L491] int methaneLevelCritical = 0; [L588] int pumpRunning = 0; [L589] int systemActive = 1; [L759] int cleanupTimeShifts = 4; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L835] int retValue_acc ; [L836] int tmp ; [L840] FCALL select_helpers() [L841] FCALL select_features() [L842] CALL, EXPR valid_product() [L884] int retValue_acc ; [L887] retValue_acc = 1 [L888] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L842] RET, EXPR valid_product() [L842] tmp = valid_product() [L844] COND TRUE \read(tmp) [L846] FCALL setup() [L847] CALL runTest() [L826] CALL test() [L421] int splverifierCounter ; [L422] int tmp ; [L423] int tmp___0 ; [L424] int tmp___1 ; [L425] int tmp___2 ; [L428] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L430] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L432] COND TRUE splverifierCounter < 4 [L438] tmp = __VERIFIER_nondet_int() [L440] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L442] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L508] COND TRUE waterLevel < 2 [L509] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L442] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L448] tmp___0 = __VERIFIER_nondet_int() [L450] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L458] tmp___2 = __VERIFIER_nondet_int() [L460] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L473] CALL timeShift() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L596] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L603] COND TRUE \read(systemActive) [L605] CALL processEnvironment() [L625] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L628] COND TRUE ! pumpRunning [L630] CALL, EXPR isHighWaterLevel() [L740] int retValue_acc ; [L741] int tmp ; [L742] int tmp___0 ; [L746] CALL, EXPR isHighWaterSensorDry() [L570] int retValue_acc ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L573] COND FALSE !(waterLevel < 2) [L577] retValue_acc = 0 [L578] 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] [L746] RET, EXPR isHighWaterSensorDry() [L746] tmp = isHighWaterSensorDry() [L748] COND FALSE !(\read(tmp)) [L751] 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] [L753] retValue_acc = tmp___0 [L754] 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] [L630] RET, EXPR isHighWaterLevel() [L630] tmp = isHighWaterLevel() [L632] COND TRUE \read(tmp) [L634] CALL activatePump() [L659] int tmp ; [L663] CALL, EXPR isMethaneAlarm() [L684] int retValue_acc ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L688] CALL, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L529] int retValue_acc ; [L532] retValue_acc = methaneLevelCritical [L533] 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] [L688] RET, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L688] retValue_acc = isMethaneLevelCritical() [L690] 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] [L663] RET, EXPR isMethaneAlarm() [L663] tmp = isMethaneAlarm() [L665] COND FALSE !(\read(tmp)) [L669] CALL activatePump__wrappee__highWaterSensor() [L653] pumpRunning = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L669] RET activatePump__wrappee__highWaterSensor() [L634] RET activatePump() [L605] RET processEnvironment() [L611] CALL __utac_acc__Specification1_spec__1() [L903] int tmp ; [L904] int tmp___0 ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L908] CALL, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L529] int retValue_acc ; [L532] retValue_acc = methaneLevelCritical [L533] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L908] RET, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L908] tmp = isMethaneLevelCritical() [L910] COND FALSE !(\read(tmp)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L611] RET __utac_acc__Specification1_spec__1() [L473] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L430] COND TRUE 1 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L432] COND TRUE splverifierCounter < 4 [L438] tmp = __VERIFIER_nondet_int() [L440] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L448] tmp___0 = __VERIFIER_nondet_int() [L450] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L452] CALL changeMethaneLevel() VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L520] COND FALSE !(\read(methaneLevelCritical)) [L523] methaneLevelCritical = 1 VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L452] RET changeMethaneLevel() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L458] tmp___2 = __VERIFIER_nondet_int() [L460] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L473] CALL timeShift() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L596] COND TRUE \read(pumpRunning) [L598] CALL lowerWaterLevel() [L496] COND TRUE waterLevel > 0 [L497] waterLevel = waterLevel - 1 VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L598] RET lowerWaterLevel() [L603] COND TRUE \read(systemActive) [L605] CALL processEnvironment() [L625] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L628] COND FALSE !(! pumpRunning) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L643] FCALL processEnvironment__wrappee__base() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L605] RET processEnvironment() [L611] CALL __utac_acc__Specification1_spec__1() [L903] int tmp ; [L904] int tmp___0 ; VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L908] CALL, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L529] int retValue_acc ; [L532] retValue_acc = methaneLevelCritical [L533] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L908] RET, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L908] tmp = isMethaneLevelCritical() [L910] COND TRUE \read(tmp) [L912] CALL, EXPR isPumpRunning() [L695] int retValue_acc ; [L698] retValue_acc = pumpRunning [L699] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] [L912] RET, EXPR isPumpRunning() [L912] tmp___0 = isPumpRunning() [L914] COND TRUE \read(tmp___0) [L916] CALL __automaton_fail() [L897] reach_error() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 83 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 11, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 402 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 389 mSDsluCounter, 2380 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1526 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 253 IncrementalHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 854 mSDtfsCounter, 253 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 144 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=360occurred in iteration=9, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 21 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 533 NumberOfCodeBlocks, 533 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 440 ConstructedInterpolants, 0 QuantifiedInterpolants, 775 SizeOfPredicates, 1 NumberOfNonLiveVariables, 219 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 16/18 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-09 23:15:27,524 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