./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec4_product55.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec4_product55.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 1741a5d4e19b6faba6ff51056891b76c8b4c0acd4f550f71706571820842dcfa --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:02:22,618 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:02:22,701 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:02:22,707 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:02:22,707 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:02:22,733 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:02:22,734 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:02:22,734 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:02:22,735 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:02:22,735 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:02:22,735 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:02:22,735 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:02:22,735 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:02:22,735 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:02:22,735 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:02:22,735 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:02:22,736 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:02:22,736 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:02:22,736 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:02:22,736 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:02:22,736 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:02:22,736 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:02:22,736 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:02:22,736 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:02:22,736 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:02:22,736 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:02:22,736 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:02:22,738 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:02:22,738 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:02:22,738 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:02:22,739 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:02:22,739 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:02:22,739 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:02:22,739 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:02:22,739 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:02:22,740 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:02:22,740 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:02:22,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:02:22,740 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:02:22,740 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:02:22,740 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:02:22,740 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:02:22,740 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:02:22,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:02:22,741 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:02:22,741 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:02:22,741 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:02:22,741 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:02:22,741 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 -> 1741a5d4e19b6faba6ff51056891b76c8b4c0acd4f550f71706571820842dcfa [2025-01-09 04:02:23,023 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:02:23,035 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:02:23,037 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:02:23,039 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:02:23,039 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:02:23,040 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec4_product55.cil.c [2025-01-09 04:02:24,392 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/21b7aa27a/f5f85e08fa1e4ac19a4a1da6cb4218ec/FLAG3fca154c6 [2025-01-09 04:02:24,684 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:02:24,684 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product55.cil.c [2025-01-09 04:02:24,702 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/21b7aa27a/f5f85e08fa1e4ac19a4a1da6cb4218ec/FLAG3fca154c6 [2025-01-09 04:02:24,958 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/21b7aa27a/f5f85e08fa1e4ac19a4a1da6cb4218ec [2025-01-09 04:02:24,961 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:02:24,963 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:02:24,966 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:02:24,966 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:02:24,971 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:02:24,973 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:02:24" (1/1) ... [2025-01-09 04:02:24,974 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@795d9f19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:24, skipping insertion in model container [2025-01-09 04:02:24,974 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:02:24" (1/1) ... [2025-01-09 04:02:25,003 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:02:25,216 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product55.cil.c[6887,6900] [2025-01-09 04:02:25,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:02:25,310 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:02:25,317 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [49] [2025-01-09 04:02:25,319 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [121] [2025-01-09 04:02:25,319 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [369] [2025-01-09 04:02:25,319 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [397] [2025-01-09 04:02:25,319 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [435] [2025-01-09 04:02:25,319 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [444] [2025-01-09 04:02:25,319 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [540] [2025-01-09 04:02:25,319 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [906] [2025-01-09 04:02:25,332 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec4_product55.cil.c[6887,6900] [2025-01-09 04:02:25,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:02:25,413 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:02:25,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:25 WrapperNode [2025-01-09 04:02:25,416 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:02:25,417 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:02:25,418 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:02:25,418 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:02:25,425 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:25" (1/1) ... [2025-01-09 04:02:25,441 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:25" (1/1) ... [2025-01-09 04:02:25,473 INFO L138 Inliner]: procedures = 57, calls = 104, calls flagged for inlining = 25, calls inlined = 22, statements flattened = 230 [2025-01-09 04:02:25,475 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:02:25,475 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:02:25,475 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:02:25,475 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:02:25,484 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:25" (1/1) ... [2025-01-09 04:02:25,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:25" (1/1) ... [2025-01-09 04:02:25,488 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:25" (1/1) ... [2025-01-09 04:02:25,507 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 04:02:25,513 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:25" (1/1) ... [2025-01-09 04:02:25,513 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:25" (1/1) ... [2025-01-09 04:02:25,519 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:25" (1/1) ... [2025-01-09 04:02:25,522 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:25" (1/1) ... [2025-01-09 04:02:25,527 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:25" (1/1) ... [2025-01-09 04:02:25,529 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:25" (1/1) ... [2025-01-09 04:02:25,530 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:25" (1/1) ... [2025-01-09 04:02:25,536 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:02:25,537 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:02:25,537 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:02:25,537 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:02:25,538 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:25" (1/1) ... [2025-01-09 04:02:25,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:02:25,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:02:25,577 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 04:02:25,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 04:02:25,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:02:25,607 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2025-01-09 04:02:25,608 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2025-01-09 04:02:25,608 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-01-09 04:02:25,608 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-01-09 04:02:25,608 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-01-09 04:02:25,608 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-01-09 04:02:25,609 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2025-01-09 04:02:25,609 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2025-01-09 04:02:25,609 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2025-01-09 04:02:25,610 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2025-01-09 04:02:25,610 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__lowWaterSensor [2025-01-09 04:02:25,610 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__lowWaterSensor [2025-01-09 04:02:25,610 INFO L130 BoogieDeclarations]: Found specification of procedure deactivatePump [2025-01-09 04:02:25,610 INFO L138 BoogieDeclarations]: Found implementation of procedure deactivatePump [2025-01-09 04:02:25,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:02:25,611 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2025-01-09 04:02:25,611 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2025-01-09 04:02:25,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:02:25,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:02:25,683 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:02:25,685 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:02:26,002 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2025-01-09 04:02:26,002 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:02:26,018 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:02:26,019 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 04:02:26,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:02:26 BoogieIcfgContainer [2025-01-09 04:02:26,019 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:02:26,021 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:02:26,022 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:02:26,027 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:02:26,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:02:24" (1/3) ... [2025-01-09 04:02:26,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@498f04dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:02:26, skipping insertion in model container [2025-01-09 04:02:26,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:02:25" (2/3) ... [2025-01-09 04:02:26,029 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@498f04dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:02:26, skipping insertion in model container [2025-01-09 04:02:26,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:02:26" (3/3) ... [2025-01-09 04:02:26,030 INFO L128 eAbstractionObserver]: Analyzing ICFG minepump_spec4_product55.cil.c [2025-01-09 04:02:26,046 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:02:26,048 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG minepump_spec4_product55.cil.c that has 9 procedures, 97 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 04:02:26,108 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:02:26,117 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;@6a053b10, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:02:26,119 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:02:26,124 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 72 states have (on average 1.375) internal successors, (99), 83 states have internal predecessors, (99), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (15), 10 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 04:02:26,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 04:02:26,131 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:02:26,132 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:02:26,132 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:02:26,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:02:26,139 INFO L85 PathProgramCache]: Analyzing trace with hash -825385452, now seen corresponding path program 1 times [2025-01-09 04:02:26,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:02:26,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053544423] [2025-01-09 04:02:26,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:02:26,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:02:26,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 04:02:26,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 04:02:26,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:02:26,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:02:26,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:02:26,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:02:26,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053544423] [2025-01-09 04:02:26,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053544423] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:02:26,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:02:26,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 04:02:26,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003682959] [2025-01-09 04:02:26,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:02:26,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 04:02:26,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:02:26,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 04:02:26,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 04:02:26,330 INFO L87 Difference]: Start difference. First operand has 97 states, 72 states have (on average 1.375) internal successors, (99), 83 states have internal predecessors, (99), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (15), 10 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:02:26,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:02:26,354 INFO L93 Difference]: Finished difference Result 186 states and 253 transitions. [2025-01-09 04:02:26,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 04:02:26,356 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-01-09 04:02:26,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:02:26,364 INFO L225 Difference]: With dead ends: 186 [2025-01-09 04:02:26,365 INFO L226 Difference]: Without dead ends: 88 [2025-01-09 04:02:26,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 04:02:26,371 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:02:26,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:02:26,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-01-09 04:02:26,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-01-09 04:02:26,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 75 states have internal predecessors, (87), 15 states have call successors, (15), 8 states have call predecessors, (15), 7 states have return successors, (14), 9 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 04:02:26,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 116 transitions. [2025-01-09 04:02:26,409 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 116 transitions. Word has length 19 [2025-01-09 04:02:26,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:02:26,410 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 116 transitions. [2025-01-09 04:02:26,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:02:26,411 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 116 transitions. [2025-01-09 04:02:26,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 04:02:26,414 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:02:26,414 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:02:26,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:02:26,415 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:02:26,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:02:26,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1951892354, now seen corresponding path program 1 times [2025-01-09 04:02:26,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:02:26,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517102691] [2025-01-09 04:02:26,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:02:26,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:02:26,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 04:02:26,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 04:02:26,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:02:26,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:02:26,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:02:26,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:02:26,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517102691] [2025-01-09 04:02:26,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517102691] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:02:26,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:02:26,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:02:26,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145239534] [2025-01-09 04:02:26,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:02:26,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:02:26,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:02:26,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:02:26,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:02:26,549 INFO L87 Difference]: Start difference. First operand 88 states and 116 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:02:26,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:02:26,576 INFO L93 Difference]: Finished difference Result 140 states and 184 transitions. [2025-01-09 04:02:26,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:02:26,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-01-09 04:02:26,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:02:26,578 INFO L225 Difference]: With dead ends: 140 [2025-01-09 04:02:26,578 INFO L226 Difference]: Without dead ends: 80 [2025-01-09 04:02:26,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:02:26,580 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 16 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:02:26,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 188 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:02:26,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-01-09 04:02:26,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-01-09 04:02:26,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 60 states have (on average 1.35) internal successors, (81), 70 states have internal predecessors, (81), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (12), 7 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 04:02:26,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 105 transitions. [2025-01-09 04:02:26,592 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 105 transitions. Word has length 19 [2025-01-09 04:02:26,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:02:26,593 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 105 transitions. [2025-01-09 04:02:26,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:02:26,593 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 105 transitions. [2025-01-09 04:02:26,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 04:02:26,594 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:02:26,594 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:02:26,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:02:26,594 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:02:26,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:02:26,595 INFO L85 PathProgramCache]: Analyzing trace with hash -468487002, now seen corresponding path program 1 times [2025-01-09 04:02:26,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:02:26,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316086401] [2025-01-09 04:02:26,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:02:26,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:02:26,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 04:02:26,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 04:02:26,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:02:26,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:02:26,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:02:26,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:02:26,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316086401] [2025-01-09 04:02:26,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316086401] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:02:26,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:02:26,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:02:26,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256512032] [2025-01-09 04:02:26,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:02:26,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:02:26,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:02:26,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:02:26,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:02:26,731 INFO L87 Difference]: Start difference. First operand 80 states and 105 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:02:27,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:02:27,023 INFO L93 Difference]: Finished difference Result 262 states and 351 transitions. [2025-01-09 04:02:27,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:02:27,024 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-01-09 04:02:27,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:02:27,026 INFO L225 Difference]: With dead ends: 262 [2025-01-09 04:02:27,026 INFO L226 Difference]: Without dead ends: 189 [2025-01-09 04:02:27,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:02:27,027 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 238 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:02:27,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 434 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:02:27,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-01-09 04:02:27,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 183. [2025-01-09 04:02:27,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 136 states have (on average 1.3823529411764706) internal successors, (188), 158 states have internal predecessors, (188), 28 states have call successors, (28), 18 states have call predecessors, (28), 18 states have return successors, (29), 16 states have call predecessors, (29), 28 states have call successors, (29) [2025-01-09 04:02:27,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 245 transitions. [2025-01-09 04:02:27,065 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 245 transitions. Word has length 23 [2025-01-09 04:02:27,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:02:27,066 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 245 transitions. [2025-01-09 04:02:27,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:02:27,066 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 245 transitions. [2025-01-09 04:02:27,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 04:02:27,069 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:02:27,069 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 04:02:27,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:02:27,070 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:02:27,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:02:27,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1717744732, now seen corresponding path program 1 times [2025-01-09 04:02:27,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:02:27,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559774827] [2025-01-09 04:02:27,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:02:27,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:02:27,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 04:02:27,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 04:02:27,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:02:27,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:02:27,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:02:27,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:02:27,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559774827] [2025-01-09 04:02:27,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559774827] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:02:27,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:02:27,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:02:27,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7175673] [2025-01-09 04:02:27,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:02:27,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:02:27,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:02:27,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:02:27,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:02:27,246 INFO L87 Difference]: Start difference. First operand 183 states and 245 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:02:27,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:02:27,345 INFO L93 Difference]: Finished difference Result 518 states and 724 transitions. [2025-01-09 04:02:27,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:02:27,345 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-01-09 04:02:27,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:02:27,352 INFO L225 Difference]: With dead ends: 518 [2025-01-09 04:02:27,353 INFO L226 Difference]: Without dead ends: 342 [2025-01-09 04:02:27,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:02:27,356 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 71 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:02:27,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 382 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:02:27,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-01-09 04:02:27,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2025-01-09 04:02:27,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 252 states have (on average 1.3571428571428572) internal successors, (342), 292 states have internal predecessors, (342), 56 states have call successors, (56), 36 states have call predecessors, (56), 33 states have return successors, (62), 29 states have call predecessors, (62), 56 states have call successors, (62) [2025-01-09 04:02:27,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 460 transitions. [2025-01-09 04:02:27,417 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 460 transitions. Word has length 27 [2025-01-09 04:02:27,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:02:27,417 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 460 transitions. [2025-01-09 04:02:27,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:02:27,418 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 460 transitions. [2025-01-09 04:02:27,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 04:02:27,423 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:02:27,424 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:02:27,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:02:27,424 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:02:27,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:02:27,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1411151647, now seen corresponding path program 1 times [2025-01-09 04:02:27,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:02:27,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808833126] [2025-01-09 04:02:27,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:02:27,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:02:27,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 04:02:27,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 04:02:27,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:02:27,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:02:27,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:02:27,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:02:27,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808833126] [2025-01-09 04:02:27,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808833126] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:02:27,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:02:27,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 04:02:27,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552993456] [2025-01-09 04:02:27,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:02:27,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:02:27,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:02:27,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:02:27,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:02:27,505 INFO L87 Difference]: Start difference. First operand 342 states and 460 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:02:27,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:02:27,579 INFO L93 Difference]: Finished difference Result 778 states and 1077 transitions. [2025-01-09 04:02:27,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:02:27,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-01-09 04:02:27,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:02:27,589 INFO L225 Difference]: With dead ends: 778 [2025-01-09 04:02:27,589 INFO L226 Difference]: Without dead ends: 443 [2025-01-09 04:02:27,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:02:27,593 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 58 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:02:27,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 172 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:02:27,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2025-01-09 04:02:27,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 432. [2025-01-09 04:02:27,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 326 states have (on average 1.3006134969325154) internal successors, (424), 351 states have internal predecessors, (424), 55 states have call successors, (55), 51 states have call predecessors, (55), 50 states have return successors, (83), 49 states have call predecessors, (83), 55 states have call successors, (83) [2025-01-09 04:02:27,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 562 transitions. [2025-01-09 04:02:27,649 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 562 transitions. Word has length 29 [2025-01-09 04:02:27,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:02:27,649 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 562 transitions. [2025-01-09 04:02:27,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:02:27,650 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 562 transitions. [2025-01-09 04:02:27,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-09 04:02:27,651 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:02:27,651 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 04:02:27,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:02:27,651 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:02:27,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:02:27,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1929831298, now seen corresponding path program 1 times [2025-01-09 04:02:27,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:02:27,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465962038] [2025-01-09 04:02:27,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:02:27,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:02:27,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 04:02:27,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 04:02:27,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:02:27,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:02:27,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 04:02:27,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:02:27,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465962038] [2025-01-09 04:02:27,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465962038] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:02:27,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:02:27,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:02:27,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179745411] [2025-01-09 04:02:27,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:02:27,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:02:27,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:02:27,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:02:27,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:02:27,789 INFO L87 Difference]: Start difference. First operand 432 states and 562 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 04:02:27,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:02:27,876 INFO L93 Difference]: Finished difference Result 434 states and 563 transitions. [2025-01-09 04:02:27,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:02:27,879 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2025-01-09 04:02:27,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:02:27,883 INFO L225 Difference]: With dead ends: 434 [2025-01-09 04:02:27,883 INFO L226 Difference]: Without dead ends: 432 [2025-01-09 04:02:27,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:02:27,884 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 51 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:02:27,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 372 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:02:27,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2025-01-09 04:02:27,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2025-01-09 04:02:27,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 326 states have (on average 1.2914110429447854) internal successors, (421), 351 states have internal predecessors, (421), 55 states have call successors, (55), 51 states have call predecessors, (55), 50 states have return successors, (83), 49 states have call predecessors, (83), 55 states have call successors, (83) [2025-01-09 04:02:27,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 559 transitions. [2025-01-09 04:02:27,927 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 559 transitions. Word has length 31 [2025-01-09 04:02:27,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:02:27,928 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 559 transitions. [2025-01-09 04:02:27,928 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), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 04:02:27,928 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 559 transitions. [2025-01-09 04:02:27,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 04:02:27,931 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:02:27,931 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:02:27,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:02:27,931 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:02:27,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:02:27,932 INFO L85 PathProgramCache]: Analyzing trace with hash 638033330, now seen corresponding path program 1 times [2025-01-09 04:02:27,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:02:27,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176433079] [2025-01-09 04:02:27,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:02:27,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:02:27,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 04:02:27,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 04:02:27,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:02:27,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:02:28,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:02:28,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:02:28,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176433079] [2025-01-09 04:02:28,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176433079] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:02:28,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:02:28,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:02:28,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044782995] [2025-01-09 04:02:28,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:02:28,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:02:28,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:02:28,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:02:28,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:02:28,019 INFO L87 Difference]: Start difference. First operand 432 states and 559 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 04:02:28,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:02:28,070 INFO L93 Difference]: Finished difference Result 869 states and 1151 transitions. [2025-01-09 04:02:28,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:02:28,070 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2025-01-09 04:02:28,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:02:28,075 INFO L225 Difference]: With dead ends: 869 [2025-01-09 04:02:28,076 INFO L226 Difference]: Without dead ends: 444 [2025-01-09 04:02:28,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:02:28,078 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:02:28,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 402 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:02:28,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-01-09 04:02:28,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 444. [2025-01-09 04:02:28,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 338 states have (on average 1.2810650887573964) internal successors, (433), 363 states have internal predecessors, (433), 55 states have call successors, (55), 51 states have call predecessors, (55), 50 states have return successors, (83), 49 states have call predecessors, (83), 55 states have call successors, (83) [2025-01-09 04:02:28,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 571 transitions. [2025-01-09 04:02:28,119 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 571 transitions. Word has length 46 [2025-01-09 04:02:28,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:02:28,119 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 571 transitions. [2025-01-09 04:02:28,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 04:02:28,120 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 571 transitions. [2025-01-09 04:02:28,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 04:02:28,121 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:02:28,121 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:02:28,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:02:28,121 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:02:28,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:02:28,122 INFO L85 PathProgramCache]: Analyzing trace with hash -383035024, now seen corresponding path program 1 times [2025-01-09 04:02:28,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:02:28,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722717608] [2025-01-09 04:02:28,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:02:28,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:02:28,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 04:02:28,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 04:02:28,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:02:28,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:02:28,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:02:28,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:02:28,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722717608] [2025-01-09 04:02:28,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722717608] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:02:28,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:02:28,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:02:28,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246147834] [2025-01-09 04:02:28,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:02:28,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:02:28,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:02:28,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:02:28,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:02:28,244 INFO L87 Difference]: Start difference. First operand 444 states and 571 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 04:02:28,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:02:28,316 INFO L93 Difference]: Finished difference Result 816 states and 1086 transitions. [2025-01-09 04:02:28,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:02:28,317 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2025-01-09 04:02:28,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:02:28,319 INFO L225 Difference]: With dead ends: 816 [2025-01-09 04:02:28,319 INFO L226 Difference]: Without dead ends: 379 [2025-01-09 04:02:28,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:02:28,323 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:02:28,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 497 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:02:28,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-01-09 04:02:28,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2025-01-09 04:02:28,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 289 states have (on average 1.2698961937716262) internal successors, (367), 311 states have internal predecessors, (367), 48 states have call successors, (48), 44 states have call predecessors, (48), 41 states have return successors, (63), 40 states have call predecessors, (63), 48 states have call successors, (63) [2025-01-09 04:02:28,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 478 transitions. [2025-01-09 04:02:28,354 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 478 transitions. Word has length 46 [2025-01-09 04:02:28,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:02:28,354 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 478 transitions. [2025-01-09 04:02:28,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 04:02:28,355 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 478 transitions. [2025-01-09 04:02:28,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 04:02:28,356 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:02:28,356 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:02:28,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:02:28,357 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:02:28,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:02:28,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1917787566, now seen corresponding path program 1 times [2025-01-09 04:02:28,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:02:28,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736095937] [2025-01-09 04:02:28,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:02:28,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:02:28,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 04:02:28,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 04:02:28,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:02:28,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:02:28,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:02:28,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:02:28,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736095937] [2025-01-09 04:02:28,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736095937] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:02:28,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:02:28,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:02:28,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137249903] [2025-01-09 04:02:28,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:02:28,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:02:28,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:02:28,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:02:28,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:02:28,456 INFO L87 Difference]: Start difference. First operand 379 states and 478 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 04:02:28,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:02:28,552 INFO L93 Difference]: Finished difference Result 823 states and 1109 transitions. [2025-01-09 04:02:28,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:02:28,552 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2025-01-09 04:02:28,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:02:28,556 INFO L225 Difference]: With dead ends: 823 [2025-01-09 04:02:28,557 INFO L226 Difference]: Without dead ends: 565 [2025-01-09 04:02:28,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:02:28,559 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 53 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:02:28,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 566 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:02:28,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2025-01-09 04:02:28,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 560. [2025-01-09 04:02:28,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 422 states have (on average 1.2535545023696681) internal successors, (529), 453 states have internal predecessors, (529), 70 states have call successors, (70), 66 states have call predecessors, (70), 67 states have return successors, (123), 66 states have call predecessors, (123), 70 states have call successors, (123) [2025-01-09 04:02:28,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 722 transitions. [2025-01-09 04:02:28,601 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 722 transitions. Word has length 46 [2025-01-09 04:02:28,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:02:28,601 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 722 transitions. [2025-01-09 04:02:28,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 04:02:28,602 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 722 transitions. [2025-01-09 04:02:28,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 04:02:28,606 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:02:28,606 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:02:28,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:02:28,606 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:02:28,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:02:28,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1770403983, now seen corresponding path program 1 times [2025-01-09 04:02:28,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:02:28,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421502762] [2025-01-09 04:02:28,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:02:28,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:02:28,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 04:02:28,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 04:02:28,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:02:28,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:02:28,756 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 04:02:28,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:02:28,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421502762] [2025-01-09 04:02:28,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421502762] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:02:28,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:02:28,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:02:28,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698623359] [2025-01-09 04:02:28,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:02:28,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:02:28,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:02:28,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:02:28,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:02:28,759 INFO L87 Difference]: Start difference. First operand 560 states and 722 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 04:02:28,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:02:28,828 INFO L93 Difference]: Finished difference Result 1005 states and 1335 transitions. [2025-01-09 04:02:28,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:02:28,830 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 87 [2025-01-09 04:02:28,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:02:28,838 INFO L225 Difference]: With dead ends: 1005 [2025-01-09 04:02:28,838 INFO L226 Difference]: Without dead ends: 566 [2025-01-09 04:02:28,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:02:28,841 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:02:28,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 402 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:02:28,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-01-09 04:02:28,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2025-01-09 04:02:28,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 428 states have (on average 1.25) internal successors, (535), 459 states have internal predecessors, (535), 70 states have call successors, (70), 66 states have call predecessors, (70), 67 states have return successors, (123), 66 states have call predecessors, (123), 70 states have call successors, (123) [2025-01-09 04:02:28,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 728 transitions. [2025-01-09 04:02:28,891 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 728 transitions. Word has length 87 [2025-01-09 04:02:28,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:02:28,892 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 728 transitions. [2025-01-09 04:02:28,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 04:02:28,892 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 728 transitions. [2025-01-09 04:02:28,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 04:02:28,895 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:02:28,896 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:02:28,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:02:28,896 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:02:28,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:02:28,898 INFO L85 PathProgramCache]: Analyzing trace with hash 2101861487, now seen corresponding path program 1 times [2025-01-09 04:02:28,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:02:28,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669052597] [2025-01-09 04:02:28,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:02:28,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:02:28,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 04:02:28,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 04:02:28,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:02:28,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:02:29,077 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 04:02:29,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:02:29,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669052597] [2025-01-09 04:02:29,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669052597] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:02:29,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167951711] [2025-01-09 04:02:29,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:02:29,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:02:29,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:02:29,082 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:02:29,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 04:02:29,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 04:02:29,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 04:02:29,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:02:29,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:02:29,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 04:02:29,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:02:29,334 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:02:29,335 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:02:29,499 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 04:02:29,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167951711] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:02:29,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:02:29,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-01-09 04:02:29,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361149162] [2025-01-09 04:02:29,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:02:29,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:02:29,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:02:29,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:02:29,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:02:29,503 INFO L87 Difference]: Start difference. First operand 566 states and 728 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 04:02:29,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:02:29,721 INFO L93 Difference]: Finished difference Result 1351 states and 1843 transitions. [2025-01-09 04:02:29,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:02:29,722 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 87 [2025-01-09 04:02:29,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:02:29,729 INFO L225 Difference]: With dead ends: 1351 [2025-01-09 04:02:29,729 INFO L226 Difference]: Without dead ends: 906 [2025-01-09 04:02:29,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 170 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:02:29,732 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 112 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:02:29,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 586 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:02:29,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2025-01-09 04:02:29,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 806. [2025-01-09 04:02:29,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 606 states have (on average 1.2574257425742574) internal successors, (762), 653 states have internal predecessors, (762), 103 states have call successors, (103), 95 states have call predecessors, (103), 96 states have return successors, (196), 89 states have call predecessors, (196), 103 states have call successors, (196) [2025-01-09 04:02:29,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1061 transitions. [2025-01-09 04:02:29,791 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1061 transitions. Word has length 87 [2025-01-09 04:02:29,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:02:29,792 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 1061 transitions. [2025-01-09 04:02:29,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2025-01-09 04:02:29,793 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1061 transitions. [2025-01-09 04:02:29,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 04:02:29,797 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:02:29,798 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:02:29,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 04:02:30,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 04:02:30,004 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:02:30,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:02:30,004 INFO L85 PathProgramCache]: Analyzing trace with hash -636884274, now seen corresponding path program 2 times [2025-01-09 04:02:30,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:02:30,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369050667] [2025-01-09 04:02:30,005 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 04:02:30,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:02:30,023 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 128 statements into 2 equivalence classes. [2025-01-09 04:02:30,047 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 04:02:30,048 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 04:02:30,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:02:30,253 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 45 proven. 8 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 04:02:30,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:02:30,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369050667] [2025-01-09 04:02:30,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369050667] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:02:30,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616633151] [2025-01-09 04:02:30,254 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 04:02:30,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:02:30,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:02:30,257 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:02:30,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 04:02:30,318 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 128 statements into 2 equivalence classes. [2025-01-09 04:02:30,383 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 04:02:30,384 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 04:02:30,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:02:30,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 04:02:30,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:02:30,594 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 55 proven. 19 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 04:02:30,594 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:02:30,802 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 43 proven. 10 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 04:02:30,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616633151] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:02:30,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:02:30,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 8] total 11 [2025-01-09 04:02:30,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517532788] [2025-01-09 04:02:30,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:02:30,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 04:02:30,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:02:30,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 04:02:30,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:02:30,804 INFO L87 Difference]: Start difference. First operand 806 states and 1061 transitions. Second operand has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 states have internal predecessors, (136), 5 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2025-01-09 04:02:30,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:02:30,979 INFO L93 Difference]: Finished difference Result 1361 states and 1806 transitions. [2025-01-09 04:02:30,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:02:30,979 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 states have internal predecessors, (136), 5 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 128 [2025-01-09 04:02:30,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:02:30,981 INFO L225 Difference]: With dead ends: 1361 [2025-01-09 04:02:30,981 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 04:02:30,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 246 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-09 04:02:30,985 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 127 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:02:30,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 772 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:02:30,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 04:02:30,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 04:02:30,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 04:02:30,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 04:02:30,987 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 128 [2025-01-09 04:02:30,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:02:30,987 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 04:02:30,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 states have internal predecessors, (136), 5 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2025-01-09 04:02:30,988 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 04:02:30,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 04:02:30,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 04:02:30,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 04:02:31,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:02:31,197 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:02:31,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 04:02:33,437 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 04:02:33,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:02:33 BoogieIcfgContainer [2025-01-09 04:02:33,452 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 04:02:33,452 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 04:02:33,452 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 04:02:33,453 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 04:02:33,453 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:02:26" (3/4) ... [2025-01-09 04:02:33,455 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 04:02:33,460 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure deactivatePump [2025-01-09 04:02:33,460 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2025-01-09 04:02:33,461 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2025-01-09 04:02:33,461 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2025-01-09 04:02:33,461 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2025-01-09 04:02:33,461 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2025-01-09 04:02:33,461 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2025-01-09 04:02:33,461 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__lowWaterSensor [2025-01-09 04:02:33,466 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2025-01-09 04:02:33,467 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-01-09 04:02:33,467 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 04:02:33,468 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 04:02:33,468 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 04:02:33,566 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 04:02:33,567 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 04:02:33,567 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 04:02:33,568 INFO L158 Benchmark]: Toolchain (without parser) took 8604.38ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 121.1MB in the beginning and 84.7MB in the end (delta: 36.4MB). Peak memory consumption was 67.9MB. Max. memory is 16.1GB. [2025-01-09 04:02:33,568 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:02:33,568 INFO L158 Benchmark]: CACSL2BoogieTranslator took 450.53ms. Allocated memory is still 167.8MB. Free memory was 121.1MB in the beginning and 102.3MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 04:02:33,568 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.53ms. Allocated memory is still 167.8MB. Free memory was 102.3MB in the beginning and 100.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:02:33,569 INFO L158 Benchmark]: Boogie Preprocessor took 61.49ms. Allocated memory is still 167.8MB. Free memory was 100.3MB in the beginning and 98.5MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 04:02:33,569 INFO L158 Benchmark]: RCFGBuilder took 482.09ms. Allocated memory is still 167.8MB. Free memory was 98.5MB in the beginning and 80.5MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 04:02:33,569 INFO L158 Benchmark]: TraceAbstraction took 7430.75ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 79.7MB in the beginning and 92.9MB in the end (delta: -13.2MB). Peak memory consumption was 66.2MB. Max. memory is 16.1GB. [2025-01-09 04:02:33,569 INFO L158 Benchmark]: Witness Printer took 114.54ms. Allocated memory is still 201.3MB. Free memory was 92.9MB in the beginning and 84.7MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 04:02:33,571 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.28ms. Allocated memory is still 201.3MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 450.53ms. Allocated memory is still 167.8MB. Free memory was 121.1MB in the beginning and 102.3MB in the end (delta: 18.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.53ms. Allocated memory is still 167.8MB. Free memory was 102.3MB in the beginning and 100.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 61.49ms. Allocated memory is still 167.8MB. Free memory was 100.3MB in the beginning and 98.5MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 482.09ms. Allocated memory is still 167.8MB. Free memory was 98.5MB in the beginning and 80.5MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7430.75ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 79.7MB in the beginning and 92.9MB in the end (delta: -13.2MB). Peak memory consumption was 66.2MB. Max. memory is 16.1GB. * Witness Printer took 114.54ms. Allocated memory is still 201.3MB. Free memory was 92.9MB in the beginning and 84.7MB in the end (delta: 8.2MB). 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,"scenario.i","") [49] - GenericResultAtLocation [Line: 121]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [121] - GenericResultAtLocation [Line: 369]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification4_spec.i","") [369] - GenericResultAtLocation [Line: 397]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [397] - GenericResultAtLocation [Line: 435]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [435] - GenericResultAtLocation [Line: 444]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [444] - GenericResultAtLocation [Line: 540]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [540] - GenericResultAtLocation [Line: 906]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [906] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 440]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 97 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 730 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 726 mSDsluCounter, 4898 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3466 mSDsCounter, 101 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 461 IncrementalHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 101 mSolverCounterUnsat, 1432 mSDtfsCounter, 461 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 498 GetRequests, 438 SyntacticMatches, 10 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=806occurred in iteration=11, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 122 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 803 NumberOfCodeBlocks, 803 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1002 ConstructedInterpolants, 0 QuantifiedInterpolants, 1855 SizeOfPredicates, 4 NumberOfNonLiveVariables, 697 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 16 InterpolantComputations, 10 PerfectInterpolantSequences, 292/353 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: (((((pumpRunning == 0) && (splverifierCounter == 0)) && (waterLevel == 1)) || (((2 <= waterLevel) && (splverifierCounter == 0)) && (0 != systemActive))) || (((pumpRunning == 0) && (2 <= waterLevel)) && (splverifierCounter == 0))) - InvariantResult [Line: 113]: Location Invariant Derived location invariant: 0 - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2025-01-09 04:02:33,587 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 Result: TRUE