./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec1_product35.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_spec1_product35.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 d8d5749cb33f10edd647435755bf2e2192f6038b258c1bda289ea3f61ba8ee50 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:59:33,536 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:59:33,580 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:59:33,584 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:59:33,584 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:59:33,600 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:59:33,600 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:59:33,600 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:59:33,601 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:59:33,601 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:59:33,601 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:59:33,601 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:59:33,601 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:59:33,601 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:59:33,601 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:59:33,602 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:59:33,602 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:59:33,602 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:59:33,602 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:59:33,602 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:59:33,602 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:59:33,602 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:59:33,602 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:59:33,602 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:59:33,602 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:59:33,602 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:59:33,603 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:59:33,603 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:59:33,603 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:59:33,603 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:59:33,603 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:59:33,603 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:59:33,603 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:59:33,603 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:59:33,603 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:59:33,603 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:59:33,603 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:59:33,604 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:59:33,604 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:59:33,604 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:59:33,604 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:59:33,604 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:59:33,604 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:59:33,604 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:59:33,604 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:59:33,604 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:59:33,604 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:59:33,604 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:59:33,604 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 -> d8d5749cb33f10edd647435755bf2e2192f6038b258c1bda289ea3f61ba8ee50 [2025-01-09 03:59:33,859 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:59:33,868 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:59:33,871 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:59:33,872 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:59:33,873 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:59:33,874 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec1_product35.cil.c [2025-01-09 03:59:35,298 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/45de1b389/f2918509c9ab4725b6d181bcf7d255a3/FLAGb13c33682 [2025-01-09 03:59:35,592 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:59:35,594 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec1_product35.cil.c [2025-01-09 03:59:35,604 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/45de1b389/f2918509c9ab4725b6d181bcf7d255a3/FLAGb13c33682 [2025-01-09 03:59:35,616 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/45de1b389/f2918509c9ab4725b6d181bcf7d255a3 [2025-01-09 03:59:35,617 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:59:35,618 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:59:35,621 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:59:35,621 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:59:35,629 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:59:35,630 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:59:35" (1/1) ... [2025-01-09 03:59:35,631 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c7dc90d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:35, skipping insertion in model container [2025-01-09 03:59:35,631 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:59:35" (1/1) ... [2025-01-09 03:59:35,662 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:59:35,757 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_spec1_product35.cil.c[3064,3077] [2025-01-09 03:59:35,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:59:35,808 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:59:35,813 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [49] [2025-01-09 03:59:35,814 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [150] [2025-01-09 03:59:35,814 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [159] [2025-01-09 03:59:35,814 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [186] [2025-01-09 03:59:35,815 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [256] [2025-01-09 03:59:35,815 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [426] [2025-01-09 03:59:35,815 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [464] [2025-01-09 03:59:35,815 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [560] [2025-01-09 03:59:35,820 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_spec1_product35.cil.c[3064,3077] [2025-01-09 03:59:35,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:59:35,858 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:59:35,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:35 WrapperNode [2025-01-09 03:59:35,859 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:59:35,860 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:59:35,860 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:59:35,860 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:59:35,863 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:35" (1/1) ... [2025-01-09 03:59:35,869 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:35" (1/1) ... [2025-01-09 03:59:35,881 INFO L138 Inliner]: procedures = 53, calls = 95, calls flagged for inlining = 21, calls inlined = 18, statements flattened = 168 [2025-01-09 03:59:35,881 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:59:35,882 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:59:35,882 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:59:35,882 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:59:35,891 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:35" (1/1) ... [2025-01-09 03:59:35,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:35" (1/1) ... [2025-01-09 03:59:35,892 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:35" (1/1) ... [2025-01-09 03:59:35,899 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 03:59:35,899 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:35" (1/1) ... [2025-01-09 03:59:35,899 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:35" (1/1) ... [2025-01-09 03:59:35,902 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:35" (1/1) ... [2025-01-09 03:59:35,902 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:35" (1/1) ... [2025-01-09 03:59:35,905 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:35" (1/1) ... [2025-01-09 03:59:35,905 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:35" (1/1) ... [2025-01-09 03:59:35,906 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:35" (1/1) ... [2025-01-09 03:59:35,907 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:59:35,907 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:59:35,908 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:59:35,908 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:59:35,910 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:35" (1/1) ... [2025-01-09 03:59:35,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:59:35,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:59:35,932 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 03:59:35,934 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 03:59:35,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:59:35,969 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2025-01-09 03:59:35,969 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2025-01-09 03:59:35,969 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-01-09 03:59:35,969 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-01-09 03:59:35,969 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-01-09 03:59:35,969 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-01-09 03:59:35,969 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2025-01-09 03:59:35,969 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2025-01-09 03:59:35,969 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2025-01-09 03:59:35,969 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2025-01-09 03:59:35,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:59:35,969 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2025-01-09 03:59:35,969 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2025-01-09 03:59:35,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:59:35,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:59:36,052 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:59:36,053 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:59:36,330 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2025-01-09 03:59:36,330 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:59:36,349 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:59:36,349 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 03:59:36,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:59:36 BoogieIcfgContainer [2025-01-09 03:59:36,349 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:59:36,351 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:59:36,351 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:59:36,358 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:59:36,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:59:35" (1/3) ... [2025-01-09 03:59:36,362 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67bea24b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:59:36, skipping insertion in model container [2025-01-09 03:59:36,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:59:35" (2/3) ... [2025-01-09 03:59:36,362 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67bea24b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:59:36, skipping insertion in model container [2025-01-09 03:59:36,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:59:36" (3/3) ... [2025-01-09 03:59:36,363 INFO L128 eAbstractionObserver]: Analyzing ICFG minepump_spec1_product35.cil.c [2025-01-09 03:59:36,382 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:59:36,384 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG minepump_spec1_product35.cil.c that has 7 procedures, 76 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 03:59:36,464 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:59:36,478 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;@1aabb821, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:59:36,478 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:59:36,485 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 65 states have internal predecessors, (81), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 03:59:36,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 03:59:36,499 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:59:36,500 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 03:59:36,504 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:59:36,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:59:36,513 INFO L85 PathProgramCache]: Analyzing trace with hash -51827797, now seen corresponding path program 1 times [2025-01-09 03:59:36,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:59:36,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039800302] [2025-01-09 03:59:36,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:59:36,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:59:36,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 03:59:36,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 03:59:36,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:59:36,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:59:36,786 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 03:59:36,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:59:36,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039800302] [2025-01-09 03:59:36,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039800302] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:59:36,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:59:36,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:59:36,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887877725] [2025-01-09 03:59:36,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:59:36,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:59:36,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:59:36,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:59:36,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:59:36,809 INFO L87 Difference]: Start difference. First operand has 76 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 65 states have internal predecessors, (81), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 03:59:36,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:59:36,827 INFO L93 Difference]: Finished difference Result 132 states and 174 transitions. [2025-01-09 03:59:36,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:59:36,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-01-09 03:59:36,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:59:36,833 INFO L225 Difference]: With dead ends: 132 [2025-01-09 03:59:36,833 INFO L226 Difference]: Without dead ends: 59 [2025-01-09 03:59:36,835 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 03:59:36,837 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 17 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 136 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 03:59:36,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 136 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:59:36,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-01-09 03:59:36,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-01-09 03:59:36,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 52 states have internal predecessors, (63), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 03:59:36,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 75 transitions. [2025-01-09 03:59:36,879 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 75 transitions. Word has length 23 [2025-01-09 03:59:36,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:59:36,883 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 75 transitions. [2025-01-09 03:59:36,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 03:59:36,883 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 75 transitions. [2025-01-09 03:59:36,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 03:59:36,884 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:59:36,884 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] [2025-01-09 03:59:36,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 03:59:36,884 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:59:36,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:59:36,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1192036895, now seen corresponding path program 1 times [2025-01-09 03:59:36,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:59:36,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243168292] [2025-01-09 03:59:36,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:59:36,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:59:36,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 03:59:36,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 03:59:36,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:59:36,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:59:36,963 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 03:59:36,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:59:36,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243168292] [2025-01-09 03:59:36,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243168292] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:59:36,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:59:36,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:59:36,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559019932] [2025-01-09 03:59:36,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:59:36,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:59:36,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:59:36,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:59:36,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:59:36,965 INFO L87 Difference]: Start difference. First operand 59 states and 75 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 03:59:36,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:59:36,993 INFO L93 Difference]: Finished difference Result 162 states and 211 transitions. [2025-01-09 03:59:36,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:59:36,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-01-09 03:59:36,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:59:36,998 INFO L225 Difference]: With dead ends: 162 [2025-01-09 03:59:36,998 INFO L226 Difference]: Without dead ends: 110 [2025-01-09 03:59:36,999 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 03:59:36,999 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 56 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:59:36,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 154 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:59:37,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-01-09 03:59:37,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 105. [2025-01-09 03:59:37,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 82 states have (on average 1.3658536585365855) internal successors, (112), 91 states have internal predecessors, (112), 12 states have call successors, (12), 10 states have call predecessors, (12), 10 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 03:59:37,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 136 transitions. [2025-01-09 03:59:37,046 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 136 transitions. Word has length 27 [2025-01-09 03:59:37,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:59:37,046 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 136 transitions. [2025-01-09 03:59:37,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 03:59:37,046 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 136 transitions. [2025-01-09 03:59:37,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 03:59:37,049 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:59:37,049 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] [2025-01-09 03:59:37,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 03:59:37,050 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:59:37,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:59:37,050 INFO L85 PathProgramCache]: Analyzing trace with hash -746360172, now seen corresponding path program 1 times [2025-01-09 03:59:37,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:59:37,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872626299] [2025-01-09 03:59:37,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:59:37,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:59:37,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 03:59:37,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 03:59:37,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:59:37,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:59:37,116 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 03:59:37,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:59:37,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872626299] [2025-01-09 03:59:37,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872626299] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:59:37,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:59:37,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:59:37,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477821010] [2025-01-09 03:59:37,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:59:37,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:59:37,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:59:37,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:59:37,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:59:37,118 INFO L87 Difference]: Start difference. First operand 105 states and 136 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 03:59:37,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:59:37,175 INFO L93 Difference]: Finished difference Result 276 states and 365 transitions. [2025-01-09 03:59:37,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:59:37,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2025-01-09 03:59:37,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:59:37,181 INFO L225 Difference]: With dead ends: 276 [2025-01-09 03:59:37,181 INFO L226 Difference]: Without dead ends: 178 [2025-01-09 03:59:37,182 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 03:59:37,185 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 63 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:59:37,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 119 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:59:37,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-01-09 03:59:37,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 176. [2025-01-09 03:59:37,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 135 states have (on average 1.348148148148148) internal successors, (182), 146 states have internal predecessors, (182), 20 states have call successors, (20), 20 states have call predecessors, (20), 20 states have return successors, (24), 20 states have call predecessors, (24), 20 states have call successors, (24) [2025-01-09 03:59:37,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 226 transitions. [2025-01-09 03:59:37,228 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 226 transitions. Word has length 32 [2025-01-09 03:59:37,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:59:37,228 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 226 transitions. [2025-01-09 03:59:37,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 03:59:37,229 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 226 transitions. [2025-01-09 03:59:37,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-09 03:59:37,229 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:59:37,230 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] [2025-01-09 03:59:37,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 03:59:37,230 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:59:37,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:59:37,230 INFO L85 PathProgramCache]: Analyzing trace with hash -2028119786, now seen corresponding path program 1 times [2025-01-09 03:59:37,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:59:37,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016636348] [2025-01-09 03:59:37,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:59:37,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:59:37,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 03:59:37,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 03:59:37,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:59:37,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:59:37,324 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 03:59:37,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:59:37,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016636348] [2025-01-09 03:59:37,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016636348] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:59:37,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:59:37,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:59:37,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592897128] [2025-01-09 03:59:37,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:59:37,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:59:37,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:59:37,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:59:37,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:59:37,326 INFO L87 Difference]: Start difference. First operand 176 states and 226 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 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 03:59:37,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:59:37,378 INFO L93 Difference]: Finished difference Result 178 states and 227 transitions. [2025-01-09 03:59:37,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:59:37,379 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 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 31 [2025-01-09 03:59:37,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:59:37,380 INFO L225 Difference]: With dead ends: 178 [2025-01-09 03:59:37,380 INFO L226 Difference]: Without dead ends: 176 [2025-01-09 03:59:37,381 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 03:59:37,381 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 58 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:59:37,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 254 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:59:37,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-01-09 03:59:37,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2025-01-09 03:59:37,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 135 states have (on average 1.3333333333333333) internal successors, (180), 146 states have internal predecessors, (180), 20 states have call successors, (20), 20 states have call predecessors, (20), 20 states have return successors, (24), 20 states have call predecessors, (24), 20 states have call successors, (24) [2025-01-09 03:59:37,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 224 transitions. [2025-01-09 03:59:37,393 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 224 transitions. Word has length 31 [2025-01-09 03:59:37,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:59:37,393 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 224 transitions. [2025-01-09 03:59:37,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 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 03:59:37,393 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 224 transitions. [2025-01-09 03:59:37,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 03:59:37,394 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:59:37,394 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] [2025-01-09 03:59:37,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 03:59:37,394 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:59:37,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:59:37,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1845086733, now seen corresponding path program 1 times [2025-01-09 03:59:37,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:59:37,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964092971] [2025-01-09 03:59:37,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:59:37,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:59:37,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 03:59:37,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 03:59:37,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:59:37,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:59:37,493 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 03:59:37,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:59:37,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964092971] [2025-01-09 03:59:37,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964092971] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:59:37,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:59:37,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:59:37,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102486679] [2025-01-09 03:59:37,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:59:37,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:59:37,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:59:37,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:59:37,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:59:37,494 INFO L87 Difference]: Start difference. First operand 176 states and 224 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 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 03:59:37,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:59:37,518 INFO L93 Difference]: Finished difference Result 351 states and 453 transitions. [2025-01-09 03:59:37,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:59:37,518 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 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 36 [2025-01-09 03:59:37,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:59:37,520 INFO L225 Difference]: With dead ends: 351 [2025-01-09 03:59:37,520 INFO L226 Difference]: Without dead ends: 182 [2025-01-09 03:59:37,521 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 03:59:37,521 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:59:37,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 281 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:59:37,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-01-09 03:59:37,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2025-01-09 03:59:37,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 141 states have (on average 1.3191489361702127) internal successors, (186), 152 states have internal predecessors, (186), 20 states have call successors, (20), 20 states have call predecessors, (20), 20 states have return successors, (24), 20 states have call predecessors, (24), 20 states have call successors, (24) [2025-01-09 03:59:37,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 230 transitions. [2025-01-09 03:59:37,532 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 230 transitions. Word has length 36 [2025-01-09 03:59:37,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:59:37,532 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 230 transitions. [2025-01-09 03:59:37,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 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 03:59:37,533 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 230 transitions. [2025-01-09 03:59:37,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 03:59:37,533 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:59:37,534 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] [2025-01-09 03:59:37,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 03:59:37,534 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:59:37,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:59:37,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1428812209, now seen corresponding path program 1 times [2025-01-09 03:59:37,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:59:37,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856337205] [2025-01-09 03:59:37,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:59:37,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:59:37,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 03:59:37,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 03:59:37,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:59:37,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:59:37,638 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 03:59:37,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:59:37,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856337205] [2025-01-09 03:59:37,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856337205] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:59:37,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:59:37,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:59:37,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383792303] [2025-01-09 03:59:37,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:59:37,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:59:37,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:59:37,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:59:37,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:59:37,642 INFO L87 Difference]: Start difference. First operand 182 states and 230 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 03:59:37,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:59:37,717 INFO L93 Difference]: Finished difference Result 367 states and 473 transitions. [2025-01-09 03:59:37,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:59:37,722 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2025-01-09 03:59:37,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:59:37,723 INFO L225 Difference]: With dead ends: 367 [2025-01-09 03:59:37,723 INFO L226 Difference]: Without dead ends: 192 [2025-01-09 03:59:37,724 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 03:59:37,724 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 58 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:59:37,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 312 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:59:37,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-01-09 03:59:37,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 186. [2025-01-09 03:59:37,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 145 states have (on average 1.3103448275862069) internal successors, (190), 156 states have internal predecessors, (190), 20 states have call successors, (20), 20 states have call predecessors, (20), 20 states have return successors, (24), 20 states have call predecessors, (24), 20 states have call successors, (24) [2025-01-09 03:59:37,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 234 transitions. [2025-01-09 03:59:37,738 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 234 transitions. Word has length 36 [2025-01-09 03:59:37,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:59:37,738 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 234 transitions. [2025-01-09 03:59:37,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 03:59:37,738 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 234 transitions. [2025-01-09 03:59:37,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 03:59:37,739 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:59:37,739 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] [2025-01-09 03:59:37,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:59:37,739 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:59:37,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:59:37,740 INFO L85 PathProgramCache]: Analyzing trace with hash -565332497, now seen corresponding path program 1 times [2025-01-09 03:59:37,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:59:37,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589134839] [2025-01-09 03:59:37,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:59:37,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:59:37,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 03:59:37,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 03:59:37,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:59:37,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:59:37,781 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 03:59:37,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:59:37,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589134839] [2025-01-09 03:59:37,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589134839] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:59:37,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:59:37,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:59:37,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582169354] [2025-01-09 03:59:37,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:59:37,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:59:37,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:59:37,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:59:37,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:59:37,783 INFO L87 Difference]: Start difference. First operand 186 states and 234 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 03:59:37,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:59:37,806 INFO L93 Difference]: Finished difference Result 448 states and 569 transitions. [2025-01-09 03:59:37,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:59:37,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2025-01-09 03:59:37,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:59:37,809 INFO L225 Difference]: With dead ends: 448 [2025-01-09 03:59:37,809 INFO L226 Difference]: Without dead ends: 269 [2025-01-09 03:59:37,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:59:37,810 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 38 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:59:37,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 135 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:59:37,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-01-09 03:59:37,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2025-01-09 03:59:37,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 210 states have (on average 1.276190476190476) internal successors, (268), 223 states have internal predecessors, (268), 30 states have call successors, (30), 30 states have call predecessors, (30), 28 states have return successors, (34), 28 states have call predecessors, (34), 30 states have call successors, (34) [2025-01-09 03:59:37,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 332 transitions. [2025-01-09 03:59:37,825 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 332 transitions. Word has length 36 [2025-01-09 03:59:37,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:59:37,825 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 332 transitions. [2025-01-09 03:59:37,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 03:59:37,826 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 332 transitions. [2025-01-09 03:59:37,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-09 03:59:37,827 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:59:37,827 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] [2025-01-09 03:59:37,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:59:37,827 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:59:37,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:59:37,828 INFO L85 PathProgramCache]: Analyzing trace with hash -345349623, now seen corresponding path program 1 times [2025-01-09 03:59:37,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:59:37,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979352512] [2025-01-09 03:59:37,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:59:37,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:59:37,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 03:59:37,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 03:59:37,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:59:37,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:59:37,905 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 03:59:37,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:59:37,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979352512] [2025-01-09 03:59:37,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979352512] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:59:37,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:59:37,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:59:37,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071334062] [2025-01-09 03:59:37,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:59:37,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:59:37,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:59:37,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:59:37,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:59:37,907 INFO L87 Difference]: Start difference. First operand 269 states and 332 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (3), 2 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 03:59:38,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:59:38,035 INFO L93 Difference]: Finished difference Result 779 states and 989 transitions. [2025-01-09 03:59:38,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:59:38,037 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (3), 2 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 40 [2025-01-09 03:59:38,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:59:38,044 INFO L225 Difference]: With dead ends: 779 [2025-01-09 03:59:38,045 INFO L226 Difference]: Without dead ends: 517 [2025-01-09 03:59:38,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:59:38,048 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 40 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:59:38,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 332 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:59:38,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-01-09 03:59:38,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 517. [2025-01-09 03:59:38,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 400 states have (on average 1.255) internal successors, (502), 425 states have internal predecessors, (502), 60 states have call successors, (60), 60 states have call predecessors, (60), 56 states have return successors, (74), 56 states have call predecessors, (74), 60 states have call successors, (74) [2025-01-09 03:59:38,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 636 transitions. [2025-01-09 03:59:38,100 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 636 transitions. Word has length 40 [2025-01-09 03:59:38,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:59:38,100 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 636 transitions. [2025-01-09 03:59:38,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (3), 2 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 03:59:38,101 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 636 transitions. [2025-01-09 03:59:38,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 03:59:38,103 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:59:38,103 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:59:38,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:59:38,103 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:59:38,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:59:38,103 INFO L85 PathProgramCache]: Analyzing trace with hash -324279739, now seen corresponding path program 1 times [2025-01-09 03:59:38,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:59:38,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706337977] [2025-01-09 03:59:38,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:59:38,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:59:38,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 03:59:38,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 03:59:38,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:59:38,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 03:59:38,117 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 03:59:38,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 03:59:38,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 03:59:38,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:59:38,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 03:59:38,139 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 03:59:38,140 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 03:59:38,140 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 03:59:38,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:59:38,143 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:59:38,184 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 03:59:38,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:59:38 BoogieIcfgContainer [2025-01-09 03:59:38,186 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 03:59:38,186 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 03:59:38,186 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 03:59:38,187 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 03:59:38,187 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:59:36" (3/4) ... [2025-01-09 03:59:38,188 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 03:59:38,245 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 39. [2025-01-09 03:59:38,310 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 03:59:38,310 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 03:59:38,310 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 03:59:38,310 INFO L158 Benchmark]: Toolchain (without parser) took 2692.01ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 93.2MB in the end (delta: 19.1MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2025-01-09 03:59:38,310 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 03:59:38,311 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.66ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 93.8MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 03:59:38,311 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.55ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 92.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 03:59:38,311 INFO L158 Benchmark]: Boogie Preprocessor took 25.45ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 90.7MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 03:59:38,311 INFO L158 Benchmark]: RCFGBuilder took 441.77ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 74.8MB in the end (delta: 15.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 03:59:38,311 INFO L158 Benchmark]: TraceAbstraction took 1835.38ms. Allocated memory is still 142.6MB. Free memory was 74.3MB in the beginning and 101.6MB in the end (delta: -27.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 03:59:38,311 INFO L158 Benchmark]: Witness Printer took 123.49ms. Allocated memory is still 142.6MB. Free memory was 101.6MB in the beginning and 93.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 03:59:38,312 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.21ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 238.66ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 93.8MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.55ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 92.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.45ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 90.7MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 441.77ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 74.8MB in the end (delta: 15.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1835.38ms. Allocated memory is still 142.6MB. Free memory was 74.3MB in the beginning and 101.6MB in the end (delta: -27.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 123.49ms. Allocated memory is still 142.6MB. Free memory was 101.6MB in the beginning and 93.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. 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,"Environment.i","") [49] - GenericResultAtLocation [Line: 150]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [150] - GenericResultAtLocation [Line: 159]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [159] - GenericResultAtLocation [Line: 186]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [186] - GenericResultAtLocation [Line: 256]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [256] - GenericResultAtLocation [Line: 426]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [426] - GenericResultAtLocation [Line: 464]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [464] - GenericResultAtLocation [Line: 560]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [560] * 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: 155]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L57] int waterLevel = 1; [L58] int methaneLevelCritical = 0; [L260] int pumpRunning = 0; [L261] int systemActive = 1; [L465] int cleanupTimeShifts = 4; [L730] static struct __ACC__ERR *head = (struct __ACC__ERR *)0; VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L538] int retValue_acc ; [L539] int tmp ; [L543] FCALL select_helpers() [L544] FCALL select_features() [L545] CALL, EXPR valid_product() [L456] int retValue_acc ; [L459] retValue_acc = 1 [L460] return (retValue_acc); VAL [\result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L545] RET, EXPR valid_product() [L545] tmp = valid_product() [L547] COND TRUE \read(tmp) [L549] FCALL setup() [L550] CALL runTest() [L532] CALL test() [L191] int splverifierCounter ; [L192] int tmp ; [L193] int tmp___0 ; [L194] int tmp___1 ; [L195] int tmp___2 ; [L198] splverifierCounter = 0 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L202] COND TRUE splverifierCounter < 4 VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L208] tmp = __VERIFIER_nondet_int() [L210] COND TRUE \read(tmp) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=1] [L212] CALL waterRise() VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=1] [L75] COND TRUE waterLevel < 2 [L76] waterLevel = waterLevel + 1 VAL [\old(waterLevel)=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L212] RET waterRise() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L218] tmp___0 = __VERIFIER_nondet_int() [L220] COND TRUE \read(tmp___0) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L222] CALL changeMethaneLevel() VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=0, pumpRunning=0, systemActive=1, waterLevel=2] [L87] COND FALSE !(\read(methaneLevelCritical)) [L90] methaneLevelCritical = 1 VAL [\old(methaneLevelCritical)=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L222] RET changeMethaneLevel() VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L228] tmp___2 = __VERIFIER_nondet_int() [L230] COND TRUE \read(tmp___2) VAL [cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, splverifierCounter=0, systemActive=1, waterLevel=2] [L245] CALL timeShift() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L267] COND FALSE !(\read(pumpRunning)) VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L274] COND TRUE \read(systemActive) [L276] CALL processEnvironment() [L296] int tmp ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L299] COND TRUE ! pumpRunning [L301] CALL, EXPR isHighWaterLevel() [L393] int retValue_acc ; [L394] int tmp ; [L395] int tmp___0 ; [L399] CALL, EXPR isHighWaterSensorDry() [L137] int retValue_acc ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L140] COND FALSE !(waterLevel < 2) [L144] retValue_acc = 0 [L145] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=0, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L399] RET, EXPR isHighWaterSensorDry() [L399] tmp = isHighWaterSensorDry() [L401] COND FALSE !(\read(tmp)) [L404] tmp___0 = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, tmp___0=1, waterLevel=2] [L406] retValue_acc = tmp___0 [L407] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=0, systemActive=1, waterLevel=2] [L301] RET, EXPR isHighWaterLevel() [L301] tmp = isHighWaterLevel() [L303] COND TRUE \read(tmp) [L305] CALL activatePump() [L324] pumpRunning = 1 VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L305] RET activatePump() [L276] RET processEnvironment() [L282] CALL __utac_acc__Specification1_spec__1() [L162] int tmp ; [L163] int tmp___0 ; VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L167] CALL, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L96] int retValue_acc ; [L99] retValue_acc = methaneLevelCritical [L100] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L167] RET, EXPR isMethaneLevelCritical() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L167] tmp = isMethaneLevelCritical() [L169] COND TRUE \read(tmp) [L171] CALL, EXPR isPumpRunning() [L348] int retValue_acc ; [L351] retValue_acc = pumpRunning [L352] return (retValue_acc); VAL [\old(pumpRunning)=0, \old(waterLevel)=2, \result=1, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] [L171] RET, EXPR isPumpRunning() [L171] tmp___0 = isPumpRunning() [L173] COND TRUE \read(tmp___0) [L175] CALL __automaton_fail() [L155] reach_error() VAL [\old(pumpRunning)=0, \old(waterLevel)=2, cleanupTimeShifts=4, head={0:0}, methaneLevelCritical=1, pumpRunning=1, systemActive=1, waterLevel=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 334 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 330 mSDsluCounter, 1723 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1111 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 122 IncrementalHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 612 mSDtfsCounter, 122 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=517occurred in iteration=8, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 13 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 305 NumberOfCodeBlocks, 305 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 253 ConstructedInterpolants, 0 QuantifiedInterpolants, 459 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 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 03:59:38,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE