./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec4_product37.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec4_product37.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e3509f37a4190025a6bf9c4e7a81c42e49e3316a9582aab003e20039c8a6c594 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:02:08,475 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:02:08,515 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:02:08,519 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:02:08,519 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:02:08,534 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:02:08,535 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:02:08,535 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:02:08,535 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:02:08,535 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:02:08,535 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:02:08,535 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:02:08,535 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:02:08,536 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:02:08,536 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:02:08,536 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:02:08,536 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:02:08,536 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:02:08,536 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:02:08,536 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:02:08,536 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:02:08,536 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:02:08,536 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:02:08,537 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:02:08,537 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:02:08,537 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:02:08,537 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:02:08,537 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:02:08,537 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:02:08,537 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:02:08,537 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:02:08,537 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:02:08,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:02:08,537 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:02:08,537 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:02:08,537 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:02:08,537 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:02:08,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:02:08,537 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:02:08,537 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:02:08,538 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:02:08,538 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:02:08,538 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:02:08,538 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:02:08,538 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:02:08,538 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:02:08,538 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:02:08,538 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:02:08,538 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e3509f37a4190025a6bf9c4e7a81c42e49e3316a9582aab003e20039c8a6c594 [2025-01-09 04:02:08,784 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:02:08,790 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:02:08,791 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:02:08,792 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:02:08,792 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:02:08,793 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec4_product37.cil.c [2025-01-09 04:02:10,098 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6b082c0ec/5efda71e04c74e889ccbfe32e8ab4a87/FLAGe41efdf4d [2025-01-09 04:02:10,443 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:02:10,443 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product37.cil.c [2025-01-09 04:02:10,456 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6b082c0ec/5efda71e04c74e889ccbfe32e8ab4a87/FLAGe41efdf4d [2025-01-09 04:02:10,469 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6b082c0ec/5efda71e04c74e889ccbfe32e8ab4a87 [2025-01-09 04:02:10,471 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:02:10,473 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:02:10,474 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:02:10,474 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:02:10,476 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:02:10,477 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:02:10" (1/1) ... [2025-01-09 04:02:10,478 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3591ea1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:10, skipping insertion in model container [2025-01-09 04:02:10,478 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:02:10" (1/1) ... [2025-01-09 04:02:10,506 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:02:10,646 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product37.cil.c[6698,6711] [2025-01-09 04:02:10,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:02:10,694 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:02:10,700 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [49] [2025-01-09 04:02:10,701 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [87] [2025-01-09 04:02:10,701 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [156] [2025-01-09 04:02:10,701 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [343] [2025-01-09 04:02:10,701 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [439] [2025-01-09 04:02:10,701 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [448] [2025-01-09 04:02:10,701 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [543] [2025-01-09 04:02:10,701 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [909] [2025-01-09 04:02:10,711 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product37.cil.c[6698,6711] [2025-01-09 04:02:10,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:02:10,748 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:02:10,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:10 WrapperNode [2025-01-09 04:02:10,749 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:02:10,749 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:02:10,750 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:02:10,750 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:02:10,754 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:10" (1/1) ... [2025-01-09 04:02:10,762 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:10" (1/1) ... [2025-01-09 04:02:10,775 INFO L138 Inliner]: procedures = 53, calls = 97, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 195 [2025-01-09 04:02:10,776 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:02:10,776 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:02:10,776 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:02:10,776 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:02:10,782 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:10" (1/1) ... [2025-01-09 04:02:10,783 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:10" (1/1) ... [2025-01-09 04:02:10,784 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:10" (1/1) ... [2025-01-09 04:02:10,792 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]. [2025-01-09 04:02:10,792 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:10" (1/1) ... [2025-01-09 04:02:10,792 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:10" (1/1) ... [2025-01-09 04:02:10,796 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:10" (1/1) ... [2025-01-09 04:02:10,797 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:10" (1/1) ... [2025-01-09 04:02:10,799 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:10" (1/1) ... [2025-01-09 04:02:10,800 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:10" (1/1) ... [2025-01-09 04:02:10,801 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:10" (1/1) ... [2025-01-09 04:02:10,802 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:02:10,803 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:02:10,803 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:02:10,803 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:02:10,803 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:10" (1/1) ... [2025-01-09 04:02:10,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:02:10,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:02:10,830 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 04:02:10,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 04:02:10,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:02:10,853 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2025-01-09 04:02:10,853 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2025-01-09 04:02:10,853 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-01-09 04:02:10,853 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-01-09 04:02:10,853 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-01-09 04:02:10,853 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-01-09 04:02:10,853 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2025-01-09 04:02:10,854 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2025-01-09 04:02:10,854 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2025-01-09 04:02:10,854 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2025-01-09 04:02:10,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:02:10,854 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2025-01-09 04:02:10,855 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2025-01-09 04:02:10,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:02:10,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:02:10,934 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:02:10,940 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:02:11,188 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2025-01-09 04:02:11,188 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:02:11,199 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:02:11,199 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 04:02:11,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:02:11 BoogieIcfgContainer [2025-01-09 04:02:11,199 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:02:11,201 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:02:11,201 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:02:11,204 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:02:11,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:02:10" (1/3) ... [2025-01-09 04:02:11,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aa7b7db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:02:11, skipping insertion in model container [2025-01-09 04:02:11,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:10" (2/3) ... [2025-01-09 04:02:11,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aa7b7db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:02:11, skipping insertion in model container [2025-01-09 04:02:11,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:02:11" (3/3) ... [2025-01-09 04:02:11,206 INFO L128 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product37.cil.c [2025-01-09 04:02:11,217 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:02:11,218 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG minepump_spec4_product37.cil.c that has 7 procedures, 78 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 04:02:11,255 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:02:11,264 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;@6e864854, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:02:11,264 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:02:11,267 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 68 states have internal predecessors, (83), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2025-01-09 04:02:11,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 04:02:11,271 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:02:11,272 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:02:11,272 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:02:11,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:02:11,276 INFO L85 PathProgramCache]: Analyzing trace with hash 225234383, now seen corresponding path program 1 times [2025-01-09 04:02:11,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:02:11,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925778587] [2025-01-09 04:02:11,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:02:11,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:02:11,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 04:02:11,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 04:02:11,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:02:11,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:02:11,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:02:11,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:02:11,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925778587] [2025-01-09 04:02:11,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925778587] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:02:11,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:02:11,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:02:11,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54099970] [2025-01-09 04:02:11,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:02:11,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:02:11,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:02:11,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:02:11,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:02:11,464 INFO L87 Difference]: Start difference. First operand has 78 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 68 states have internal predecessors, (83), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:02:11,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:02:11,483 INFO L93 Difference]: Finished difference Result 136 states and 182 transitions. [2025-01-09 04:02:11,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:02:11,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-01-09 04:02:11,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:02:11,489 INFO L225 Difference]: With dead ends: 136 [2025-01-09 04:02:11,489 INFO L226 Difference]: Without dead ends: 61 [2025-01-09 04:02:11,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:02:11,493 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 12 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 149 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 [2025-01-09 04:02:11,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 149 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:02:11,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-01-09 04:02:11,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-01-09 04:02:11,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 55 states have internal predecessors, (65), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-09 04:02:11,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 79 transitions. [2025-01-09 04:02:11,528 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 79 transitions. Word has length 19 [2025-01-09 04:02:11,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:02:11,529 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 79 transitions. [2025-01-09 04:02:11,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:02:11,530 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 79 transitions. [2025-01-09 04:02:11,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 04:02:11,531 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:02:11,531 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:02:11,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:02:11,532 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:02:11,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:02:11,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1314738436, now seen corresponding path program 1 times [2025-01-09 04:02:11,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:02:11,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919226893] [2025-01-09 04:02:11,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:02:11,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:02:11,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 04:02:11,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 04:02:11,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:02:11,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:02:11,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:02:11,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:02:11,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919226893] [2025-01-09 04:02:11,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919226893] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:02:11,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:02:11,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:02:11,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623820669] [2025-01-09 04:02:11,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:02:11,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:02:11,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:02:11,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:02:11,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:02:11,719 INFO L87 Difference]: Start difference. First operand 61 states and 79 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:02:11,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:02:11,800 INFO L93 Difference]: Finished difference Result 115 states and 152 transitions. [2025-01-09 04:02:11,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:02:11,801 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-01-09 04:02:11,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:02:11,802 INFO L225 Difference]: With dead ends: 115 [2025-01-09 04:02:11,802 INFO L226 Difference]: Without dead ends: 61 [2025-01-09 04:02:11,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:02:11,804 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 75 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:02:11,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 193 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:02:11,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-01-09 04:02:11,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-01-09 04:02:11,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 55 states have internal predecessors, (64), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-09 04:02:11,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 78 transitions. [2025-01-09 04:02:11,813 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 78 transitions. Word has length 23 [2025-01-09 04:02:11,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:02:11,813 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 78 transitions. [2025-01-09 04:02:11,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:02:11,814 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 78 transitions. [2025-01-09 04:02:11,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 04:02:11,814 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:02:11,814 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:02:11,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:02:11,815 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:02:11,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:02:11,815 INFO L85 PathProgramCache]: Analyzing trace with hash -935028557, now seen corresponding path program 1 times [2025-01-09 04:02:11,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:02:11,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765082254] [2025-01-09 04:02:11,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:02:11,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:02:11,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 04:02:11,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 04:02:11,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:02:11,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:02:11,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:02:11,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:02:11,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765082254] [2025-01-09 04:02:11,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765082254] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:02:11,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:02:11,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:02:11,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364044747] [2025-01-09 04:02:11,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:02:11,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:02:11,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:02:11,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:02:11,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:02:11,854 INFO L87 Difference]: Start difference. First operand 61 states and 78 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:02:11,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:02:11,893 INFO L93 Difference]: Finished difference Result 152 states and 201 transitions. [2025-01-09 04:02:11,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:02:11,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-01-09 04:02:11,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:02:11,894 INFO L225 Difference]: With dead ends: 152 [2025-01-09 04:02:11,894 INFO L226 Difference]: Without dead ends: 98 [2025-01-09 04:02:11,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:02:11,895 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 61 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:02:11,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 139 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:02:11,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-01-09 04:02:11,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2025-01-09 04:02:11,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 75 states have (on average 1.32) internal successors, (99), 82 states have internal predecessors, (99), 10 states have call successors, (10), 10 states have call predecessors, (10), 10 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2025-01-09 04:02:11,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 123 transitions. [2025-01-09 04:02:11,917 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 123 transitions. Word has length 29 [2025-01-09 04:02:11,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:02:11,917 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 123 transitions. [2025-01-09 04:02:11,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:02:11,918 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 123 transitions. [2025-01-09 04:02:11,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 04:02:11,918 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:02:11,918 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:02:11,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:02:11,919 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:02:11,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:02:11,919 INFO L85 PathProgramCache]: Analyzing trace with hash -227967938, now seen corresponding path program 1 times [2025-01-09 04:02:11,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:02:11,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422251818] [2025-01-09 04:02:11,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:02:11,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:02:11,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 04:02:11,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 04:02:11,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:02:11,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:02:11,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:02:11,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:02:11,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422251818] [2025-01-09 04:02:11,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422251818] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:02:11,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:02:11,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:02:11,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715953735] [2025-01-09 04:02:11,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:02:11,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:02:11,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:02:11,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:02:11,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:02:11,993 INFO L87 Difference]: Start difference. First operand 96 states and 123 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 04:02:12,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:02:12,028 INFO L93 Difference]: Finished difference Result 188 states and 247 transitions. [2025-01-09 04:02:12,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:02:12,028 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 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 37 [2025-01-09 04:02:12,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:02:12,029 INFO L225 Difference]: With dead ends: 188 [2025-01-09 04:02:12,029 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 04:02:12,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:02:12,030 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 294 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 [2025-01-09 04:02:12,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 294 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:02:12,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 04:02:12,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-01-09 04:02:12,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 78 states have (on average 1.3076923076923077) internal successors, (102), 85 states have internal predecessors, (102), 10 states have call successors, (10), 10 states have call predecessors, (10), 10 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2025-01-09 04:02:12,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 126 transitions. [2025-01-09 04:02:12,038 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 126 transitions. Word has length 37 [2025-01-09 04:02:12,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:02:12,039 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 126 transitions. [2025-01-09 04:02:12,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 04:02:12,039 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 126 transitions. [2025-01-09 04:02:12,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 04:02:12,039 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:02:12,040 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:02:12,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:02:12,040 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:02:12,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:02:12,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1239085188, now seen corresponding path program 1 times [2025-01-09 04:02:12,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:02:12,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140275418] [2025-01-09 04:02:12,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:02:12,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:02:12,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 04:02:12,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 04:02:12,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:02:12,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:02:12,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:02:12,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:02:12,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140275418] [2025-01-09 04:02:12,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140275418] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:02:12,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:02:12,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:02:12,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799827953] [2025-01-09 04:02:12,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:02:12,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:02:12,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:02:12,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:02:12,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:02:12,116 INFO L87 Difference]: Start difference. First operand 99 states and 126 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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) [2025-01-09 04:02:12,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:02:12,147 INFO L93 Difference]: Finished difference Result 193 states and 256 transitions. [2025-01-09 04:02:12,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:02:12,149 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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 37 [2025-01-09 04:02:12,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:02:12,150 INFO L225 Difference]: With dead ends: 193 [2025-01-09 04:02:12,150 INFO L226 Difference]: Without dead ends: 101 [2025-01-09 04:02:12,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:02:12,153 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:02:12,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 362 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:02:12,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-01-09 04:02:12,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-01-09 04:02:12,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 80 states have (on average 1.3) internal successors, (104), 87 states have internal predecessors, (104), 10 states have call successors, (10), 10 states have call predecessors, (10), 10 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2025-01-09 04:02:12,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 128 transitions. [2025-01-09 04:02:12,164 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 128 transitions. Word has length 37 [2025-01-09 04:02:12,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:02:12,164 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 128 transitions. [2025-01-09 04:02:12,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 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) [2025-01-09 04:02:12,164 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 128 transitions. [2025-01-09 04:02:12,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 04:02:12,165 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:02:12,165 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:02:12,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:02:12,165 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:02:12,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:02:12,165 INFO L85 PathProgramCache]: Analyzing trace with hash 2034813754, now seen corresponding path program 1 times [2025-01-09 04:02:12,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:02:12,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471491371] [2025-01-09 04:02:12,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:02:12,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:02:12,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 04:02:12,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 04:02:12,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:02:12,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:02:12,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:02:12,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:02:12,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471491371] [2025-01-09 04:02:12,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471491371] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:02:12,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:02:12,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:02:12,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969349521] [2025-01-09 04:02:12,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:02:12,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:02:12,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:02:12,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:02:12,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:02:12,267 INFO L87 Difference]: Start difference. First operand 101 states and 128 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 04:02:12,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:02:12,329 INFO L93 Difference]: Finished difference Result 326 states and 431 transitions. [2025-01-09 04:02:12,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:02:12,329 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2025-01-09 04:02:12,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:02:12,331 INFO L225 Difference]: With dead ends: 326 [2025-01-09 04:02:12,331 INFO L226 Difference]: Without dead ends: 232 [2025-01-09 04:02:12,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:02:12,332 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 103 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:02:12,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 253 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:02:12,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-01-09 04:02:12,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 223. [2025-01-09 04:02:12,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 175 states have (on average 1.2857142857142858) internal successors, (225), 188 states have internal predecessors, (225), 23 states have call successors, (23), 23 states have call predecessors, (23), 24 states have return successors, (41), 24 states have call predecessors, (41), 23 states have call successors, (41) [2025-01-09 04:02:12,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 289 transitions. [2025-01-09 04:02:12,354 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 289 transitions. Word has length 37 [2025-01-09 04:02:12,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:02:12,354 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 289 transitions. [2025-01-09 04:02:12,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 04:02:12,354 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 289 transitions. [2025-01-09 04:02:12,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 04:02:12,355 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:02:12,355 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:02:12,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:02:12,355 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:02:12,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:02:12,356 INFO L85 PathProgramCache]: Analyzing trace with hash 2101547524, now seen corresponding path program 1 times [2025-01-09 04:02:12,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:02:12,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889046971] [2025-01-09 04:02:12,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:02:12,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:02:12,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 04:02:12,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 04:02:12,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:02:12,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:02:12,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:02:12,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:02:12,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889046971] [2025-01-09 04:02:12,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889046971] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:02:12,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:02:12,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:02:12,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993247765] [2025-01-09 04:02:12,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:02:12,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:02:12,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:02:12,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:02:12,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:02:12,411 INFO L87 Difference]: Start difference. First operand 223 states and 289 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 04:02:12,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:02:12,455 INFO L93 Difference]: Finished difference Result 437 states and 569 transitions. [2025-01-09 04:02:12,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:02:12,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2025-01-09 04:02:12,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:02:12,458 INFO L225 Difference]: With dead ends: 437 [2025-01-09 04:02:12,458 INFO L226 Difference]: Without dead ends: 221 [2025-01-09 04:02:12,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:02:12,459 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 30 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:02:12,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 281 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:02:12,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-01-09 04:02:12,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2025-01-09 04:02:12,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 173 states have (on average 1.277456647398844) internal successors, (221), 186 states have internal predecessors, (221), 23 states have call successors, (23), 23 states have call predecessors, (23), 24 states have return successors, (41), 24 states have call predecessors, (41), 23 states have call successors, (41) [2025-01-09 04:02:12,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 285 transitions. [2025-01-09 04:02:12,488 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 285 transitions. Word has length 39 [2025-01-09 04:02:12,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:02:12,489 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 285 transitions. [2025-01-09 04:02:12,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 04:02:12,489 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 285 transitions. [2025-01-09 04:02:12,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 04:02:12,492 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:02:12,492 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:02:12,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:02:12,492 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:02:12,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:02:12,492 INFO L85 PathProgramCache]: Analyzing trace with hash -2001141536, now seen corresponding path program 1 times [2025-01-09 04:02:12,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:02:12,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106938618] [2025-01-09 04:02:12,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:02:12,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:02:12,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 04:02:12,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 04:02:12,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:02:12,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:02:12,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:02:12,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:02:12,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106938618] [2025-01-09 04:02:12,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106938618] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:02:12,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:02:12,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:02:12,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789934655] [2025-01-09 04:02:12,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:02:12,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:02:12,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:02:12,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:02:12,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:02:12,586 INFO L87 Difference]: Start difference. First operand 221 states and 285 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 04:02:12,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:02:12,644 INFO L93 Difference]: Finished difference Result 461 states and 628 transitions. [2025-01-09 04:02:12,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:02:12,649 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2025-01-09 04:02:12,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:02:12,651 INFO L225 Difference]: With dead ends: 461 [2025-01-09 04:02:12,651 INFO L226 Difference]: Without dead ends: 286 [2025-01-09 04:02:12,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:02:12,653 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 42 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:02:12,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 423 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:02:12,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-01-09 04:02:12,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2025-01-09 04:02:12,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 222 states have (on average 1.2657657657657657) internal successors, (281), 237 states have internal predecessors, (281), 31 states have call successors, (31), 31 states have call predecessors, (31), 32 states have return successors, (62), 32 states have call predecessors, (62), 31 states have call successors, (62) [2025-01-09 04:02:12,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 374 transitions. [2025-01-09 04:02:12,697 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 374 transitions. Word has length 41 [2025-01-09 04:02:12,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:02:12,698 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 374 transitions. [2025-01-09 04:02:12,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 04:02:12,698 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 374 transitions. [2025-01-09 04:02:12,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-09 04:02:12,701 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:02:12,701 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:02:12,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:02:12,702 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:02:12,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:02:12,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1903982122, now seen corresponding path program 1 times [2025-01-09 04:02:12,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:02:12,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521976984] [2025-01-09 04:02:12,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:02:12,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:02:12,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 04:02:12,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 04:02:12,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:02:12,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:02:12,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:02:12,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:02:12,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521976984] [2025-01-09 04:02:12,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521976984] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:02:12,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:02:12,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:02:12,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15711192] [2025-01-09 04:02:12,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:02:12,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:02:12,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:02:12,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:02:12,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:02:12,782 INFO L87 Difference]: Start difference. First operand 286 states and 374 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 04:02:12,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:02:12,930 INFO L93 Difference]: Finished difference Result 306 states and 400 transitions. [2025-01-09 04:02:12,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 04:02:12,930 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 43 [2025-01-09 04:02:12,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:02:12,932 INFO L225 Difference]: With dead ends: 306 [2025-01-09 04:02:12,932 INFO L226 Difference]: Without dead ends: 304 [2025-01-09 04:02:12,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:02:12,933 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 103 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:02:12,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 239 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:02:12,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-01-09 04:02:12,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2025-01-09 04:02:12,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 238 states have (on average 1.2478991596638656) internal successors, (297), 253 states have internal predecessors, (297), 31 states have call successors, (31), 31 states have call predecessors, (31), 34 states have return successors, (67), 32 states have call predecessors, (67), 31 states have call successors, (67) [2025-01-09 04:02:12,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 395 transitions. [2025-01-09 04:02:12,958 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 395 transitions. Word has length 43 [2025-01-09 04:02:12,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:02:12,958 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 395 transitions. [2025-01-09 04:02:12,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 04:02:12,958 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 395 transitions. [2025-01-09 04:02:12,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-09 04:02:12,959 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:02:12,961 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:02:12,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:02:12,962 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:02:12,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:02:12,963 INFO L85 PathProgramCache]: Analyzing trace with hash 654540074, now seen corresponding path program 1 times [2025-01-09 04:02:12,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:02:12,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716617783] [2025-01-09 04:02:12,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:02:12,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:02:12,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 04:02:12,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 04:02:12,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:02:12,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:02:13,128 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:02:13,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:02:13,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716617783] [2025-01-09 04:02:13,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716617783] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:02:13,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121989226] [2025-01-09 04:02:13,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:02:13,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:02:13,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:02:13,134 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:02:13,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 04:02:13,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 04:02:13,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 04:02:13,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:02:13,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:02:13,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 04:02:13,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:02:13,280 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:02:13,281 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:02:13,412 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:02:13,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121989226] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:02:13,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:02:13,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-01-09 04:02:13,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691578543] [2025-01-09 04:02:13,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:02:13,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:02:13,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:02:13,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:02:13,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:02:13,418 INFO L87 Difference]: Start difference. First operand 304 states and 395 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 04:02:13,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:02:13,617 INFO L93 Difference]: Finished difference Result 695 states and 957 transitions. [2025-01-09 04:02:13,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:02:13,618 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2025-01-09 04:02:13,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:02:13,621 INFO L225 Difference]: With dead ends: 695 [2025-01-09 04:02:13,621 INFO L226 Difference]: Without dead ends: 439 [2025-01-09 04:02:13,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 140 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:02:13,627 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 74 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:02:13,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 446 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:02:13,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2025-01-09 04:02:13,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 393. [2025-01-09 04:02:13,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 306 states have (on average 1.2483660130718954) internal successors, (382), 326 states have internal predecessors, (382), 41 states have call successors, (41), 41 states have call predecessors, (41), 45 states have return successors, (91), 39 states have call predecessors, (91), 41 states have call successors, (91) [2025-01-09 04:02:13,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 514 transitions. [2025-01-09 04:02:13,698 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 514 transitions. Word has length 72 [2025-01-09 04:02:13,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:02:13,698 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 514 transitions. [2025-01-09 04:02:13,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 04:02:13,699 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 514 transitions. [2025-01-09 04:02:13,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 04:02:13,704 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:02:13,704 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 04:02:13,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 04:02:13,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 04:02:13,905 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:02:13,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:02:13,905 INFO L85 PathProgramCache]: Analyzing trace with hash -61081696, now seen corresponding path program 2 times [2025-01-09 04:02:13,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:02:13,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572218462] [2025-01-09 04:02:13,906 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 04:02:13,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:02:13,925 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 103 statements into 2 equivalence classes. [2025-01-09 04:02:13,947 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 04:02:13,950 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 04:02:13,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 04:02:13,951 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 04:02:13,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 04:02:13,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 04:02:13,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:02:13,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 04:02:14,005 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 04:02:14,006 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 04:02:14,006 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 04:02:14,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:02:14,009 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:02:14,050 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 04:02:14,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:02:14 BoogieIcfgContainer [2025-01-09 04:02:14,053 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 04:02:14,053 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 04:02:14,053 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 04:02:14,053 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 04:02:14,054 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:02:11" (3/4) ... [2025-01-09 04:02:14,055 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 04:02:14,121 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 93. [2025-01-09 04:02:14,190 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 04:02:14,190 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 04:02:14,190 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 04:02:14,191 INFO L158 Benchmark]: Toolchain (without parser) took 3718.45ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 105.8MB in the beginning and 212.3MB in the end (delta: -106.5MB). Peak memory consumption was 85.5MB. Max. memory is 16.1GB. [2025-01-09 04:02:14,191 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:02:14,191 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.51ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 87.6MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 04:02:14,192 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.34ms. Allocated memory is still 142.6MB. Free memory was 87.6MB in the beginning and 85.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:02:14,192 INFO L158 Benchmark]: Boogie Preprocessor took 25.80ms. Allocated memory is still 142.6MB. Free memory was 85.6MB in the beginning and 84.1MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 04:02:14,192 INFO L158 Benchmark]: RCFGBuilder took 396.89ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 68.1MB in the end (delta: 16.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 04:02:14,192 INFO L158 Benchmark]: TraceAbstraction took 2851.88ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 67.3MB in the beginning and 225.8MB in the end (delta: -158.5MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. [2025-01-09 04:02:14,192 INFO L158 Benchmark]: Witness Printer took 137.20ms. Allocated memory is still 335.5MB. Free memory was 225.8MB in the beginning and 212.3MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 04:02:14,193 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.20ms. Allocated memory is still 201.3MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 275.51ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 87.6MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.34ms. Allocated memory is still 142.6MB. Free memory was 87.6MB in the beginning and 85.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.80ms. Allocated memory is still 142.6MB. Free memory was 85.6MB in the beginning and 84.1MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 396.89ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 68.1MB in the end (delta: 16.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2851.88ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 67.3MB in the beginning and 225.8MB in the end (delta: -158.5MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. * Witness Printer took 137.20ms. Allocated memory is still 335.5MB. Free memory was 225.8MB in the beginning and 212.3MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 49]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [49] - GenericResultAtLocation [Line: 87]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [87] - GenericResultAtLocation [Line: 156]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [156] - GenericResultAtLocation [Line: 343]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [343] - GenericResultAtLocation [Line: 439]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [439] - GenericResultAtLocation [Line: 448]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [448] - GenericResultAtLocation [Line: 543]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [543] - GenericResultAtLocation [Line: 909]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [909] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 444]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L165] int pumpRunning = 0; [L166] int systemActive = 1; [L344] int cleanupTimeShifts = 4; [L450] int waterLevel = 1; [L451] int methaneLevelCritical = 0; [L713] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L417] int retValue_acc ; [L418] int tmp ; [L422] FCALL select_helpers() [L423] FCALL select_features() [L424] CALL, EXPR valid_product() [L79] int retValue_acc ; [L82] retValue_acc = 1 [L83] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L424] RET, EXPR valid_product() [L424] tmp = valid_product() [L426] COND TRUE \read(tmp) [L428] FCALL setup() [L429] CALL runTest() [L411] CALL test() [L93] int splverifierCounter ; [L94] int tmp ; [L95] int tmp___0 ; [L96] int tmp___1 ; [L97] int tmp___2 ; [L100] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L104] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L110] tmp = __VERIFIER_nondet_int() [L112] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L114] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L468] COND TRUE waterLevel < 2 [L469] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L114] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L120] tmp___0 = __VERIFIER_nondet_int() [L122] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L130] tmp___2 = __VERIFIER_nondet_int() [L132] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L145] CALL timeShift() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L173] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L180] COND TRUE \read(systemActive) [L182] CALL processEnvironment() [L228] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L231] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L246] CALL processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L202] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L205] COND TRUE ! pumpRunning [L207] CALL, EXPR isHighWaterLevel() [L325] int retValue_acc ; [L326] int tmp ; [L327] int tmp___0 ; [L331] CALL, EXPR isHighWaterSensorDry() [L530] int retValue_acc ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L533] COND FALSE !(waterLevel < 2) [L537] retValue_acc = 0 [L538] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L331] RET, EXPR isHighWaterSensorDry() [L331] tmp = isHighWaterSensorDry() [L333] COND FALSE !(\read(tmp)) [L336] tmp___0 = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, tmp___0=1, waterLevel=2] [L338] retValue_acc = tmp___0 [L339] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L207] RET, EXPR isHighWaterLevel() [L207] tmp = isHighWaterLevel() [L209] COND TRUE \read(tmp) [L211] CALL activatePump() [L256] pumpRunning = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L211] RET activatePump() [L246] RET processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L182] RET processEnvironment() [L188] CALL __utac_acc__Specification4_spec__1() [L911] int tmp ; [L912] int tmp___0 ; [L916] CALL, EXPR getWaterLevel() [L521] int retValue_acc ; [L524] retValue_acc = waterLevel [L525] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L916] RET, EXPR getWaterLevel() [L916] tmp = getWaterLevel() [L918] COND FALSE !(tmp == 0) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L188] RET __utac_acc__Specification4_spec__1() [L145] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L104] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L110] tmp = __VERIFIER_nondet_int() [L112] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L120] tmp___0 = __VERIFIER_nondet_int() [L122] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L130] tmp___2 = __VERIFIER_nondet_int() [L132] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=2] [L145] CALL timeShift() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=2] [L173] COND TRUE \read(pumpRunning) [L175] CALL lowerWaterLevel() [L456] COND TRUE waterLevel > 0 [L457] waterLevel = waterLevel - 1 VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L175] RET lowerWaterLevel() [L180] COND TRUE \read(systemActive) [L182] CALL processEnvironment() [L228] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L231] COND TRUE \read(pumpRunning) [L233] CALL, EXPR isMethaneAlarm() [L269] int retValue_acc ; [L273] CALL, EXPR isMethaneLevelCritical() [L489] int retValue_acc ; [L492] retValue_acc = methaneLevelCritical [L493] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L273] RET, EXPR isMethaneLevelCritical() [L273] retValue_acc = isMethaneLevelCritical() [L275] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L233] RET, EXPR isMethaneAlarm() [L233] tmp = isMethaneAlarm() [L235] COND FALSE !(\read(tmp)) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L241] CALL processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L202] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L205] COND FALSE !(! pumpRunning) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L220] FCALL processEnvironment__wrappee__base() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L241] RET processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L182] RET processEnvironment() [L188] CALL __utac_acc__Specification4_spec__1() [L911] int tmp ; [L912] int tmp___0 ; [L916] CALL, EXPR getWaterLevel() [L521] int retValue_acc ; [L524] retValue_acc = waterLevel [L525] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L916] RET, EXPR getWaterLevel() [L916] tmp = getWaterLevel() [L918] COND FALSE !(tmp == 0) VAL [\old(pumpRunning)=1, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L188] RET __utac_acc__Specification4_spec__1() [L145] RET timeShift() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L104] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L110] tmp = __VERIFIER_nondet_int() [L112] COND FALSE !(\read(tmp)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L120] tmp___0 = __VERIFIER_nondet_int() [L122] COND FALSE !(\read(tmp___0)) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L130] tmp___2 = __VERIFIER_nondet_int() [L132] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, splverifierCounter=0, systemActive=1, waterLevel=1] [L145] CALL timeShift() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=1] [L173] COND TRUE \read(pumpRunning) [L175] CALL lowerWaterLevel() [L456] COND TRUE waterLevel > 0 [L457] waterLevel = waterLevel - 1 VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L175] RET lowerWaterLevel() [L180] COND TRUE \read(systemActive) [L182] CALL processEnvironment() [L228] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L231] COND TRUE \read(pumpRunning) [L233] CALL, EXPR isMethaneAlarm() [L269] int retValue_acc ; [L273] CALL, EXPR isMethaneLevelCritical() [L489] int retValue_acc ; [L492] retValue_acc = methaneLevelCritical [L493] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=1, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L273] RET, EXPR isMethaneLevelCritical() [L273] retValue_acc = isMethaneLevelCritical() [L275] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=1, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L233] RET, EXPR isMethaneAlarm() [L233] tmp = isMethaneAlarm() [L235] COND FALSE !(\read(tmp)) VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L241] CALL processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L202] int tmp ; VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L205] COND FALSE !(! pumpRunning) VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L220] FCALL processEnvironment__wrappee__base() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L241] RET processEnvironment__wrappee__highWaterSensor() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L182] RET processEnvironment() [L188] CALL __utac_acc__Specification4_spec__1() [L911] int tmp ; [L912] int tmp___0 ; [L916] CALL, EXPR getWaterLevel() [L521] int retValue_acc ; [L524] retValue_acc = waterLevel [L525] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=1, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L916] RET, EXPR getWaterLevel() [L916] tmp = getWaterLevel() [L918] COND TRUE tmp == 0 [L920] CALL, EXPR isPumpRunning() [L280] int retValue_acc ; [L283] retValue_acc = pumpRunning [L284] return (retValue_acc); VAL [\old(pumpRunning)=1, \old(waterLevel)=1, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] [L920] RET, EXPR isPumpRunning() [L920] tmp___0 = isPumpRunning() [L922] COND TRUE \read(tmp___0) [L924] CALL __automaton_fail() [L444] reach_error() VAL [\old(pumpRunning)=1, \old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=1, systemActive=1, waterLevel=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 11, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 506 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 500 mSDsluCounter, 2779 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1892 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 361 IncrementalHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 887 mSDtfsCounter, 361 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 213 GetRequests, 164 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=393occurred in iteration=10, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 57 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 552 NumberOfCodeBlocks, 552 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 509 ConstructedInterpolants, 0 QuantifiedInterpolants, 970 SizeOfPredicates, 2 NumberOfNonLiveVariables, 258 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 39/57 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-09 04:02:14,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE