./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec2_product52.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_spec2_product52.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 4583285deb29d8014ded34089a46614a743cea13eee9bbb990cdfd770bfce36e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 23:16:20,947 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 23:16:21,034 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 23:16:21,041 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 23:16:21,041 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 23:16:21,065 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 23:16:21,065 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 23:16:21,066 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 23:16:21,066 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 23:16:21,068 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 23:16:21,068 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 23:16:21,069 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 23:16:21,069 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 23:16:21,071 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 23:16:21,071 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 23:16:21,071 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 23:16:21,071 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 23:16:21,072 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 23:16:21,072 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 23:16:21,072 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 23:16:21,072 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 23:16:21,073 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 23:16:21,073 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 23:16:21,073 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 23:16:21,073 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 23:16:21,074 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 23:16:21,074 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 23:16:21,074 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 23:16:21,074 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 23:16:21,075 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 23:16:21,075 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 23:16:21,075 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 23:16:21,075 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:16:21,076 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 23:16:21,076 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 23:16:21,079 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 23:16:21,080 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 23:16:21,081 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 23:16:21,081 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 23:16:21,081 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 23:16:21,081 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 23:16:21,082 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 23:16:21,082 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 -> 4583285deb29d8014ded34089a46614a743cea13eee9bbb990cdfd770bfce36e [2024-11-09 23:16:21,352 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 23:16:21,374 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 23:16:21,377 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 23:16:21,378 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 23:16:21,379 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 23:16:21,379 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec2_product52.cil.c [2024-11-09 23:16:22,816 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 23:16:23,045 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 23:16:23,045 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product52.cil.c [2024-11-09 23:16:23,058 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/244643100/cc1767d8e4bb45e996080f8a39912c3a/FLAGb07c27ac9 [2024-11-09 23:16:23,072 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/244643100/cc1767d8e4bb45e996080f8a39912c3a [2024-11-09 23:16:23,074 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 23:16:23,075 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 23:16:23,077 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 23:16:23,077 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 23:16:23,082 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 23:16:23,084 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:16:23" (1/1) ... [2024-11-09 23:16:23,085 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6faaf2ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:23, skipping insertion in model container [2024-11-09 23:16:23,085 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:16:23" (1/1) ... [2024-11-09 23:16:23,128 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 23:16:23,466 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_spec2_product52.cil.c[19177,19190] [2024-11-09 23:16:23,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:16:23,484 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 23:16:23,493 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [49] [2024-11-09 23:16:23,495 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [124] [2024-11-09 23:16:23,495 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [354] [2024-11-09 23:16:23,496 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [455] [2024-11-09 23:16:23,496 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [495] [2024-11-09 23:16:23,497 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [530] [2024-11-09 23:16:23,497 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [634] [2024-11-09 23:16:23,497 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1000] [2024-11-09 23:16:23,558 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_spec2_product52.cil.c[19177,19190] [2024-11-09 23:16:23,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:16:23,585 INFO L204 MainTranslator]: Completed translation [2024-11-09 23:16:23,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:23 WrapperNode [2024-11-09 23:16:23,586 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 23:16:23,587 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 23:16:23,587 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 23:16:23,587 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 23:16:23,594 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:16:23" (1/1) ... [2024-11-09 23:16:23,612 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:16:23" (1/1) ... [2024-11-09 23:16:23,638 INFO L138 Inliner]: procedures = 58, calls = 102, calls flagged for inlining = 24, calls inlined = 21, statements flattened = 211 [2024-11-09 23:16:23,642 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 23:16:23,643 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 23:16:23,643 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 23:16:23,643 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 23:16:23,654 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:23" (1/1) ... [2024-11-09 23:16:23,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:23" (1/1) ... [2024-11-09 23:16:23,657 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:23" (1/1) ... [2024-11-09 23:16:23,681 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:16:23,681 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:23" (1/1) ... [2024-11-09 23:16:23,681 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:23" (1/1) ... [2024-11-09 23:16:23,685 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:23" (1/1) ... [2024-11-09 23:16:23,686 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:23" (1/1) ... [2024-11-09 23:16:23,687 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:23" (1/1) ... [2024-11-09 23:16:23,688 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:23" (1/1) ... [2024-11-09 23:16:23,690 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 23:16:23,691 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 23:16:23,692 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 23:16:23,692 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 23:16:23,693 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:23" (1/1) ... [2024-11-09 23:16:23,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:16:23,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:16:23,734 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:16:23,738 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:16:23,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 23:16:23,791 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-09 23:16:23,791 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-09 23:16:23,791 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-11-09 23:16:23,791 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-11-09 23:16:23,791 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-09 23:16:23,791 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-09 23:16:23,792 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-09 23:16:23,792 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-09 23:16:23,792 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-11-09 23:16:23,792 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-11-09 23:16:23,792 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-09 23:16:23,792 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-09 23:16:23,792 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2024-11-09 23:16:23,792 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2024-11-09 23:16:23,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 23:16:23,793 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-09 23:16:23,793 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-09 23:16:23,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 23:16:23,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 23:16:23,868 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 23:16:23,870 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 23:16:23,914 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L576: #res := ~retValue_acc~7; [2024-11-09 23:16:24,017 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L254-1: isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~1#1; [2024-11-09 23:16:24,018 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L631-1: isLowWaterSensorDry_#res#1 := isLowWaterSensorDry_~retValue_acc~10#1; [2024-11-09 23:16:24,018 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L328-1: isLowWaterLevel_#res#1 := isLowWaterLevel_~retValue_acc~3#1; [2024-11-09 23:16:24,098 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L527-1: valid_product_#res#1 := valid_product_~retValue_acc~6#1; [2024-11-09 23:16:24,099 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L452-1: main_#res#1 := main_~retValue_acc~4#1; [2024-11-09 23:16:24,128 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L309-1: isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~2#1; [2024-11-09 23:16:24,129 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L622-1: isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~9#1; [2024-11-09 23:16:24,173 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-11-09 23:16:24,173 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 23:16:24,191 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 23:16:24,191 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 23:16:24,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:16:24 BoogieIcfgContainer [2024-11-09 23:16:24,192 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 23:16:24,194 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 23:16:24,194 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 23:16:24,196 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 23:16:24,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:16:23" (1/3) ... [2024-11-09 23:16:24,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b9a0b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:16:24, skipping insertion in model container [2024-11-09 23:16:24,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:23" (2/3) ... [2024-11-09 23:16:24,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b9a0b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:16:24, skipping insertion in model container [2024-11-09 23:16:24,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:16:24" (3/3) ... [2024-11-09 23:16:24,199 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product52.cil.c [2024-11-09 23:16:24,211 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 23:16:24,211 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 23:16:24,281 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 23:16:24,287 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;@6ff078ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 23:16:24,287 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 23:16:24,292 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 77 states have (on average 1.3636363636363635) internal successors, (105), 86 states have internal predecessors, (105), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 23:16:24,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 23:16:24,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:16:24,306 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:16:24,307 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:16:24,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:16:24,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1788723857, now seen corresponding path program 1 times [2024-11-09 23:16:24,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:16:24,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571659696] [2024-11-09 23:16:24,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:16:24,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:16:24,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:24,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 23:16:24,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:24,519 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:16:24,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:16:24,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571659696] [2024-11-09 23:16:24,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571659696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:16:24,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:16:24,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 23:16:24,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483412755] [2024-11-09 23:16:24,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:16:24,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 23:16:24,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:16:24,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 23:16:24,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 23:16:24,557 INFO L87 Difference]: Start difference. First operand has 100 states, 77 states have (on average 1.3636363636363635) internal successors, (105), 86 states have internal predecessors, (105), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 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:16:24,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:16:24,595 INFO L93 Difference]: Finished difference Result 190 states and 255 transitions. [2024-11-09 23:16:24,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 23:16:24,598 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 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:16:24,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:16:24,605 INFO L225 Difference]: With dead ends: 190 [2024-11-09 23:16:24,605 INFO L226 Difference]: Without dead ends: 89 [2024-11-09 23:16:24,608 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:16:24,611 INFO L432 NwaCegarLoop]: 124 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, 124 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:16:24,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:16:24,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-09 23:16:24,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-09 23:16:24,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 76 states have internal predecessors, (89), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 23:16:24,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 114 transitions. [2024-11-09 23:16:24,649 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 114 transitions. Word has length 27 [2024-11-09 23:16:24,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:16:24,650 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 114 transitions. [2024-11-09 23:16:24,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 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:16:24,650 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 114 transitions. [2024-11-09 23:16:24,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 23:16:24,653 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:16:24,653 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:16:24,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 23:16:24,654 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:16:24,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:16:24,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1670385685, now seen corresponding path program 1 times [2024-11-09 23:16:24,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:16:24,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367311322] [2024-11-09 23:16:24,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:16:24,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:16:24,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:24,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:16:24,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:24,799 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:16:24,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:16:24,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367311322] [2024-11-09 23:16:24,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367311322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:16:24,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:16:24,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:16:24,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186630247] [2024-11-09 23:16:24,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:16:24,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:16:24,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:16:24,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:16:24,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:16:24,805 INFO L87 Difference]: Start difference. First operand 89 states and 114 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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:16:24,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:16:24,826 INFO L93 Difference]: Finished difference Result 137 states and 175 transitions. [2024-11-09 23:16:24,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:16:24,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 29 [2024-11-09 23:16:24,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:16:24,830 INFO L225 Difference]: With dead ends: 137 [2024-11-09 23:16:24,830 INFO L226 Difference]: Without dead ends: 79 [2024-11-09 23:16:24,830 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:16:24,832 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 16 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 178 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:16:24,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 178 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:16:24,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-09 23:16:24,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-09 23:16:24,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 69 states have internal predecessors, (81), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 23:16:24,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 101 transitions. [2024-11-09 23:16:24,848 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 101 transitions. Word has length 29 [2024-11-09 23:16:24,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:16:24,848 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 101 transitions. [2024-11-09 23:16:24,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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:16:24,849 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 101 transitions. [2024-11-09 23:16:24,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 23:16:24,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:16:24,850 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] [2024-11-09 23:16:24,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 23:16:24,851 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:16:24,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:16:24,852 INFO L85 PathProgramCache]: Analyzing trace with hash 457795697, now seen corresponding path program 1 times [2024-11-09 23:16:24,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:16:24,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829488605] [2024-11-09 23:16:24,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:16:24,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:16:24,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:24,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 23:16:24,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:24,941 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:16:24,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:16:24,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829488605] [2024-11-09 23:16:24,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829488605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:16:24,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:16:24,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:16:24,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754535377] [2024-11-09 23:16:24,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:16:24,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:16:24,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:16:24,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:16:24,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:16:24,946 INFO L87 Difference]: Start difference. First operand 79 states and 101 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, (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:16:24,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:16:24,984 INFO L93 Difference]: Finished difference Result 219 states and 286 transitions. [2024-11-09 23:16:24,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:16:24,984 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, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2024-11-09 23:16:24,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:16:24,986 INFO L225 Difference]: With dead ends: 219 [2024-11-09 23:16:24,986 INFO L226 Difference]: Without dead ends: 148 [2024-11-09 23:16:24,987 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:16:24,988 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 78 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:16:24,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 207 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:16:24,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-09 23:16:25,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2024-11-09 23:16:25,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 109 states have (on average 1.3577981651376148) internal successors, (148), 124 states have internal predecessors, (148), 20 states have call successors, (20), 14 states have call predecessors, (20), 14 states have return successors, (20), 13 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 23:16:25,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 188 transitions. [2024-11-09 23:16:25,014 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 188 transitions. Word has length 32 [2024-11-09 23:16:25,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:16:25,015 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 188 transitions. [2024-11-09 23:16:25,015 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, (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:16:25,015 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 188 transitions. [2024-11-09 23:16:25,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 23:16:25,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:16:25,017 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:16:25,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 23:16:25,019 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:16:25,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:16:25,020 INFO L85 PathProgramCache]: Analyzing trace with hash -904561423, now seen corresponding path program 1 times [2024-11-09 23:16:25,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:16:25,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844908705] [2024-11-09 23:16:25,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:16:25,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:16:25,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:25,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 23:16:25,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:25,171 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:16:25,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:16:25,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844908705] [2024-11-09 23:16:25,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844908705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:16:25,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:16:25,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:16:25,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005610624] [2024-11-09 23:16:25,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:16:25,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:16:25,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:16:25,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:16:25,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:16:25,173 INFO L87 Difference]: Start difference. First operand 144 states and 188 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 23:16:25,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:16:25,277 INFO L93 Difference]: Finished difference Result 363 states and 486 transitions. [2024-11-09 23:16:25,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:16:25,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2024-11-09 23:16:25,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:16:25,280 INFO L225 Difference]: With dead ends: 363 [2024-11-09 23:16:25,280 INFO L226 Difference]: Without dead ends: 227 [2024-11-09 23:16:25,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:16:25,285 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 49 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:16:25,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 357 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:16:25,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-09 23:16:25,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2024-11-09 23:16:25,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 171 states have (on average 1.3157894736842106) internal successors, (225), 186 states have internal predecessors, (225), 28 states have call successors, (28), 26 states have call predecessors, (28), 26 states have return successors, (36), 25 states have call predecessors, (36), 28 states have call successors, (36) [2024-11-09 23:16:25,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 289 transitions. [2024-11-09 23:16:25,334 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 289 transitions. Word has length 35 [2024-11-09 23:16:25,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:16:25,335 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 289 transitions. [2024-11-09 23:16:25,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 23:16:25,336 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 289 transitions. [2024-11-09 23:16:25,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 23:16:25,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:16:25,341 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:16:25,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 23:16:25,342 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:16:25,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:16:25,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1372772584, now seen corresponding path program 1 times [2024-11-09 23:16:25,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:16:25,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728565158] [2024-11-09 23:16:25,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:16:25,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:16:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:25,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 23:16:25,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:25,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 23:16:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:25,528 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:16:25,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:16:25,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728565158] [2024-11-09 23:16:25,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728565158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:16:25,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:16:25,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:16:25,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185231359] [2024-11-09 23:16:25,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:16:25,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:16:25,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:16:25,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:16:25,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:16:25,532 INFO L87 Difference]: Start difference. First operand 226 states and 289 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 23:16:25,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:16:25,716 INFO L93 Difference]: Finished difference Result 499 states and 646 transitions. [2024-11-09 23:16:25,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 23:16:25,717 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2024-11-09 23:16:25,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:16:25,719 INFO L225 Difference]: With dead ends: 499 [2024-11-09 23:16:25,720 INFO L226 Difference]: Without dead ends: 281 [2024-11-09 23:16:25,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:16:25,722 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 54 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:16:25,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 370 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:16:25,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-11-09 23:16:25,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 278. [2024-11-09 23:16:25,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 213 states have (on average 1.2910798122065728) internal successors, (275), 228 states have internal predecessors, (275), 32 states have call successors, (32), 26 states have call predecessors, (32), 32 states have return successors, (46), 33 states have call predecessors, (46), 32 states have call successors, (46) [2024-11-09 23:16:25,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 353 transitions. [2024-11-09 23:16:25,753 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 353 transitions. Word has length 46 [2024-11-09 23:16:25,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:16:25,753 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 353 transitions. [2024-11-09 23:16:25,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 23:16:25,754 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 353 transitions. [2024-11-09 23:16:25,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 23:16:25,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:16:25,756 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:16:25,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 23:16:25,756 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:16:25,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:16:25,757 INFO L85 PathProgramCache]: Analyzing trace with hash 963948359, now seen corresponding path program 1 times [2024-11-09 23:16:25,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:16:25,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616016599] [2024-11-09 23:16:25,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:16:25,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:16:25,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:25,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 23:16:25,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:25,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 23:16:25,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:25,866 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:16:25,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:16:25,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616016599] [2024-11-09 23:16:25,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616016599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:16:25,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:16:25,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:16:25,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190470812] [2024-11-09 23:16:25,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:16:25,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:16:25,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:16:25,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:16:25,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:16:25,871 INFO L87 Difference]: Start difference. First operand 278 states and 353 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 23:16:26,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:16:26,120 INFO L93 Difference]: Finished difference Result 563 states and 728 transitions. [2024-11-09 23:16:26,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:16:26,121 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2024-11-09 23:16:26,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:16:26,124 INFO L225 Difference]: With dead ends: 563 [2024-11-09 23:16:26,126 INFO L226 Difference]: Without dead ends: 293 [2024-11-09 23:16:26,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-09 23:16:26,128 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 160 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:16:26,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 426 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:16:26,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-09 23:16:26,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 282. [2024-11-09 23:16:26,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 217 states have (on average 1.2857142857142858) internal successors, (279), 232 states have internal predecessors, (279), 32 states have call successors, (32), 26 states have call predecessors, (32), 32 states have return successors, (46), 33 states have call predecessors, (46), 32 states have call successors, (46) [2024-11-09 23:16:26,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 357 transitions. [2024-11-09 23:16:26,161 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 357 transitions. Word has length 46 [2024-11-09 23:16:26,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:16:26,162 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 357 transitions. [2024-11-09 23:16:26,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 23:16:26,162 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 357 transitions. [2024-11-09 23:16:26,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 23:16:26,166 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:16:26,166 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:16:26,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 23:16:26,166 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:16:26,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:16:26,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1182803077, now seen corresponding path program 1 times [2024-11-09 23:16:26,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:16:26,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888200123] [2024-11-09 23:16:26,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:16:26,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:16:26,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:26,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 23:16:26,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:26,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 23:16:26,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:26,281 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:16:26,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:16:26,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888200123] [2024-11-09 23:16:26,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888200123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:16:26,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:16:26,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:16:26,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819717775] [2024-11-09 23:16:26,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:16:26,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:16:26,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:16:26,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:16:26,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:16:26,284 INFO L87 Difference]: Start difference. First operand 282 states and 357 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 23:16:26,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:16:26,529 INFO L93 Difference]: Finished difference Result 808 states and 1061 transitions. [2024-11-09 23:16:26,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 23:16:26,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2024-11-09 23:16:26,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:16:26,536 INFO L225 Difference]: With dead ends: 808 [2024-11-09 23:16:26,536 INFO L226 Difference]: Without dead ends: 534 [2024-11-09 23:16:26,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 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:16:26,539 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 217 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:16:26,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 311 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:16:26,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2024-11-09 23:16:26,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 526. [2024-11-09 23:16:26,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 401 states have (on average 1.2518703241895262) internal successors, (502), 425 states have internal predecessors, (502), 63 states have call successors, (63), 59 states have call predecessors, (63), 61 states have return successors, (101), 62 states have call predecessors, (101), 63 states have call successors, (101) [2024-11-09 23:16:26,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 666 transitions. [2024-11-09 23:16:26,593 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 666 transitions. Word has length 46 [2024-11-09 23:16:26,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:16:26,594 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 666 transitions. [2024-11-09 23:16:26,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 23:16:26,595 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 666 transitions. [2024-11-09 23:16:26,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 23:16:26,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:16:26,596 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:16:26,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 23:16:26,596 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:16:26,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:16:26,597 INFO L85 PathProgramCache]: Analyzing trace with hash 476426275, now seen corresponding path program 1 times [2024-11-09 23:16:26,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:16:26,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443723248] [2024-11-09 23:16:26,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:16:26,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:16:26,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:26,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:16:26,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:26,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:16:26,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:26,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 23:16:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:26,694 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:16:26,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:16:26,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443723248] [2024-11-09 23:16:26,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443723248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:16:26,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:16:26,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:16:26,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071331614] [2024-11-09 23:16:26,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:16:26,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:16:26,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:16:26,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:16:26,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:16:26,698 INFO L87 Difference]: Start difference. First operand 526 states and 666 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 23:16:27,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:16:27,043 INFO L93 Difference]: Finished difference Result 1101 states and 1488 transitions. [2024-11-09 23:16:27,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:16:27,044 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2024-11-09 23:16:27,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:16:27,051 INFO L225 Difference]: With dead ends: 1101 [2024-11-09 23:16:27,051 INFO L226 Difference]: Without dead ends: 1098 [2024-11-09 23:16:27,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:16:27,052 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 309 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:16:27,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 232 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:16:27,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2024-11-09 23:16:27,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 973. [2024-11-09 23:16:27,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 742 states have (on average 1.2628032345013478) internal successors, (937), 797 states have internal predecessors, (937), 122 states have call successors, (122), 92 states have call predecessors, (122), 108 states have return successors, (267), 114 states have call predecessors, (267), 122 states have call successors, (267) [2024-11-09 23:16:27,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1326 transitions. [2024-11-09 23:16:27,132 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1326 transitions. Word has length 50 [2024-11-09 23:16:27,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:16:27,133 INFO L471 AbstractCegarLoop]: Abstraction has 973 states and 1326 transitions. [2024-11-09 23:16:27,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 23:16:27,133 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1326 transitions. [2024-11-09 23:16:27,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-09 23:16:27,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:16:27,136 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:16:27,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 23:16:27,136 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:16:27,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:16:27,137 INFO L85 PathProgramCache]: Analyzing trace with hash -800002575, now seen corresponding path program 1 times [2024-11-09 23:16:27,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:16:27,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364751092] [2024-11-09 23:16:27,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:16:27,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:16:27,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:27,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:16:27,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:27,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 23:16:27,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:27,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:16:27,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:27,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 23:16:27,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:27,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-09 23:16:27,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:27,237 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 23:16:27,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:16:27,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364751092] [2024-11-09 23:16:27,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364751092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:16:27,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:16:27,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:16:27,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131495739] [2024-11-09 23:16:27,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:16:27,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:16:27,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:16:27,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:16:27,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:16:27,240 INFO L87 Difference]: Start difference. First operand 973 states and 1326 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 4 states have internal predecessors, (67), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-09 23:16:27,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:16:27,567 INFO L93 Difference]: Finished difference Result 1597 states and 2163 transitions. [2024-11-09 23:16:27,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 23:16:27,568 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 4 states have internal predecessors, (67), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 80 [2024-11-09 23:16:27,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:16:27,572 INFO L225 Difference]: With dead ends: 1597 [2024-11-09 23:16:27,573 INFO L226 Difference]: Without dead ends: 632 [2024-11-09 23:16:27,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-11-09 23:16:27,577 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 278 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:16:27,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 327 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:16:27,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2024-11-09 23:16:27,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 585. [2024-11-09 23:16:27,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 450 states have (on average 1.2466666666666666) internal successors, (561), 481 states have internal predecessors, (561), 69 states have call successors, (69), 56 states have call predecessors, (69), 65 states have return successors, (140), 68 states have call predecessors, (140), 69 states have call successors, (140) [2024-11-09 23:16:27,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 770 transitions. [2024-11-09 23:16:27,625 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 770 transitions. Word has length 80 [2024-11-09 23:16:27,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:16:27,625 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 770 transitions. [2024-11-09 23:16:27,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 4 states have internal predecessors, (67), 4 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-09 23:16:27,626 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 770 transitions. [2024-11-09 23:16:27,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-09 23:16:27,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:16:27,628 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:16:27,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 23:16:27,628 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:16:27,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:16:27,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1110584474, now seen corresponding path program 1 times [2024-11-09 23:16:27,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:16:27,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755367494] [2024-11-09 23:16:27,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:16:27,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:16:27,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:27,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:16:27,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:27,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 23:16:27,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:27,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:16:27,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:27,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 23:16:27,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:27,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-09 23:16:27,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:27,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 23:16:27,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:27,797 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 23:16:27,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:16:27,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755367494] [2024-11-09 23:16:27,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755367494] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:16:27,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089171806] [2024-11-09 23:16:27,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:16:27,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:16:27,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:16:27,800 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:16:27,801 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:16:27,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:27,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 23:16:27,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:16:28,018 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:16:28,019 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 23:16:28,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089171806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:16:28,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 23:16:28,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 8 [2024-11-09 23:16:28,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573015675] [2024-11-09 23:16:28,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:16:28,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:16:28,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:16:28,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:16:28,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:16:28,023 INFO L87 Difference]: Start difference. First operand 585 states and 770 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 23:16:28,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:16:28,088 INFO L93 Difference]: Finished difference Result 995 states and 1337 transitions. [2024-11-09 23:16:28,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:16:28,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 89 [2024-11-09 23:16:28,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:16:28,092 INFO L225 Difference]: With dead ends: 995 [2024-11-09 23:16:28,092 INFO L226 Difference]: Without dead ends: 502 [2024-11-09 23:16:28,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:16:28,097 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 43 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:16:28,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 210 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:16:28,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2024-11-09 23:16:28,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 502. [2024-11-09 23:16:28,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 386 states have (on average 1.2253886010362693) internal successors, (473), 413 states have internal predecessors, (473), 59 states have call successors, (59), 51 states have call predecessors, (59), 56 states have return successors, (85), 58 states have call predecessors, (85), 59 states have call successors, (85) [2024-11-09 23:16:28,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 617 transitions. [2024-11-09 23:16:28,139 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 617 transitions. Word has length 89 [2024-11-09 23:16:28,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:16:28,139 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 617 transitions. [2024-11-09 23:16:28,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 23:16:28,140 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 617 transitions. [2024-11-09 23:16:28,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-09 23:16:28,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:16:28,142 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:16:28,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 23:16:28,342 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:16:28,343 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:16:28,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:16:28,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1865670069, now seen corresponding path program 1 times [2024-11-09 23:16:28,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:16:28,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471496642] [2024-11-09 23:16:28,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:16:28,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:16:28,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:28,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:16:28,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:28,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 23:16:28,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:28,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:16:28,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:28,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 23:16:28,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:28,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 23:16:28,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:28,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:16:28,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:28,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 23:16:28,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:28,545 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 23:16:28,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:16:28,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471496642] [2024-11-09 23:16:28,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471496642] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:16:28,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583959580] [2024-11-09 23:16:28,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:16:28,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:16:28,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:16:28,549 INFO L229 MonitoredProcess]: Starting monitored process 3 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:16:28,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 23:16:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:28,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 23:16:28,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:16:28,838 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 23:16:28,838 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:16:28,986 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 23:16:28,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583959580] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 23:16:28,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 23:16:28,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 5] total 14 [2024-11-09 23:16:28,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109544652] [2024-11-09 23:16:28,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:16:28,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:16:28,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:16:28,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:16:28,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-09 23:16:28,989 INFO L87 Difference]: Start difference. First operand 502 states and 617 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-09 23:16:29,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:16:29,179 INFO L93 Difference]: Finished difference Result 1423 states and 1794 transitions. [2024-11-09 23:16:29,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 23:16:29,180 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 92 [2024-11-09 23:16:29,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:16:29,186 INFO L225 Difference]: With dead ends: 1423 [2024-11-09 23:16:29,186 INFO L226 Difference]: Without dead ends: 929 [2024-11-09 23:16:29,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-09 23:16:29,189 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 57 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:16:29,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 453 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:16:29,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2024-11-09 23:16:29,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 877. [2024-11-09 23:16:29,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 665 states have (on average 1.1954887218045114) internal successors, (795), 715 states have internal predecessors, (795), 107 states have call successors, (107), 93 states have call predecessors, (107), 104 states have return successors, (156), 105 states have call predecessors, (156), 107 states have call successors, (156) [2024-11-09 23:16:29,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1058 transitions. [2024-11-09 23:16:29,267 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1058 transitions. Word has length 92 [2024-11-09 23:16:29,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:16:29,268 INFO L471 AbstractCegarLoop]: Abstraction has 877 states and 1058 transitions. [2024-11-09 23:16:29,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-09 23:16:29,268 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1058 transitions. [2024-11-09 23:16:29,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 23:16:29,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:16:29,270 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:16:29,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 23:16:29,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-09 23:16:29,475 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:16:29,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:16:29,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1144116756, now seen corresponding path program 1 times [2024-11-09 23:16:29,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:16:29,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495910029] [2024-11-09 23:16:29,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:16:29,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:16:29,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:29,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:16:29,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:29,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:16:29,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:29,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:16:29,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:29,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:16:29,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:29,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 23:16:29,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:29,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-09 23:16:29,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:29,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:16:29,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:29,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-09 23:16:29,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:29,707 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 23:16:29,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:16:29,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495910029] [2024-11-09 23:16:29,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495910029] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:16:29,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588328456] [2024-11-09 23:16:29,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:16:29,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:16:29,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:16:29,710 INFO L229 MonitoredProcess]: Starting monitored process 4 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:16:29,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 23:16:29,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:29,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 23:16:29,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:16:29,904 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:16:29,905 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 23:16:29,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588328456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:16:29,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 23:16:29,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 11 [2024-11-09 23:16:29,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813275664] [2024-11-09 23:16:29,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:16:29,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:16:29,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:16:29,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:16:29,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-09 23:16:29,906 INFO L87 Difference]: Start difference. First operand 877 states and 1058 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-09 23:16:30,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:16:30,087 INFO L93 Difference]: Finished difference Result 2082 states and 2600 transitions. [2024-11-09 23:16:30,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 23:16:30,088 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 96 [2024-11-09 23:16:30,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:16:30,095 INFO L225 Difference]: With dead ends: 2082 [2024-11-09 23:16:30,096 INFO L226 Difference]: Without dead ends: 1377 [2024-11-09 23:16:30,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 109 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:16:30,099 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 130 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:16:30,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 594 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:16:30,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2024-11-09 23:16:30,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 1223. [2024-11-09 23:16:30,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1223 states, 924 states have (on average 1.196969696969697) internal successors, (1106), 993 states have internal predecessors, (1106), 151 states have call successors, (151), 133 states have call predecessors, (151), 147 states have return successors, (225), 142 states have call predecessors, (225), 151 states have call successors, (225) [2024-11-09 23:16:30,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1482 transitions. [2024-11-09 23:16:30,196 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1482 transitions. Word has length 96 [2024-11-09 23:16:30,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:16:30,197 INFO L471 AbstractCegarLoop]: Abstraction has 1223 states and 1482 transitions. [2024-11-09 23:16:30,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-09 23:16:30,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1482 transitions. [2024-11-09 23:16:30,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 23:16:30,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:16:30,200 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:16:30,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 23:16:30,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:16:30,404 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:16:30,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:16:30,404 INFO L85 PathProgramCache]: Analyzing trace with hash -933092587, now seen corresponding path program 1 times [2024-11-09 23:16:30,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:16:30,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891635690] [2024-11-09 23:16:30,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:16:30,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:16:30,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:30,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:16:30,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:30,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:16:30,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:30,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:16:30,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:30,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:16:30,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:30,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 23:16:30,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:30,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-09 23:16:30,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:30,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:16:30,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:30,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-09 23:16:30,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:30,548 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 23:16:30,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:16:30,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891635690] [2024-11-09 23:16:30,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891635690] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:16:30,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903141308] [2024-11-09 23:16:30,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:16:30,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:16:30,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:16:30,550 INFO L229 MonitoredProcess]: Starting monitored process 5 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:16:30,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 23:16:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:30,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 23:16:30,645 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:16:30,680 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 23:16:30,680 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 23:16:30,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903141308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:16:30,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 23:16:30,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-11-09 23:16:30,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297739433] [2024-11-09 23:16:30,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:16:30,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:16:30,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:16:30,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:16:30,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-09 23:16:30,682 INFO L87 Difference]: Start difference. First operand 1223 states and 1482 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 23:16:30,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:16:30,739 INFO L93 Difference]: Finished difference Result 1716 states and 2071 transitions. [2024-11-09 23:16:30,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:16:30,740 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 96 [2024-11-09 23:16:30,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:16:30,742 INFO L225 Difference]: With dead ends: 1716 [2024-11-09 23:16:30,742 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 23:16:30,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-09 23:16:30,746 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:16:30,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 343 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:16:30,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 23:16:30,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 23:16:30,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:16:30,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 23:16:30,748 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 96 [2024-11-09 23:16:30,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:16:30,748 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 23:16:30,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 23:16:30,748 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 23:16:30,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 23:16:30,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 23:16:30,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 23:16:30,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:16:30,954 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:16:30,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 23:16:34,593 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 23:16:34,605 WARN L156 FloydHoareUtils]: Requires clause for deactivatePump contained old-variable. Original clause: (and (= ~pumpRunning~0 |old(~pumpRunning~0)|) (let ((.cse0 (<= 1 |old(~pumpRunning~0)|))) (or (and (<= 2 ~waterLevel~0) .cse0 (not (= 0 ~systemActive~0))) (and (= 1 ~systemActive~0) (<= 1 ~waterLevel~0) .cse0)))) Eliminated clause: (let ((.cse0 (<= 1 ~pumpRunning~0))) (or (and .cse0 (<= 2 ~waterLevel~0) (not (= 0 ~systemActive~0))) (and .cse0 (= 1 ~systemActive~0) (<= 1 ~waterLevel~0)))) [2024-11-09 23:16:34,626 WARN L156 FloydHoareUtils]: Requires clause for changeMethaneLevel contained old-variable. Original clause: (let ((.cse0 (= ~methAndRunningLastTime~0 0))) (and (or (not (= |old(~methaneLevelCritical~0)| 0)) (= ~methaneLevelCritical~0 0) (not .cse0)) (let ((.cse4 (<= 2 ~waterLevel~0)) (.cse2 (= 1 ~systemActive~0)) (.cse1 (= ~pumpRunning~0 0)) (.cse5 (= 0 ~systemActive~0)) (.cse3 (= ~waterLevel~0 1))) (or (and .cse1 .cse0 .cse2 .cse3) (and .cse1 .cse0 .cse4 .cse5) (and (<= 1 ~pumpRunning~0) .cse4 .cse2) (and .cse1 .cse0 .cse4 .cse2) (and .cse1 .cse0 .cse5 .cse3))))) Eliminated clause: (let ((.cse4 (<= 2 ~waterLevel~0)) (.cse2 (= 1 ~systemActive~0)) (.cse0 (= ~pumpRunning~0 0)) (.cse1 (= ~methAndRunningLastTime~0 0)) (.cse5 (= 0 ~systemActive~0)) (.cse3 (= ~waterLevel~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse4 .cse5) (and (<= 1 ~pumpRunning~0) .cse4 .cse2) (and .cse0 .cse1 .cse4 .cse2) (and .cse0 .cse1 .cse5 .cse3))) [2024-11-09 23:16:34,633 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: Variable |isMethaneLevelCritical_#res| not permitted in ensures for changeMethaneLevel: (let ((.cse0 (= ~methAndRunningLastTime~0 0))) (and (or (not (= |old(~methaneLevelCritical~0)| 0)) (not (= ~methaneLevelCritical~0 0)) (= |isMethaneLevelCritical_#res| 0) (not .cse0)) (let ((.cse4 (<= 2 ~waterLevel~0)) (.cse2 (= 1 ~systemActive~0)) (.cse1 (= ~pumpRunning~0 0)) (.cse5 (= 0 ~systemActive~0)) (.cse3 (= ~waterLevel~0 1))) (or (and .cse1 .cse0 .cse2 .cse3) (and .cse1 .cse0 .cse4 .cse5) (and (<= 1 ~pumpRunning~0) .cse4 .cse2) (and .cse1 .cse0 .cse4 .cse2) (and .cse1 .cse0 .cse5 .cse3))))) at de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.FloydHoareUtils.checkPermissibleVariables(FloydHoareUtils.java:204) at de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.FloydHoareUtils.createProcedureContractResults(FloydHoareUtils.java:169) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-09 23:16:34,639 INFO L158 Benchmark]: Toolchain (without parser) took 11563.93ms. Allocated memory was 167.8MB in the beginning and 323.0MB in the end (delta: 155.2MB). Free memory was 112.6MB in the beginning and 220.4MB in the end (delta: -107.8MB). Peak memory consumption was 168.4MB. Max. memory is 16.1GB. [2024-11-09 23:16:34,639 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 167.8MB. Free memory is still 131.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 23:16:34,640 INFO L158 Benchmark]: CACSL2BoogieTranslator took 509.08ms. Allocated memory is still 167.8MB. Free memory was 112.6MB in the beginning and 90.5MB in the end (delta: 22.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-09 23:16:34,640 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.74ms. Allocated memory is still 167.8MB. Free memory was 90.5MB in the beginning and 88.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 23:16:34,640 INFO L158 Benchmark]: Boogie Preprocessor took 47.65ms. Allocated memory is still 167.8MB. Free memory was 88.4MB in the beginning and 86.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 23:16:34,640 INFO L158 Benchmark]: IcfgBuilder took 500.44ms. Allocated memory is still 167.8MB. Free memory was 85.8MB in the beginning and 134.9MB in the end (delta: -49.1MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. [2024-11-09 23:16:34,640 INFO L158 Benchmark]: TraceAbstraction took 10445.22ms. Allocated memory was 167.8MB in the beginning and 323.0MB in the end (delta: 155.2MB). Free memory was 134.0MB in the beginning and 220.4MB in the end (delta: -86.4MB). Peak memory consumption was 188.2MB. Max. memory is 16.1GB. [2024-11-09 23:16:34,642 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.10ms. Allocated memory is still 167.8MB. Free memory is still 131.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 509.08ms. Allocated memory is still 167.8MB. Free memory was 112.6MB in the beginning and 90.5MB in the end (delta: 22.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.74ms. Allocated memory is still 167.8MB. Free memory was 90.5MB in the beginning and 88.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.65ms. Allocated memory is still 167.8MB. Free memory was 88.4MB in the beginning and 86.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 500.44ms. Allocated memory is still 167.8MB. Free memory was 85.8MB in the beginning and 134.9MB in the end (delta: -49.1MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. * TraceAbstraction took 10445.22ms. Allocated memory was 167.8MB in the beginning and 323.0MB in the end (delta: 155.2MB). Free memory was 134.0MB in the beginning and 220.4MB in the end (delta: -86.4MB). Peak memory consumption was 188.2MB. 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,"scenario.i","") [49] - GenericResultAtLocation [Line: 124]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [124] - GenericResultAtLocation [Line: 354]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [354] - GenericResultAtLocation [Line: 455]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [455] - GenericResultAtLocation [Line: 495]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [495] - GenericResultAtLocation [Line: 530]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [530] - GenericResultAtLocation [Line: 634]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [634] - GenericResultAtLocation [Line: 1000]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1000] * 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 - PositiveResult [Line: 1005]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.7s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1423 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1391 mSDsluCounter, 4132 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2707 mSDsCounter, 317 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 907 IncrementalHoareTripleChecker+Invalid, 1224 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 317 mSolverCounterUnsat, 1425 mSDtfsCounter, 907 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 654 GetRequests, 563 SyntacticMatches, 3 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1223occurred in iteration=12, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 405 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1137 NumberOfCodeBlocks, 1137 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1211 ConstructedInterpolants, 0 QuantifiedInterpolants, 2257 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1287 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 18 InterpolantComputations, 13 PerfectInterpolantSequences, 268/290 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 66]: Location Invariant Derived location invariant: null - InvariantResult [Line: 366]: Location Invariant Derived location invariant: null - ProcedureContractResult [Line: 229]: Procedure Contract for deactivatePump Derived contract for procedure deactivatePump. Requires: ((((1 <= pumpRunning) && (2 <= waterLevel)) && (0 != systemActive)) || (((1 <= pumpRunning) && (1 == systemActive)) && (1 <= waterLevel))) Ensures: (((pumpRunning == 0) && ((((2 <= waterLevel) && (1 <= \old(pumpRunning))) && (0 != systemActive)) || (((1 == systemActive) && (1 <= waterLevel)) && (1 <= \old(pumpRunning))))) && ((((((systemActive == \old(systemActive)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (methAndRunningLastTime == \old(methAndRunningLastTime))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (head == \old(head)))) - ProcedureContractResult [Line: 162]: Procedure Contract for processEnvironment__wrappee__base Derived contract for procedure processEnvironment__wrappee__base. Requires: (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 == systemActive)) && (waterLevel == 1)) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (2 <= waterLevel)) && (1 == systemActive))) Ensures: ((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 == systemActive)) && (waterLevel == 1)) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (2 <= waterLevel)) && (1 == systemActive))) && (((((((pumpRunning == \old(pumpRunning)) && (systemActive == \old(systemActive))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (methAndRunningLastTime == \old(methAndRunningLastTime))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (head == \old(head)))) - ExceptionOrErrorResult: IllegalStateException: Variable |isMethaneLevelCritical_#res| not permitted in ensures for changeMethaneLevel: (let ((.cse0 (= ~methAndRunningLastTime~0 0))) (and (or (not (= |old(~methaneLevelCritical~0)| 0)) (not (= ~methaneLevelCritical~0 0)) (= |isMethaneLevelCritical_#res| 0) (not .cse0)) (let ((.cse4 (<= 2 ~waterLevel~0)) (.cse2 (= 1 ~systemActive~0)) (.cse1 (= ~pumpRunning~0 0)) (.cse5 (= 0 ~systemActive~0)) (.cse3 (= ~waterLevel~0 1))) (or (and .cse1 .cse0 .cse2 .cse3) (and .cse1 .cse0 .cse4 .cse5) (and (<= 1 ~pumpRunning~0) .cse4 .cse2) (and .cse1 .cse0 .cse4 .cse2) (and .cse1 .cse0 .cse5 .cse3))))) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: Variable |isMethaneLevelCritical_#res| not permitted in ensures for changeMethaneLevel: (let ((.cse0 (= ~methAndRunningLastTime~0 0))) (and (or (not (= |old(~methaneLevelCritical~0)| 0)) (not (= ~methaneLevelCritical~0 0)) (= |isMethaneLevelCritical_#res| 0) (not .cse0)) (let ((.cse4 (<= 2 ~waterLevel~0)) (.cse2 (= 1 ~systemActive~0)) (.cse1 (= ~pumpRunning~0 0)) (.cse5 (= 0 ~systemActive~0)) (.cse3 (= ~waterLevel~0 1))) (or (and .cse1 .cse0 .cse2 .cse3) (and .cse1 .cse0 .cse4 .cse5) (and (<= 1 ~pumpRunning~0) .cse4 .cse2) (and .cse1 .cse0 .cse4 .cse2) (and .cse1 .cse0 .cse5 .cse3))))): de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.FloydHoareUtils.checkPermissibleVariables(FloydHoareUtils.java:204) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-11-09 23:16:34,673 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_spec2_product52.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 4583285deb29d8014ded34089a46614a743cea13eee9bbb990cdfd770bfce36e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 23:16:36,942 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 23:16:37,033 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 23:16:37,038 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 23:16:37,039 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 23:16:37,065 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 23:16:37,066 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 23:16:37,066 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 23:16:37,068 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 23:16:37,069 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 23:16:37,070 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 23:16:37,071 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 23:16:37,071 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 23:16:37,071 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 23:16:37,072 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 23:16:37,075 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 23:16:37,075 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 23:16:37,075 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 23:16:37,076 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 23:16:37,076 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 23:16:37,076 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 23:16:37,077 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 23:16:37,077 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 23:16:37,077 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 23:16:37,079 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 23:16:37,080 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 23:16:37,080 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 23:16:37,080 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 23:16:37,081 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 23:16:37,081 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 23:16:37,081 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 23:16:37,081 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 23:16:37,081 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 23:16:37,082 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 23:16:37,082 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:16:37,082 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 23:16:37,083 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 23:16:37,083 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 23:16:37,084 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 23:16:37,084 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 23:16:37,084 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 23:16:37,085 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 23:16:37,085 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 23:16:37,085 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 23:16:37,085 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 -> 4583285deb29d8014ded34089a46614a743cea13eee9bbb990cdfd770bfce36e [2024-11-09 23:16:37,408 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 23:16:37,427 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 23:16:37,431 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 23:16:37,433 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 23:16:37,433 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 23:16:37,434 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec2_product52.cil.c [2024-11-09 23:16:38,931 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 23:16:39,173 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 23:16:39,176 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product52.cil.c [2024-11-09 23:16:39,194 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01307ff2a/7d895b1c811245ce84944f773de6eef8/FLAGfbcfcbdf5 [2024-11-09 23:16:39,506 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01307ff2a/7d895b1c811245ce84944f773de6eef8 [2024-11-09 23:16:39,511 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 23:16:39,512 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 23:16:39,513 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 23:16:39,514 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 23:16:39,519 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 23:16:39,521 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:16:39" (1/1) ... [2024-11-09 23:16:39,521 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fa16f13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:39, skipping insertion in model container [2024-11-09 23:16:39,522 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:16:39" (1/1) ... [2024-11-09 23:16:39,562 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 23:16:39,844 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 23:16:39,847 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 23:16:39,856 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 23:16:39,862 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 23:16:39,867 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 23:16:39,885 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 23:16:39,887 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 23:16:39,892 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 23:16:39,894 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 23:16:39,912 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_spec2_product52.cil.c[19177,19190] [2024-11-09 23:16:39,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:16:39,934 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 23:16:39,943 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [49] [2024-11-09 23:16:39,944 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [124] [2024-11-09 23:16:39,944 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [354] [2024-11-09 23:16:39,945 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [455] [2024-11-09 23:16:39,945 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [495] [2024-11-09 23:16:39,945 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [530] [2024-11-09 23:16:39,945 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [634] [2024-11-09 23:16:39,945 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1000] [2024-11-09 23:16:40,017 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_spec2_product52.cil.c[19177,19190] [2024-11-09 23:16:40,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:16:40,045 INFO L204 MainTranslator]: Completed translation [2024-11-09 23:16:40,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:40 WrapperNode [2024-11-09 23:16:40,046 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 23:16:40,047 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 23:16:40,047 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 23:16:40,047 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 23:16:40,053 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:16:40" (1/1) ... [2024-11-09 23:16:40,074 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:16:40" (1/1) ... [2024-11-09 23:16:40,116 INFO L138 Inliner]: procedures = 60, calls = 102, calls flagged for inlining = 24, calls inlined = 21, statements flattened = 200 [2024-11-09 23:16:40,118 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 23:16:40,118 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 23:16:40,119 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 23:16:40,120 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 23:16:40,129 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:40" (1/1) ... [2024-11-09 23:16:40,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:40" (1/1) ... [2024-11-09 23:16:40,134 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:40" (1/1) ... [2024-11-09 23:16:40,160 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:16:40,160 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:40" (1/1) ... [2024-11-09 23:16:40,160 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:40" (1/1) ... [2024-11-09 23:16:40,168 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:40" (1/1) ... [2024-11-09 23:16:40,172 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:40" (1/1) ... [2024-11-09 23:16:40,173 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:40" (1/1) ... [2024-11-09 23:16:40,174 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:40" (1/1) ... [2024-11-09 23:16:40,179 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 23:16:40,180 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 23:16:40,180 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 23:16:40,180 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 23:16:40,181 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:40" (1/1) ... [2024-11-09 23:16:40,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:16:40,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:16:40,212 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:16:40,216 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:16:40,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 23:16:40,261 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2024-11-09 23:16:40,261 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2024-11-09 23:16:40,261 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2024-11-09 23:16:40,261 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2024-11-09 23:16:40,261 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-09 23:16:40,262 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-09 23:16:40,262 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-09 23:16:40,262 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-09 23:16:40,262 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2024-11-09 23:16:40,262 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2024-11-09 23:16:40,262 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2024-11-09 23:16:40,262 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2024-11-09 23:16:40,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 23:16:40,263 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2024-11-09 23:16:40,263 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2024-11-09 23:16:40,263 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2024-11-09 23:16:40,263 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2024-11-09 23:16:40,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 23:16:40,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 23:16:40,360 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 23:16:40,363 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 23:16:40,425 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L576: #res := ~retValue_acc~7; [2024-11-09 23:16:40,547 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L254-1: isPumpRunning_#res#1 := isPumpRunning_~retValue_acc~1#1; [2024-11-09 23:16:40,547 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L631-1: isLowWaterSensorDry_#res#1 := isLowWaterSensorDry_~retValue_acc~10#1; [2024-11-09 23:16:40,547 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L328-1: isLowWaterLevel_#res#1 := isLowWaterLevel_~retValue_acc~3#1; [2024-11-09 23:16:40,663 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L527-1: valid_product_#res#1 := valid_product_~retValue_acc~6#1; [2024-11-09 23:16:40,663 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L452-1: main_#res#1 := main_~retValue_acc~4#1; [2024-11-09 23:16:40,702 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L309-1: isHighWaterLevel_#res#1 := isHighWaterLevel_~retValue_acc~2#1; [2024-11-09 23:16:40,702 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L622-1: isHighWaterSensorDry_#res#1 := isHighWaterSensorDry_~retValue_acc~9#1; [2024-11-09 23:16:40,734 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-11-09 23:16:40,735 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 23:16:40,751 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 23:16:40,751 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 23:16:40,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:16:40 BoogieIcfgContainer [2024-11-09 23:16:40,752 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 23:16:40,756 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 23:16:40,756 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 23:16:40,760 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 23:16:40,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:16:39" (1/3) ... [2024-11-09 23:16:40,761 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dc867e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:16:40, skipping insertion in model container [2024-11-09 23:16:40,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:16:40" (2/3) ... [2024-11-09 23:16:40,762 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dc867e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:16:40, skipping insertion in model container [2024-11-09 23:16:40,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:16:40" (3/3) ... [2024-11-09 23:16:40,765 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product52.cil.c [2024-11-09 23:16:40,780 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 23:16:40,780 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 23:16:40,845 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 23:16:40,852 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;@18823b4f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 23:16:40,852 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 23:16:40,859 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 77 states have (on average 1.3636363636363635) internal successors, (105), 86 states have internal predecessors, (105), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 23:16:40,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 23:16:40,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:16:40,873 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:16:40,874 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:16:40,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:16:40,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1788723857, now seen corresponding path program 1 times [2024-11-09 23:16:40,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 23:16:40,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [179831587] [2024-11-09 23:16:40,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:16:40,895 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 23:16:40,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 23:16:40,898 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 23:16:40,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 23:16:40,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:40,990 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 23:16:40,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:16:41,019 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:16:41,020 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 23:16:41,021 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 23:16:41,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [179831587] [2024-11-09 23:16:41,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [179831587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:16:41,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:16:41,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 23:16:41,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466818338] [2024-11-09 23:16:41,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:16:41,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 23:16:41,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 23:16:41,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 23:16:41,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 23:16:41,054 INFO L87 Difference]: Start difference. First operand has 100 states, 77 states have (on average 1.3636363636363635) internal successors, (105), 86 states have internal predecessors, (105), 13 states have call successors, (13), 8 states have call predecessors, (13), 8 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (3), 1 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:16:41,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:16:41,103 INFO L93 Difference]: Finished difference Result 190 states and 255 transitions. [2024-11-09 23:16:41,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 23:16:41,105 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (3), 1 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:16:41,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:16:41,115 INFO L225 Difference]: With dead ends: 190 [2024-11-09 23:16:41,116 INFO L226 Difference]: Without dead ends: 89 [2024-11-09 23:16:41,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 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:16:41,124 INFO L432 NwaCegarLoop]: 124 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, 124 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:16:41,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:16:41,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-09 23:16:41,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-09 23:16:41,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 76 states have internal predecessors, (89), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 23:16:41,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 114 transitions. [2024-11-09 23:16:41,176 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 114 transitions. Word has length 27 [2024-11-09 23:16:41,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:16:41,177 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 114 transitions. [2024-11-09 23:16:41,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (3), 1 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:16:41,178 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 114 transitions. [2024-11-09 23:16:41,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 23:16:41,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:16:41,181 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:16:41,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 23:16:41,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 23:16:41,384 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:16:41,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:16:41,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1670385685, now seen corresponding path program 1 times [2024-11-09 23:16:41,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 23:16:41,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [647318355] [2024-11-09 23:16:41,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:16:41,386 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 23:16:41,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 23:16:41,388 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 23:16:41,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 23:16:41,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:41,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 23:16:41,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:16:41,501 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:16:41,501 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 23:16:41,501 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 23:16:41,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [647318355] [2024-11-09 23:16:41,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [647318355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:16:41,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:16:41,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:16:41,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46309516] [2024-11-09 23:16:41,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:16:41,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:16:41,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 23:16:41,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:16:41,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:16:41,505 INFO L87 Difference]: Start difference. First operand 89 states and 114 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (3), 1 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:16:41,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:16:41,523 INFO L93 Difference]: Finished difference Result 137 states and 175 transitions. [2024-11-09 23:16:41,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:16:41,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (3), 1 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 29 [2024-11-09 23:16:41,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:16:41,525 INFO L225 Difference]: With dead ends: 137 [2024-11-09 23:16:41,525 INFO L226 Difference]: Without dead ends: 79 [2024-11-09 23:16:41,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 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:16:41,527 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 16 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 178 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:16:41,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 178 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:16:41,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-09 23:16:41,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-09 23:16:41,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 69 states have internal predecessors, (81), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 23:16:41,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 101 transitions. [2024-11-09 23:16:41,537 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 101 transitions. Word has length 29 [2024-11-09 23:16:41,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:16:41,537 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 101 transitions. [2024-11-09 23:16:41,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (3), 1 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:16:41,538 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 101 transitions. [2024-11-09 23:16:41,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 23:16:41,539 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:16:41,539 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] [2024-11-09 23:16:41,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 23:16:41,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 23:16:41,743 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:16:41,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:16:41,744 INFO L85 PathProgramCache]: Analyzing trace with hash 457795697, now seen corresponding path program 1 times [2024-11-09 23:16:41,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 23:16:41,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1595851459] [2024-11-09 23:16:41,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:16:41,745 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 23:16:41,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 23:16:41,748 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 23:16:41,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 23:16:41,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:41,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 23:16:41,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:16:41,855 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:16:41,855 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 23:16:41,855 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 23:16:41,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1595851459] [2024-11-09 23:16:41,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1595851459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:16:41,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:16:41,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 23:16:41,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901084209] [2024-11-09 23:16:41,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:16:41,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:16:41,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 23:16:41,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:16:41,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:16:41,861 INFO L87 Difference]: Start difference. First operand 79 states and 101 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 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:16:41,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:16:41,905 INFO L93 Difference]: Finished difference Result 219 states and 286 transitions. [2024-11-09 23:16:41,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:16:41,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 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 32 [2024-11-09 23:16:41,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:16:41,907 INFO L225 Difference]: With dead ends: 219 [2024-11-09 23:16:41,908 INFO L226 Difference]: Without dead ends: 148 [2024-11-09 23:16:41,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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:16:41,909 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 78 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:16:41,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 207 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:16:41,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-09 23:16:41,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2024-11-09 23:16:41,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 109 states have (on average 1.3577981651376148) internal successors, (148), 124 states have internal predecessors, (148), 20 states have call successors, (20), 14 states have call predecessors, (20), 14 states have return successors, (20), 13 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 23:16:41,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 188 transitions. [2024-11-09 23:16:41,942 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 188 transitions. Word has length 32 [2024-11-09 23:16:41,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:16:41,942 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 188 transitions. [2024-11-09 23:16:41,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 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:16:41,943 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 188 transitions. [2024-11-09 23:16:41,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 23:16:41,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:16:41,948 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:16:41,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-09 23:16:42,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 23:16:42,149 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:16:42,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:16:42,150 INFO L85 PathProgramCache]: Analyzing trace with hash -904561423, now seen corresponding path program 1 times [2024-11-09 23:16:42,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 23:16:42,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1199952483] [2024-11-09 23:16:42,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:16:42,151 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 23:16:42,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 23:16:42,154 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 23:16:42,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 23:16:42,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:42,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 23:16:42,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:16:42,304 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:16:42,304 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 23:16:42,304 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 23:16:42,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1199952483] [2024-11-09 23:16:42,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1199952483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:16:42,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:16:42,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:16:42,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205349085] [2024-11-09 23:16:42,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:16:42,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:16:42,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 23:16:42,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:16:42,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:16:42,308 INFO L87 Difference]: Start difference. First operand 144 states and 188 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 23:16:42,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:16:42,480 INFO L93 Difference]: Finished difference Result 407 states and 542 transitions. [2024-11-09 23:16:42,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 23:16:42,481 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2024-11-09 23:16:42,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:16:42,483 INFO L225 Difference]: With dead ends: 407 [2024-11-09 23:16:42,483 INFO L226 Difference]: Without dead ends: 271 [2024-11-09 23:16:42,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:16:42,485 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 63 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:16:42,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 459 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:16:42,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-11-09 23:16:42,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2024-11-09 23:16:42,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 202 states have (on average 1.3465346534653466) internal successors, (272), 231 states have internal predecessors, (272), 40 states have call successors, (40), 28 states have call predecessors, (40), 28 states have return successors, (42), 26 states have call predecessors, (42), 40 states have call successors, (42) [2024-11-09 23:16:42,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 354 transitions. [2024-11-09 23:16:42,519 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 354 transitions. Word has length 35 [2024-11-09 23:16:42,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:16:42,520 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 354 transitions. [2024-11-09 23:16:42,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 23:16:42,520 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 354 transitions. [2024-11-09 23:16:42,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 23:16:42,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:16:42,523 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:16:42,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-09 23:16:42,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 23:16:42,724 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:16:42,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:16:42,725 INFO L85 PathProgramCache]: Analyzing trace with hash 248106034, now seen corresponding path program 1 times [2024-11-09 23:16:42,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 23:16:42,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [78330474] [2024-11-09 23:16:42,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:16:42,725 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 23:16:42,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 23:16:42,728 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 23:16:42,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 23:16:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:42,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 23:16:42,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:16:42,870 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:16:42,871 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 23:16:42,871 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 23:16:42,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [78330474] [2024-11-09 23:16:42,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [78330474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:16:42,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:16:42,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 23:16:42,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205981796] [2024-11-09 23:16:42,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:16:42,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:16:42,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 23:16:42,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:16:42,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:16:42,873 INFO L87 Difference]: Start difference. First operand 271 states and 354 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 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:16:42,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:16:42,966 INFO L93 Difference]: Finished difference Result 696 states and 928 transitions. [2024-11-09 23:16:42,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:16:42,966 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 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 39 [2024-11-09 23:16:42,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:16:42,973 INFO L225 Difference]: With dead ends: 696 [2024-11-09 23:16:42,974 INFO L226 Difference]: Without dead ends: 433 [2024-11-09 23:16:42,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 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:16:42,978 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 42 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:16:42,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 357 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:16:42,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2024-11-09 23:16:43,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 431. [2024-11-09 23:16:43,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 322 states have (on average 1.2981366459627328) internal successors, (418), 351 states have internal predecessors, (418), 56 states have call successors, (56), 52 states have call predecessors, (56), 52 states have return successors, (76), 50 states have call predecessors, (76), 56 states have call successors, (76) [2024-11-09 23:16:43,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 550 transitions. [2024-11-09 23:16:43,053 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 550 transitions. Word has length 39 [2024-11-09 23:16:43,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:16:43,054 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 550 transitions. [2024-11-09 23:16:43,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 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:16:43,054 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 550 transitions. [2024-11-09 23:16:43,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 23:16:43,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:16:43,056 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:16:43,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-09 23:16:43,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 23:16:43,261 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:16:43,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:16:43,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1698552057, now seen corresponding path program 1 times [2024-11-09 23:16:43,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 23:16:43,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [205921899] [2024-11-09 23:16:43,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:16:43,262 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 23:16:43,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 23:16:43,264 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 23:16:43,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-09 23:16:43,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:43,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 23:16:43,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:16:43,349 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:16:43,349 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 23:16:43,350 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 23:16:43,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [205921899] [2024-11-09 23:16:43,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [205921899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:16:43,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:16:43,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:16:43,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924240105] [2024-11-09 23:16:43,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:16:43,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:16:43,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 23:16:43,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:16:43,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:16:43,352 INFO L87 Difference]: Start difference. First operand 431 states and 550 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 23:16:43,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:16:43,417 INFO L93 Difference]: Finished difference Result 866 states and 1124 transitions. [2024-11-09 23:16:43,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:16:43,418 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2024-11-09 23:16:43,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:16:43,423 INFO L225 Difference]: With dead ends: 866 [2024-11-09 23:16:43,424 INFO L226 Difference]: Without dead ends: 443 [2024-11-09 23:16:43,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 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:16:43,426 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:16:43,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 386 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:16:43,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-11-09 23:16:43,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2024-11-09 23:16:43,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 334 states have (on average 1.2874251497005988) internal successors, (430), 363 states have internal predecessors, (430), 56 states have call successors, (56), 52 states have call predecessors, (56), 52 states have return successors, (76), 50 states have call predecessors, (76), 56 states have call successors, (76) [2024-11-09 23:16:43,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 562 transitions. [2024-11-09 23:16:43,483 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 562 transitions. Word has length 50 [2024-11-09 23:16:43,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:16:43,485 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 562 transitions. [2024-11-09 23:16:43,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 23:16:43,485 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 562 transitions. [2024-11-09 23:16:43,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 23:16:43,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:16:43,487 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:16:43,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-09 23:16:43,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 23:16:43,688 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:16:43,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:16:43,688 INFO L85 PathProgramCache]: Analyzing trace with hash -2107376282, now seen corresponding path program 1 times [2024-11-09 23:16:43,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 23:16:43,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [786747957] [2024-11-09 23:16:43,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:16:43,689 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 23:16:43,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 23:16:43,692 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 23:16:43,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-09 23:16:43,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:43,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 23:16:43,745 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:16:43,765 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:16:43,765 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 23:16:43,765 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 23:16:43,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [786747957] [2024-11-09 23:16:43,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [786747957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:16:43,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:16:43,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 23:16:43,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822541641] [2024-11-09 23:16:43,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:16:43,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 23:16:43,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 23:16:43,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 23:16:43,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 23:16:43,767 INFO L87 Difference]: Start difference. First operand 443 states and 562 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 23:16:43,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:16:43,814 INFO L93 Difference]: Finished difference Result 886 states and 1160 transitions. [2024-11-09 23:16:43,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 23:16:43,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2024-11-09 23:16:43,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:16:43,818 INFO L225 Difference]: With dead ends: 886 [2024-11-09 23:16:43,818 INFO L226 Difference]: Without dead ends: 451 [2024-11-09 23:16:43,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 47 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:16:43,820 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 291 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:16:43,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 291 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:16:43,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2024-11-09 23:16:43,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 451. [2024-11-09 23:16:43,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 342 states have (on average 1.280701754385965) internal successors, (438), 371 states have internal predecessors, (438), 56 states have call successors, (56), 52 states have call predecessors, (56), 52 states have return successors, (76), 50 states have call predecessors, (76), 56 states have call successors, (76) [2024-11-09 23:16:43,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 570 transitions. [2024-11-09 23:16:43,853 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 570 transitions. Word has length 50 [2024-11-09 23:16:43,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:16:43,853 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 570 transitions. [2024-11-09 23:16:43,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 23:16:43,854 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 570 transitions. [2024-11-09 23:16:43,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 23:16:43,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:16:43,856 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:16:43,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-09 23:16:44,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 23:16:44,057 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:16:44,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:16:44,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1888521564, now seen corresponding path program 1 times [2024-11-09 23:16:44,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 23:16:44,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [231888858] [2024-11-09 23:16:44,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:16:44,059 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 23:16:44,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 23:16:44,062 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 23:16:44,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-09 23:16:44,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:44,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 23:16:44,117 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:16:44,172 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:16:44,172 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 23:16:44,172 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 23:16:44,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [231888858] [2024-11-09 23:16:44,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [231888858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:16:44,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:16:44,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 23:16:44,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809484010] [2024-11-09 23:16:44,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:16:44,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:16:44,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 23:16:44,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:16:44,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:16:44,176 INFO L87 Difference]: Start difference. First operand 451 states and 570 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 23:16:44,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:16:44,259 INFO L93 Difference]: Finished difference Result 1082 states and 1376 transitions. [2024-11-09 23:16:44,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:16:44,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2024-11-09 23:16:44,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:16:44,264 INFO L225 Difference]: With dead ends: 1082 [2024-11-09 23:16:44,264 INFO L226 Difference]: Without dead ends: 639 [2024-11-09 23:16:44,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 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:16:44,266 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 36 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:16:44,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 185 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:16:44,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2024-11-09 23:16:44,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2024-11-09 23:16:44,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 486 states have (on average 1.242798353909465) internal successors, (604), 519 states have internal predecessors, (604), 80 states have call successors, (80), 76 states have call predecessors, (80), 72 states have return successors, (102), 70 states have call predecessors, (102), 80 states have call successors, (102) [2024-11-09 23:16:44,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 786 transitions. [2024-11-09 23:16:44,319 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 786 transitions. Word has length 50 [2024-11-09 23:16:44,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:16:44,320 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 786 transitions. [2024-11-09 23:16:44,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 23:16:44,320 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 786 transitions. [2024-11-09 23:16:44,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 23:16:44,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:16:44,322 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:16:44,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-09 23:16:44,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 23:16:44,523 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:16:44,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:16:44,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1706426558, now seen corresponding path program 1 times [2024-11-09 23:16:44,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 23:16:44,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1479744793] [2024-11-09 23:16:44,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:16:44,525 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 23:16:44,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 23:16:44,528 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 23:16:44,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-09 23:16:44,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:44,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 23:16:44,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:16:44,668 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:16:44,669 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 23:16:44,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 23:16:44,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1479744793] [2024-11-09 23:16:44,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1479744793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:16:44,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:16:44,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:16:44,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862983782] [2024-11-09 23:16:44,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:16:44,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:16:44,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 23:16:44,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:16:44,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:16:44,673 INFO L87 Difference]: Start difference. First operand 639 states and 786 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 23:16:44,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:16:44,755 INFO L93 Difference]: Finished difference Result 964 states and 1207 transitions. [2024-11-09 23:16:44,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:16:44,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 54 [2024-11-09 23:16:44,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:16:44,760 INFO L225 Difference]: With dead ends: 964 [2024-11-09 23:16:44,760 INFO L226 Difference]: Without dead ends: 961 [2024-11-09 23:16:44,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 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:16:44,762 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 50 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:16:44,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 189 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:16:44,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2024-11-09 23:16:44,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 804. [2024-11-09 23:16:44,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 610 states have (on average 1.2557377049180327) internal successors, (766), 657 states have internal predecessors, (766), 101 states have call successors, (101), 95 states have call predecessors, (101), 92 states have return successors, (139), 85 states have call predecessors, (139), 101 states have call successors, (139) [2024-11-09 23:16:44,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1006 transitions. [2024-11-09 23:16:44,823 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1006 transitions. Word has length 54 [2024-11-09 23:16:44,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:16:44,824 INFO L471 AbstractCegarLoop]: Abstraction has 804 states and 1006 transitions. [2024-11-09 23:16:44,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 23:16:44,824 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1006 transitions. [2024-11-09 23:16:44,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-09 23:16:44,827 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:16:44,828 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:16:44,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-09 23:16:45,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 23:16:45,031 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:16:45,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:16:45,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1160854736, now seen corresponding path program 1 times [2024-11-09 23:16:45,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 23:16:45,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2126734331] [2024-11-09 23:16:45,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:16:45,033 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 23:16:45,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 23:16:45,036 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 23:16:45,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-09 23:16:45,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:45,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 23:16:45,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:16:45,201 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:16:45,201 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 23:16:45,202 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 23:16:45,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2126734331] [2024-11-09 23:16:45,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2126734331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:16:45,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:16:45,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:16:45,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132102299] [2024-11-09 23:16:45,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:16:45,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:16:45,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 23:16:45,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:16:45,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:16:45,204 INFO L87 Difference]: Start difference. First operand 804 states and 1006 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 23:16:45,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:16:45,308 INFO L93 Difference]: Finished difference Result 1729 states and 2184 transitions. [2024-11-09 23:16:45,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:16:45,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 84 [2024-11-09 23:16:45,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:16:45,317 INFO L225 Difference]: With dead ends: 1729 [2024-11-09 23:16:45,317 INFO L226 Difference]: Without dead ends: 933 [2024-11-09 23:16:45,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 82 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:16:45,321 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 55 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:16:45,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 154 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:16:45,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2024-11-09 23:16:45,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 925. [2024-11-09 23:16:45,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 701 states have (on average 1.2496433666191156) internal successors, (876), 754 states have internal predecessors, (876), 117 states have call successors, (117), 111 states have call predecessors, (117), 106 states have return successors, (165), 99 states have call predecessors, (165), 117 states have call successors, (165) [2024-11-09 23:16:45,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1158 transitions. [2024-11-09 23:16:45,432 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1158 transitions. Word has length 84 [2024-11-09 23:16:45,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:16:45,433 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1158 transitions. [2024-11-09 23:16:45,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-09 23:16:45,433 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1158 transitions. [2024-11-09 23:16:45,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-09 23:16:45,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:16:45,437 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:16:45,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-09 23:16:45,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 23:16:45,641 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:16:45,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:16:45,641 INFO L85 PathProgramCache]: Analyzing trace with hash -245444761, now seen corresponding path program 1 times [2024-11-09 23:16:45,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 23:16:45,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1700889373] [2024-11-09 23:16:45,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:16:45,642 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 23:16:45,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 23:16:45,643 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 23:16:45,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-09 23:16:45,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:45,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 23:16:45,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:16:45,771 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:16:45,775 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 23:16:45,775 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 23:16:45,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1700889373] [2024-11-09 23:16:45,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1700889373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:16:45,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:16:45,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:16:45,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008306749] [2024-11-09 23:16:45,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:16:45,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:16:45,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 23:16:45,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:16:45,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:16:45,777 INFO L87 Difference]: Start difference. First operand 925 states and 1158 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-09 23:16:45,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:16:45,879 INFO L93 Difference]: Finished difference Result 1573 states and 2014 transitions. [2024-11-09 23:16:45,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:16:45,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 93 [2024-11-09 23:16:45,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:16:45,885 INFO L225 Difference]: With dead ends: 1573 [2024-11-09 23:16:45,886 INFO L226 Difference]: Without dead ends: 902 [2024-11-09 23:16:45,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 91 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:16:45,889 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 43 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:16:45,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 209 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:16:45,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2024-11-09 23:16:45,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 902. [2024-11-09 23:16:45,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 682 states have (on average 1.217008797653959) internal successors, (830), 732 states have internal predecessors, (830), 115 states have call successors, (115), 109 states have call predecessors, (115), 104 states have return successors, (156), 98 states have call predecessors, (156), 115 states have call successors, (156) [2024-11-09 23:16:45,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1101 transitions. [2024-11-09 23:16:45,975 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1101 transitions. Word has length 93 [2024-11-09 23:16:45,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:16:45,975 INFO L471 AbstractCegarLoop]: Abstraction has 902 states and 1101 transitions. [2024-11-09 23:16:45,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-09 23:16:45,975 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1101 transitions. [2024-11-09 23:16:45,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 23:16:45,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:16:45,979 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:16:45,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-09 23:16:46,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 23:16:46,180 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:16:46,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:16:46,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1144116756, now seen corresponding path program 1 times [2024-11-09 23:16:46,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 23:16:46,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [342925727] [2024-11-09 23:16:46,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:16:46,181 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 23:16:46,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 23:16:46,182 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 23:16:46,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-09 23:16:46,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:46,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 23:16:46,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:16:46,396 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 23:16:46,396 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:16:46,691 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 23:16:46,691 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 23:16:46,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [342925727] [2024-11-09 23:16:46,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [342925727] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:16:46,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 23:16:46,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2024-11-09 23:16:46,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933896030] [2024-11-09 23:16:46,692 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 23:16:46,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 23:16:46,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 23:16:46,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 23:16:46,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:16:46,694 INFO L87 Difference]: Start difference. First operand 902 states and 1101 transitions. Second operand has 13 states, 13 states have (on average 9.23076923076923) internal successors, (120), 12 states have internal predecessors, (120), 8 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (16), 6 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-09 23:16:47,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:16:47,923 INFO L93 Difference]: Finished difference Result 4800 states and 6198 transitions. [2024-11-09 23:16:47,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 23:16:47,924 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.23076923076923) internal successors, (120), 12 states have internal predecessors, (120), 8 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (16), 6 states have call predecessors, (16), 8 states have call successors, (16) Word has length 96 [2024-11-09 23:16:47,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:16:47,949 INFO L225 Difference]: With dead ends: 4800 [2024-11-09 23:16:47,949 INFO L226 Difference]: Without dead ends: 4152 [2024-11-09 23:16:47,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=544, Unknown=0, NotChecked=0, Total=702 [2024-11-09 23:16:47,956 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 825 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 23:16:47,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [842 Valid, 787 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 23:16:47,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4152 states. [2024-11-09 23:16:48,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4152 to 4027. [2024-11-09 23:16:48,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4027 states, 3032 states have (on average 1.2025065963060686) internal successors, (3646), 3259 states have internal predecessors, (3646), 505 states have call successors, (505), 443 states have call predecessors, (505), 489 states have return successors, (833), 468 states have call predecessors, (833), 505 states have call successors, (833) [2024-11-09 23:16:48,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4027 states to 4027 states and 4984 transitions. [2024-11-09 23:16:48,355 INFO L78 Accepts]: Start accepts. Automaton has 4027 states and 4984 transitions. Word has length 96 [2024-11-09 23:16:48,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:16:48,355 INFO L471 AbstractCegarLoop]: Abstraction has 4027 states and 4984 transitions. [2024-11-09 23:16:48,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.23076923076923) internal successors, (120), 12 states have internal predecessors, (120), 8 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (16), 6 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-09 23:16:48,356 INFO L276 IsEmpty]: Start isEmpty. Operand 4027 states and 4984 transitions. [2024-11-09 23:16:48,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 23:16:48,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:16:48,359 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:16:48,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-09 23:16:48,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 23:16:48,560 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:16:48,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:16:48,560 INFO L85 PathProgramCache]: Analyzing trace with hash -933092587, now seen corresponding path program 1 times [2024-11-09 23:16:48,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 23:16:48,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1481608290] [2024-11-09 23:16:48,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:16:48,563 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 23:16:48,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 23:16:48,566 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 23:16:48,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-09 23:16:48,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:48,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 23:16:48,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:16:48,657 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 23:16:48,658 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 23:16:48,658 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 23:16:48,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1481608290] [2024-11-09 23:16:48,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1481608290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:16:48,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:16:48,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:16:48,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080572046] [2024-11-09 23:16:48,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:16:48,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:16:48,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 23:16:48,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:16:48,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:16:48,660 INFO L87 Difference]: Start difference. First operand 4027 states and 4984 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 23:16:48,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:16:48,820 INFO L93 Difference]: Finished difference Result 4905 states and 6014 transitions. [2024-11-09 23:16:48,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:16:48,821 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 96 [2024-11-09 23:16:48,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:16:48,831 INFO L225 Difference]: With dead ends: 4905 [2024-11-09 23:16:48,831 INFO L226 Difference]: Without dead ends: 1120 [2024-11-09 23:16:48,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 92 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:16:48,844 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:16:48,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 355 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:16:48,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2024-11-09 23:16:48,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 1097. [2024-11-09 23:16:48,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1097 states, 838 states have (on average 1.171837708830549) internal successors, (982), 890 states have internal predecessors, (982), 125 states have call successors, (125), 121 states have call predecessors, (125), 133 states have return successors, (161), 124 states have call predecessors, (161), 125 states have call successors, (161) [2024-11-09 23:16:48,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1268 transitions. [2024-11-09 23:16:48,973 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1268 transitions. Word has length 96 [2024-11-09 23:16:48,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:16:48,973 INFO L471 AbstractCegarLoop]: Abstraction has 1097 states and 1268 transitions. [2024-11-09 23:16:48,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 23:16:48,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1268 transitions. [2024-11-09 23:16:48,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-09 23:16:48,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:16:48,976 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:16:48,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-09 23:16:49,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 23:16:49,180 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:16:49,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:16:49,180 INFO L85 PathProgramCache]: Analyzing trace with hash 927702308, now seen corresponding path program 1 times [2024-11-09 23:16:49,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 23:16:49,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [559919615] [2024-11-09 23:16:49,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:16:49,181 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 23:16:49,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 23:16:49,183 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 23:16:49,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-09 23:16:49,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:16:49,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 23:16:49,253 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:16:49,266 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 23:16:49,266 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 23:16:49,266 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 23:16:49,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [559919615] [2024-11-09 23:16:49,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [559919615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:16:49,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:16:49,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:16:49,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421471276] [2024-11-09 23:16:49,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:16:49,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:16:49,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 23:16:49,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:16:49,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:16:49,268 INFO L87 Difference]: Start difference. First operand 1097 states and 1268 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 23:16:49,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:16:49,330 INFO L93 Difference]: Finished difference Result 1748 states and 2029 transitions. [2024-11-09 23:16:49,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:16:49,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 100 [2024-11-09 23:16:49,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:16:49,333 INFO L225 Difference]: With dead ends: 1748 [2024-11-09 23:16:49,333 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 23:16:49,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 98 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:16:49,337 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 37 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:16:49,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 198 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:16:49,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 23:16:49,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 23:16:49,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:16:49,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 23:16:49,341 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 100 [2024-11-09 23:16:49,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:16:49,341 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 23:16:49,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 23:16:49,342 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 23:16:49,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 23:16:49,344 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 23:16:49,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-09 23:16:49,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 23:16:49,547 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:16:49,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 23:16:53,497 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 23:16:53,513 WARN L156 FloydHoareUtils]: Requires clause for deactivatePump contained old-variable. Original clause: (and (let ((.cse0 (= (_ bv1 32) |old(~pumpRunning~0)|))) (or (and (= ~waterLevel~0 (_ bv1 32)) .cse0 (= (_ bv1 32) ~systemActive~0)) (and .cse0 (= ~waterLevel~0 (_ bv2 32)) (not (= (_ bv0 32) ~systemActive~0))))) (= (_ bv1 32) ~pumpRunning~0)) Eliminated clause: (and (or (and (= ~waterLevel~0 (_ bv1 32)) (= (_ bv1 32) ~systemActive~0)) (and (= ~waterLevel~0 (_ bv2 32)) (not (= (_ bv0 32) ~systemActive~0)))) (= (_ bv1 32) ~pumpRunning~0)) [2024-11-09 23:16:53,568 WARN L156 FloydHoareUtils]: Requires clause for changeMethaneLevel contained old-variable. Original clause: (let ((.cse0 (= ~methAndRunningLastTime~0 (_ bv0 32)))) (and (or (not .cse0) (not (= (_ bv0 32) |old(~methaneLevelCritical~0)|)) (= ~methaneLevelCritical~0 (_ bv0 32))) (let ((.cse1 (= ~waterLevel~0 (_ bv1 32))) (.cse4 (= (_ bv0 32) ~systemActive~0)) (.cse2 (= (_ bv0 32) ~pumpRunning~0)) (.cse5 (= ~waterLevel~0 (_ bv2 32))) (.cse3 (= (_ bv1 32) ~systemActive~0))) (or (and .cse1 .cse2 .cse0 .cse3) (and .cse1 .cse2 .cse4 .cse0) (and .cse2 .cse4 .cse5 .cse0) (and .cse5 (= (_ bv1 32) ~pumpRunning~0) .cse3) (and .cse2 .cse5 .cse0 .cse3))))) Eliminated clause: (let ((.cse0 (= ~waterLevel~0 (_ bv1 32))) (.cse4 (= (_ bv0 32) ~systemActive~0)) (.cse1 (= (_ bv0 32) ~pumpRunning~0)) (.cse5 (= ~waterLevel~0 (_ bv2 32))) (.cse2 (= ~methAndRunningLastTime~0 (_ bv0 32))) (.cse3 (= (_ bv1 32) ~systemActive~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse4 .cse2) (and .cse1 .cse4 .cse5 .cse2) (and .cse5 (= (_ bv1 32) ~pumpRunning~0) .cse3) (and .cse1 .cse5 .cse2 .cse3))) [2024-11-09 23:16:53,633 WARN L156 FloydHoareUtils]: Requires clause for timeShift contained old-variable. Original clause: (let ((.cse5 (= (_ bv2 32) |old(~waterLevel~0)|)) (.cse7 (= (_ bv1 32) |old(~waterLevel~0)|)) (.cse6 (= (_ bv0 32) |old(~methAndRunningLastTime~0)|)) (.cse3 (= (_ bv0 32) ~systemActive~0))) (let ((.cse2 (not .cse3)) (.cse0 (not .cse6)) (.cse13 (not .cse7)) (.cse10 (= (_ bv0 32) ~pumpRunning~0)) (.cse1 (= ~methAndRunningLastTime~0 (_ bv0 32))) (.cse8 (= (_ bv1 32) ~systemActive~0)) (.cse4 (= (_ bv0 32) |old(~pumpRunning~0)|)) (.cse12 (not .cse5)) (.cse11 (= ~waterLevel~0 (_ bv2 32))) (.cse9 (= (_ bv1 32) |old(~pumpRunning~0)|))) (and (or .cse0 .cse1 .cse2) (or (and .cse3 .cse4 .cse5) (and .cse6 .cse4 .cse7 .cse8) (and .cse3 .cse4 .cse7) (and .cse6 .cse4 .cse5 .cse8) (and .cse9 .cse5 .cse8)) (or (and .cse10 .cse11) .cse12 .cse2) (or (and (= ~waterLevel~0 (_ bv1 32)) .cse10) .cse13) (or .cse0 .cse13 .cse1) (or (and .cse10 .cse11 .cse1) (not .cse8) (not .cse4) .cse12) (or (and .cse11 (= (_ bv1 32) ~pumpRunning~0)) (not .cse9))))) Eliminated clause: (exists ((|old(~waterLevel~0)| (_ BitVec 32)) (|old(~methAndRunningLastTime~0)| (_ BitVec 32)) (|old(~pumpRunning~0)| (_ BitVec 32))) (let ((.cse5 (= (_ bv2 32) |old(~waterLevel~0)|)) (.cse7 (= (_ bv1 32) |old(~waterLevel~0)|)) (.cse6 (= (_ bv0 32) |old(~methAndRunningLastTime~0)|)) (.cse3 (= (_ bv0 32) ~systemActive~0))) (let ((.cse2 (not .cse3)) (.cse0 (not .cse6)) (.cse13 (not .cse7)) (.cse10 (= (_ bv0 32) ~pumpRunning~0)) (.cse1 (= ~methAndRunningLastTime~0 (_ bv0 32))) (.cse8 (= (_ bv1 32) ~systemActive~0)) (.cse4 (= (_ bv0 32) |old(~pumpRunning~0)|)) (.cse12 (not .cse5)) (.cse11 (= ~waterLevel~0 (_ bv2 32))) (.cse9 (= (_ bv1 32) |old(~pumpRunning~0)|))) (and (or .cse0 .cse1 .cse2) (or (and .cse3 .cse4 .cse5) (and .cse6 .cse4 .cse7 .cse8) (and .cse3 .cse4 .cse7) (and .cse6 .cse4 .cse5 .cse8) (and .cse9 .cse5 .cse8)) (or (and .cse10 .cse11) .cse12 .cse2) (or (and (= ~waterLevel~0 (_ bv1 32)) .cse10) .cse13) (or .cse0 .cse13 .cse1) (or (and .cse10 .cse11 .cse1) (not .cse8) (not .cse4) .cse12) (or (and .cse11 (= (_ bv1 32) ~pumpRunning~0)) (not .cse9)))))) [2024-11-09 23:16:53,660 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-09 23:16:53,680 WARN L156 FloydHoareUtils]: Requires clause for processEnvironment__wrappee__highWaterSensor contained old-variable. Original clause: (and (= (_ bv0 32) ~pumpRunning~0) (let ((.cse1 (= ~waterLevel~0 (_ bv2 32))) (.cse4 (= ~methaneLevelCritical~0 (_ bv0 32))) (.cse5 (= ~waterLevel~0 (_ bv1 32))) (.cse0 (= (_ bv0 32) |old(~pumpRunning~0)|)) (.cse2 (= ~methAndRunningLastTime~0 (_ bv0 32))) (.cse3 (= (_ bv1 32) ~systemActive~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse4 .cse3) (and .cse5 .cse0 .cse4 .cse3) (and .cse5 .cse0 .cse2 .cse3)))) Eliminated clause: (and (= (_ bv0 32) ~pumpRunning~0) (let ((.cse1 (= ~methaneLevelCritical~0 (_ bv0 32))) (.cse3 (= ~waterLevel~0 (_ bv2 32))) (.cse0 (= ~waterLevel~0 (_ bv1 32))) (.cse4 (= ~methAndRunningLastTime~0 (_ bv0 32))) (.cse2 (= (_ bv1 32) ~systemActive~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and .cse0 .cse4 .cse2)))) [2024-11-09 23:16:53,708 WARN L156 FloydHoareUtils]: Requires clause for waterRise contained old-variable. Original clause: (let ((.cse0 (= (_ bv1 32) |old(~waterLevel~0)|)) (.cse1 (= (_ bv2 32) |old(~waterLevel~0)|))) (and (or (= ~waterLevel~0 (_ bv1 32)) (not .cse0)) (let ((.cse5 (= (_ bv0 32) ~systemActive~0)) (.cse3 (= (_ bv0 32) ~pumpRunning~0)) (.cse4 (= ~methAndRunningLastTime~0 (_ bv0 32))) (.cse2 (= (_ bv1 32) ~systemActive~0))) (or (and (= (_ bv1 32) ~pumpRunning~0) .cse1 .cse2) (and .cse3 .cse0 .cse4 .cse2) (and .cse3 .cse5 .cse0 .cse4) (and .cse3 .cse5 .cse4 .cse1) (and .cse3 .cse4 .cse1 .cse2))) (or (= ~waterLevel~0 (_ bv2 32)) (not .cse1)))) Eliminated clause: (exists ((|old(~waterLevel~0)| (_ BitVec 32))) (let ((.cse0 (= (_ bv1 32) |old(~waterLevel~0)|)) (.cse1 (= (_ bv2 32) |old(~waterLevel~0)|))) (and (or (= ~waterLevel~0 (_ bv1 32)) (not .cse0)) (let ((.cse5 (= (_ bv0 32) ~systemActive~0)) (.cse3 (= (_ bv0 32) ~pumpRunning~0)) (.cse4 (= ~methAndRunningLastTime~0 (_ bv0 32))) (.cse2 (= (_ bv1 32) ~systemActive~0))) (or (and (= (_ bv1 32) ~pumpRunning~0) .cse1 .cse2) (and .cse3 .cse0 .cse4 .cse2) (and .cse3 .cse5 .cse0 .cse4) (and .cse3 .cse5 .cse4 .cse1) (and .cse3 .cse4 .cse1 .cse2))) (or (= ~waterLevel~0 (_ bv2 32)) (not .cse1))))) [2024-11-09 23:16:53,722 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-09 23:16:53,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 11:16:53 BoogieIcfgContainer [2024-11-09 23:16:53,725 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 23:16:53,726 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 23:16:53,726 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 23:16:53,726 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 23:16:53,726 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:16:40" (3/4) ... [2024-11-09 23:16:53,729 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-09 23:16:53,733 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure deactivatePump [2024-11-09 23:16:53,733 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2024-11-09 23:16:53,733 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2024-11-09 23:16:53,733 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure isMethaneLevelCritical [2024-11-09 23:16:53,733 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure cleanup [2024-11-09 23:16:53,733 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure timeShift [2024-11-09 23:16:53,733 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2024-11-09 23:16:53,733 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure waterRise [2024-11-09 23:16:53,744 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 40 nodes and edges [2024-11-09 23:16:53,745 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-11-09 23:16:53,745 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 23:16:53,746 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 23:16:53,746 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 23:16:53,865 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 23:16:53,866 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 23:16:53,866 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 23:16:53,867 INFO L158 Benchmark]: Toolchain (without parser) took 14354.42ms. Allocated memory was 65.0MB in the beginning and 404.8MB in the end (delta: 339.7MB). Free memory was 33.4MB in the beginning and 225.8MB in the end (delta: -192.4MB). Peak memory consumption was 146.0MB. Max. memory is 16.1GB. [2024-11-09 23:16:53,867 INFO L158 Benchmark]: CDTParser took 0.95ms. Allocated memory is still 48.2MB. Free memory is still 28.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 23:16:53,867 INFO L158 Benchmark]: CACSL2BoogieTranslator took 533.16ms. Allocated memory is still 65.0MB. Free memory was 33.2MB in the beginning and 27.4MB in the end (delta: 5.8MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2024-11-09 23:16:53,868 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.78ms. Allocated memory is still 65.0MB. Free memory was 27.4MB in the beginning and 43.2MB in the end (delta: -15.8MB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. [2024-11-09 23:16:53,869 INFO L158 Benchmark]: Boogie Preprocessor took 60.86ms. Allocated memory is still 65.0MB. Free memory was 43.2MB in the beginning and 41.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 23:16:53,870 INFO L158 Benchmark]: IcfgBuilder took 572.06ms. Allocated memory was 65.0MB in the beginning and 81.8MB in the end (delta: 16.8MB). Free memory was 41.0MB in the beginning and 53.5MB in the end (delta: -12.5MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. [2024-11-09 23:16:53,870 INFO L158 Benchmark]: TraceAbstraction took 12969.13ms. Allocated memory was 81.8MB in the beginning and 404.8MB in the end (delta: 323.0MB). Free memory was 53.0MB in the beginning and 233.1MB in the end (delta: -180.1MB). Peak memory consumption was 171.7MB. Max. memory is 16.1GB. [2024-11-09 23:16:53,870 INFO L158 Benchmark]: Witness Printer took 140.58ms. Allocated memory is still 404.8MB. Free memory was 233.1MB in the beginning and 225.8MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 23:16:53,872 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.95ms. Allocated memory is still 48.2MB. Free memory is still 28.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 533.16ms. Allocated memory is still 65.0MB. Free memory was 33.2MB in the beginning and 27.4MB in the end (delta: 5.8MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.78ms. Allocated memory is still 65.0MB. Free memory was 27.4MB in the beginning and 43.2MB in the end (delta: -15.8MB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.86ms. Allocated memory is still 65.0MB. Free memory was 43.2MB in the beginning and 41.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 572.06ms. Allocated memory was 65.0MB in the beginning and 81.8MB in the end (delta: 16.8MB). Free memory was 41.0MB in the beginning and 53.5MB in the end (delta: -12.5MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. * TraceAbstraction took 12969.13ms. Allocated memory was 81.8MB in the beginning and 404.8MB in the end (delta: 323.0MB). Free memory was 53.0MB in the beginning and 233.1MB in the end (delta: -180.1MB). Peak memory consumption was 171.7MB. Max. memory is 16.1GB. * Witness Printer took 140.58ms. Allocated memory is still 404.8MB. Free memory was 233.1MB in the beginning and 225.8MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [49] - GenericResultAtLocation [Line: 124]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [124] - GenericResultAtLocation [Line: 354]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [354] - GenericResultAtLocation [Line: 455]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [455] - GenericResultAtLocation [Line: 495]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [495] - GenericResultAtLocation [Line: 530]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [530] - GenericResultAtLocation [Line: 634]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [634] - GenericResultAtLocation [Line: 1000]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1000] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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 - PositiveResult [Line: 1005]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.7s, OverallIterations: 14, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1267 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1245 mSDsluCounter, 4079 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2551 mSDsCounter, 285 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 748 IncrementalHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 285 mSolverCounterUnsat, 1528 mSDtfsCounter, 748 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 939 GetRequests, 888 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4027occurred in iteration=12, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 319 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 835 NumberOfCodeBlocks, 835 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 916 ConstructedInterpolants, 0 QuantifiedInterpolants, 1795 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1823 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 15 InterpolantComputations, 13 PerfectInterpolantSequences, 165/178 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 66]: Location Invariant Derived location invariant: null - InvariantResult [Line: 366]: Location Invariant Derived location invariant: null - ProcedureContractResult [Line: 229]: Procedure Contract for deactivatePump Derived contract for procedure deactivatePump. Requires: ((((waterLevel == 1) && (1 == systemActive)) || ((waterLevel == 2) && (0 != systemActive))) && (1 == pumpRunning)) Ensures: (((0 == pumpRunning) && ((((waterLevel == 1) && (1 == \old(pumpRunning))) && (1 == systemActive)) || (((1 == \old(pumpRunning)) && (waterLevel == 2)) && (0 != systemActive)))) && ((((((systemActive == \old(systemActive)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (methAndRunningLastTime == \old(methAndRunningLastTime))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (head == \old(head)))) - ProcedureContractResult [Line: 162]: Procedure Contract for processEnvironment__wrappee__base Derived contract for procedure processEnvironment__wrappee__base. Requires: (((((((waterLevel == 1) && (0 == pumpRunning)) && (methaneLevelCritical == 0)) && (1 == systemActive)) || ((((waterLevel == 1) && (0 == pumpRunning)) && (methAndRunningLastTime == 0)) && (1 == systemActive))) || ((((0 == pumpRunning) && (waterLevel == 2)) && (methAndRunningLastTime == 0)) && (1 == systemActive))) || ((((0 == pumpRunning) && (waterLevel == 2)) && (methaneLevelCritical == 0)) && (1 == systemActive))) Ensures: ((((((((waterLevel == 1) && (0 == pumpRunning)) && (methaneLevelCritical == 0)) && (1 == systemActive)) || ((((waterLevel == 1) && (0 == pumpRunning)) && (methAndRunningLastTime == 0)) && (1 == systemActive))) || ((((0 == pumpRunning) && (waterLevel == 2)) && (methAndRunningLastTime == 0)) && (1 == systemActive))) || ((((0 == pumpRunning) && (waterLevel == 2)) && (methaneLevelCritical == 0)) && (1 == systemActive))) && (((((((pumpRunning == \old(pumpRunning)) && (systemActive == \old(systemActive))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (methAndRunningLastTime == \old(methAndRunningLastTime))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (head == \old(head)))) - ProcedureContractResult [Line: 558]: Procedure Contract for changeMethaneLevel Derived contract for procedure changeMethaneLevel. Requires: ((((((((waterLevel == 1) && (0 == pumpRunning)) && (methAndRunningLastTime == 0)) && (1 == systemActive)) || ((((waterLevel == 1) && (0 == pumpRunning)) && (0 == systemActive)) && (methAndRunningLastTime == 0))) || ((((0 == pumpRunning) && (0 == systemActive)) && (waterLevel == 2)) && (methAndRunningLastTime == 0))) || (((waterLevel == 2) && (1 == pumpRunning)) && (1 == systemActive))) || ((((0 == pumpRunning) && (waterLevel == 2)) && (methAndRunningLastTime == 0)) && (1 == systemActive))) Ensures: (((((((((waterLevel == 1) && (0 == pumpRunning)) && (methAndRunningLastTime == 0)) && (1 == systemActive)) || ((((waterLevel == 1) && (0 == pumpRunning)) && (0 == systemActive)) && (methAndRunningLastTime == 0))) || ((((0 == pumpRunning) && (0 == systemActive)) && (waterLevel == 2)) && (methAndRunningLastTime == 0))) || (((waterLevel == 2) && (1 == pumpRunning)) && (1 == systemActive))) || ((((0 == pumpRunning) && (waterLevel == 2)) && (methAndRunningLastTime == 0)) && (1 == systemActive))) && ((((((pumpRunning == \old(pumpRunning)) && (systemActive == \old(systemActive))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (methAndRunningLastTime == \old(methAndRunningLastTime))) && (waterLevel == \old(waterLevel))) && (head == \old(head)))) - ProcedureContractResult [Line: 570]: Procedure Contract for isMethaneLevelCritical Derived contract for procedure isMethaneLevelCritical. Requires: ((((((((waterLevel == 1) && (0 == pumpRunning)) && (0 == systemActive)) || (((0 == pumpRunning) && (waterLevel == 2)) && (1 == systemActive))) || (((waterLevel == 1) && (0 == pumpRunning)) && (1 == systemActive))) || ((((waterLevel == 2) && (methAndRunningLastTime == 0)) && (1 == pumpRunning)) && (1 == systemActive))) || (((0 == pumpRunning) && (0 == systemActive)) && (waterLevel == 2))) || ((((waterLevel == 2) && (1 == pumpRunning)) && (methaneLevelCritical == 0)) && (1 == systemActive))) Ensures: ((((((((((waterLevel == 1) && (0 == pumpRunning)) && (0 == systemActive)) || (((0 == pumpRunning) && (waterLevel == 2)) && (1 == systemActive))) || (((waterLevel == 1) && (0 == pumpRunning)) && (1 == systemActive))) || ((((waterLevel == 2) && (methAndRunningLastTime == 0)) && (1 == pumpRunning)) && (1 == systemActive))) || (((0 == pumpRunning) && (0 == systemActive)) && (waterLevel == 2))) || ((((waterLevel == 2) && (1 == pumpRunning)) && (methaneLevelCritical == 0)) && (1 == systemActive))) && ((methaneLevelCritical != 0) || (0 == \result))) && (((((((pumpRunning == \old(pumpRunning)) && (systemActive == \old(systemActive))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (methAndRunningLastTime == \old(methAndRunningLastTime))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (head == \old(head)))) - ProcedureContractResult [Line: 356]: Procedure Contract for cleanup Derived contract for procedure cleanup. Requires: 0 Ensures: (0 && ((((systemActive == \old(systemActive)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (head == \old(head)))) - ProcedureContractResult [Line: 138]: Procedure Contract for timeShift Derived contract for procedure timeShift. Ensures: ((((((((1 != \old(waterLevel)) || (((waterLevel == 1) && (0 == pumpRunning)) && (methAndRunningLastTime == 0))) && ((methaneLevelCritical != 0) || (methAndRunningLastTime == 0))) && (((((0 == pumpRunning) && (waterLevel == 2)) && (methAndRunningLastTime == 0)) || (2 != \old(waterLevel))) || (0 != systemActive))) && ((1 != \old(pumpRunning)) || (((waterLevel == 1) && (0 == pumpRunning)) && (methAndRunningLastTime == 0)))) && (((((waterLevel == 2) && (1 == pumpRunning)) || (((0 == pumpRunning) && (waterLevel == 2)) && (methAndRunningLastTime == 0))) || (0 != \old(pumpRunning))) || (2 != \old(waterLevel)))) && (((((((0 == systemActive) && (0 == \old(pumpRunning))) && (2 == \old(waterLevel))) || ((((0 == \old(methAndRunningLastTime)) && (0 == \old(pumpRunning))) && (1 == \old(waterLevel))) && (1 == systemActive))) || (((0 == systemActive) && (0 == \old(pumpRunning))) && (1 == \old(waterLevel)))) || ((((0 == \old(methAndRunningLastTime)) && (0 == \old(pumpRunning))) && (2 == \old(waterLevel))) && (1 == systemActive))) || (((1 == \old(pumpRunning)) && (2 == \old(waterLevel))) && (1 == systemActive)))) && ((((systemActive == \old(systemActive)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (head == \old(head)))) - ProcedureContractResult [Line: 170]: Procedure Contract for processEnvironment__wrappee__highWaterSensor Derived contract for procedure processEnvironment__wrappee__highWaterSensor. Requires: ((0 == pumpRunning) && ((((((waterLevel == 1) && (methaneLevelCritical == 0)) && (1 == systemActive)) || (((waterLevel == 2) && (methaneLevelCritical == 0)) && (1 == systemActive))) || (((waterLevel == 2) && (methAndRunningLastTime == 0)) && (1 == systemActive))) || (((waterLevel == 1) && (methAndRunningLastTime == 0)) && (1 == systemActive)))) Ensures: ((((((((((0 == \old(pumpRunning)) && (waterLevel == 2)) && (methAndRunningLastTime == 0)) && (1 == systemActive)) || ((((0 == \old(pumpRunning)) && (waterLevel == 2)) && (methaneLevelCritical == 0)) && (1 == systemActive))) || ((((waterLevel == 1) && (0 == \old(pumpRunning))) && (methaneLevelCritical == 0)) && (1 == systemActive))) || ((((waterLevel == 1) && (0 == \old(pumpRunning))) && (methAndRunningLastTime == 0)) && (1 == systemActive))) && ((0 == pumpRunning) || (waterLevel != 1))) && ((0 == pumpRunning) || (1 == pumpRunning))) && ((((((systemActive == \old(systemActive)) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (methAndRunningLastTime == \old(methAndRunningLastTime))) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (head == \old(head)))) - ProcedureContractResult [Line: 546]: Procedure Contract for waterRise Derived contract for procedure waterRise. Ensures: (((waterLevel == 2) && (((((((1 == pumpRunning) && (2 == \old(waterLevel))) && (1 == systemActive)) || ((((0 == pumpRunning) && (1 == \old(waterLevel))) && (methAndRunningLastTime == 0)) && (1 == systemActive))) || ((((0 == pumpRunning) && (0 == systemActive)) && (1 == \old(waterLevel))) && (methAndRunningLastTime == 0))) || ((((0 == pumpRunning) && (0 == systemActive)) && (methAndRunningLastTime == 0)) && (2 == \old(waterLevel)))) || ((((0 == pumpRunning) && (methAndRunningLastTime == 0)) && (2 == \old(waterLevel))) && (1 == systemActive)))) && ((((((pumpRunning == \old(pumpRunning)) && (systemActive == \old(systemActive))) && (cleanupTimeShifts == \old(cleanupTimeShifts))) && (methAndRunningLastTime == \old(methAndRunningLastTime))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (head == \old(head)))) RESULT: Ultimate proved your program to be correct! [2024-11-09 23:16:53,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE