./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec3_product38.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_spec3_product38.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 c8e3613a57f37f194f1fe75086d0eb5e0d997c2a9b69c99903e0a1a10a2db5eb --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:01:21,318 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:01:21,365 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:01:21,377 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:01:21,377 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:01:21,400 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:01:21,401 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:01:21,401 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:01:21,401 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:01:21,401 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:01:21,401 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:01:21,401 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:01:21,402 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:01:21,402 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:01:21,402 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:01:21,402 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:01:21,402 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:01:21,402 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:01:21,402 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:01:21,402 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:01:21,402 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:01:21,403 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:01:21,403 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:01:21,403 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:01:21,403 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:01:21,403 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:01:21,403 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:01:21,403 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:01:21,403 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:01:21,403 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:01:21,403 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:01:21,404 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:01:21,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:01:21,404 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:01:21,404 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:01:21,404 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:01:21,404 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:01:21,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:01:21,404 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:01:21,404 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:01:21,404 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:01:21,404 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:01:21,405 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:01:21,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:01:21,405 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:01:21,405 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:01:21,405 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:01:21,405 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:01:21,405 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 -> c8e3613a57f37f194f1fe75086d0eb5e0d997c2a9b69c99903e0a1a10a2db5eb [2025-01-09 04:01:21,654 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:01:21,667 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:01:21,669 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:01:21,670 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:01:21,670 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:01:21,671 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec3_product38.cil.c [2025-01-09 04:01:22,827 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fd1dadbbe/ca0cdc4509514f48b2bb2cfbe4db3229/FLAGa73825f2d [2025-01-09 04:01:23,107 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:01:23,107 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec3_product38.cil.c [2025-01-09 04:01:23,116 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fd1dadbbe/ca0cdc4509514f48b2bb2cfbe4db3229/FLAGa73825f2d [2025-01-09 04:01:23,127 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fd1dadbbe/ca0cdc4509514f48b2bb2cfbe4db3229 [2025-01-09 04:01:23,129 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:01:23,130 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:01:23,131 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:01:23,131 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:01:23,134 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:01:23,135 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:01:23" (1/1) ... [2025-01-09 04:01:23,135 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@482c4ffe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:23, skipping insertion in model container [2025-01-09 04:01:23,135 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:01:23" (1/1) ... [2025-01-09 04:01:23,163 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:01:23,369 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_spec3_product38.cil.c[15422,15435] [2025-01-09 04:01:23,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:01:23,399 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:01:23,405 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [49] [2025-01-09 04:01:23,406 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [87] [2025-01-09 04:01:23,406 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [159] [2025-01-09 04:01:23,406 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [354] [2025-01-09 04:01:23,407 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [720] [2025-01-09 04:01:23,407 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [729] [2025-01-09 04:01:23,407 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [825] [2025-01-09 04:01:23,407 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [920] [2025-01-09 04:01:23,462 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_spec3_product38.cil.c[15422,15435] [2025-01-09 04:01:23,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:01:23,492 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:01:23,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:23 WrapperNode [2025-01-09 04:01:23,494 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:01:23,495 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:01:23,496 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:01:23,496 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:01:23,500 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:01:23" (1/1) ... [2025-01-09 04:01:23,514 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:01:23" (1/1) ... [2025-01-09 04:01:23,537 INFO L138 Inliner]: procedures = 54, calls = 99, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 198 [2025-01-09 04:01:23,538 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:01:23,538 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:01:23,538 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:01:23,538 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:01:23,547 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:23" (1/1) ... [2025-01-09 04:01:23,548 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:23" (1/1) ... [2025-01-09 04:01:23,549 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:23" (1/1) ... [2025-01-09 04:01:23,564 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:01:23,565 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:23" (1/1) ... [2025-01-09 04:01:23,565 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:23" (1/1) ... [2025-01-09 04:01:23,568 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:23" (1/1) ... [2025-01-09 04:01:23,570 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:23" (1/1) ... [2025-01-09 04:01:23,572 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:23" (1/1) ... [2025-01-09 04:01:23,573 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:23" (1/1) ... [2025-01-09 04:01:23,574 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:23" (1/1) ... [2025-01-09 04:01:23,575 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:01:23,576 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:01:23,576 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:01:23,576 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:01:23,577 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:23" (1/1) ... [2025-01-09 04:01:23,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:01:23,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:01:23,599 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:01:23,601 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:01:23,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:01:23,617 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base [2025-01-09 04:01:23,617 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base [2025-01-09 04:01:23,617 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical [2025-01-09 04:01:23,618 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical [2025-01-09 04:01:23,618 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-01-09 04:01:23,618 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-01-09 04:01:23,618 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-01-09 04:01:23,618 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-01-09 04:01:23,618 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor [2025-01-09 04:01:23,618 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor [2025-01-09 04:01:23,618 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise [2025-01-09 04:01:23,618 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise [2025-01-09 04:01:23,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:01:23,618 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel [2025-01-09 04:01:23,618 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel [2025-01-09 04:01:23,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:01:23,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:01:23,678 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:01:23,681 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:01:23,899 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2025-01-09 04:01:23,899 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:01:23,906 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:01:23,907 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 04:01:23,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:01:23 BoogieIcfgContainer [2025-01-09 04:01:23,907 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:01:23,909 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:01:23,909 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:01:23,912 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:01:23,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:01:23" (1/3) ... [2025-01-09 04:01:23,912 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ba79520 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:01:23, skipping insertion in model container [2025-01-09 04:01:23,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:01:23" (2/3) ... [2025-01-09 04:01:23,912 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ba79520 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:01:23, skipping insertion in model container [2025-01-09 04:01:23,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:01:23" (3/3) ... [2025-01-09 04:01:23,913 INFO L128 eAbstractionObserver]: Analyzing ICFG minepump_spec3_product38.cil.c [2025-01-09 04:01:23,923 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:01:23,924 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG minepump_spec3_product38.cil.c that has 8 procedures, 86 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 04:01:23,961 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:01:23,968 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;@2bc7b7be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:01:23,969 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:01:23,971 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 73 states have internal predecessors, (89), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 04:01:23,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 04:01:23,977 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:01:23,977 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] [2025-01-09 04:01:23,977 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:01:23,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:01:23,981 INFO L85 PathProgramCache]: Analyzing trace with hash -178014937, now seen corresponding path program 1 times [2025-01-09 04:01:23,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:01:23,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378864525] [2025-01-09 04:01:23,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:01:23,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:01:24,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 04:01:24,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 04:01:24,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:01:24,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:01:24,114 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:01:24,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:01:24,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378864525] [2025-01-09 04:01:24,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378864525] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:01:24,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:01:24,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 04:01:24,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865363816] [2025-01-09 04:01:24,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:01:24,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 04:01:24,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:01:24,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 04:01:24,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 04:01:24,132 INFO L87 Difference]: Start difference. First operand has 86 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 73 states have internal predecessors, (89), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 04:01:24,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:01:24,149 INFO L93 Difference]: Finished difference Result 164 states and 221 transitions. [2025-01-09 04:01:24,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 04:01:24,150 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-01-09 04:01:24,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:01:24,155 INFO L225 Difference]: With dead ends: 164 [2025-01-09 04:01:24,155 INFO L226 Difference]: Without dead ends: 77 [2025-01-09 04:01:24,158 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:01:24,160 INFO L435 NwaCegarLoop]: 109 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, 109 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:01:24,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:01:24,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-01-09 04:01:24,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-01-09 04:01:24,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 65 states have internal predecessors, (77), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-09 04:01:24,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 100 transitions. [2025-01-09 04:01:24,194 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 100 transitions. Word has length 25 [2025-01-09 04:01:24,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:01:24,195 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 100 transitions. [2025-01-09 04:01:24,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 04:01:24,195 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 100 transitions. [2025-01-09 04:01:24,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 04:01:24,197 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:01:24,197 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] [2025-01-09 04:01:24,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:01:24,198 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:01:24,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:01:24,199 INFO L85 PathProgramCache]: Analyzing trace with hash -637293303, now seen corresponding path program 1 times [2025-01-09 04:01:24,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:01:24,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204198764] [2025-01-09 04:01:24,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:01:24,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:01:24,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 04:01:24,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 04:01:24,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:01:24,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:01:24,309 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:01:24,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:01:24,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204198764] [2025-01-09 04:01:24,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204198764] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:01:24,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:01:24,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:01:24,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422443477] [2025-01-09 04:01:24,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:01:24,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:01:24,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:01:24,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:01:24,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:01:24,312 INFO L87 Difference]: Start difference. First operand 77 states and 100 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 04:01:24,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:01:24,327 INFO L93 Difference]: Finished difference Result 121 states and 157 transitions. [2025-01-09 04:01:24,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:01:24,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-01-09 04:01:24,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:01:24,328 INFO L225 Difference]: With dead ends: 121 [2025-01-09 04:01:24,328 INFO L226 Difference]: Without dead ends: 69 [2025-01-09 04:01:24,329 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:01:24,329 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 13 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 160 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:01:24,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 160 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:01:24,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-01-09 04:01:24,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-01-09 04:01:24,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 60 states have internal predecessors, (71), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 04:01:24,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 89 transitions. [2025-01-09 04:01:24,337 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 89 transitions. Word has length 25 [2025-01-09 04:01:24,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:01:24,337 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 89 transitions. [2025-01-09 04:01:24,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 04:01:24,338 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 89 transitions. [2025-01-09 04:01:24,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 04:01:24,338 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:01:24,339 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] [2025-01-09 04:01:24,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:01:24,339 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:01:24,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:01:24,339 INFO L85 PathProgramCache]: Analyzing trace with hash -315231404, now seen corresponding path program 1 times [2025-01-09 04:01:24,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:01:24,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145388376] [2025-01-09 04:01:24,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:01:24,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:01:24,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 04:01:24,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 04:01:24,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:01:24,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:01:24,421 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:01:24,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:01:24,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145388376] [2025-01-09 04:01:24,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145388376] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:01:24,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:01:24,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 04:01:24,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491061628] [2025-01-09 04:01:24,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:01:24,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 04:01:24,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:01:24,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 04:01:24,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 04:01:24,423 INFO L87 Difference]: Start difference. First operand 69 states and 89 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (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:01:24,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:01:24,442 INFO L93 Difference]: Finished difference Result 131 states and 172 transitions. [2025-01-09 04:01:24,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 04:01:24,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (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 30 [2025-01-09 04:01:24,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:01:24,444 INFO L225 Difference]: With dead ends: 131 [2025-01-09 04:01:24,444 INFO L226 Difference]: Without dead ends: 69 [2025-01-09 04:01:24,446 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:01:24,446 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 83 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:01:24,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 87 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:01:24,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-01-09 04:01:24,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-01-09 04:01:24,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 53 states have (on average 1.320754716981132) internal successors, (70), 60 states have internal predecessors, (70), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 04:01:24,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 88 transitions. [2025-01-09 04:01:24,453 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 88 transitions. Word has length 30 [2025-01-09 04:01:24,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:01:24,453 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 88 transitions. [2025-01-09 04:01:24,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (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:01:24,453 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 88 transitions. [2025-01-09 04:01:24,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-09 04:01:24,454 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:01:24,454 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:01:24,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:01:24,454 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:01:24,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:01:24,456 INFO L85 PathProgramCache]: Analyzing trace with hash 90734513, now seen corresponding path program 1 times [2025-01-09 04:01:24,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:01:24,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787561933] [2025-01-09 04:01:24,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:01:24,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:01:24,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 04:01:24,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 04:01:24,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:01:24,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:01:24,550 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:01:24,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:01:24,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787561933] [2025-01-09 04:01:24,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787561933] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:01:24,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:01:24,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:01:24,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832666472] [2025-01-09 04:01:24,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:01:24,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:01:24,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:01:24,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:01:24,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:01:24,553 INFO L87 Difference]: Start difference. First operand 69 states and 88 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 04:01:24,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:01:24,717 INFO L93 Difference]: Finished difference Result 208 states and 266 transitions. [2025-01-09 04:01:24,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 04:01:24,717 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 40 [2025-01-09 04:01:24,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:01:24,718 INFO L225 Difference]: With dead ends: 208 [2025-01-09 04:01:24,718 INFO L226 Difference]: Without dead ends: 146 [2025-01-09 04:01:24,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:01:24,719 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 182 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:01:24,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 284 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:01:24,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-01-09 04:01:24,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 140. [2025-01-09 04:01:24,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 108 states have (on average 1.2777777777777777) internal successors, (138), 115 states have internal predecessors, (138), 15 states have call successors, (15), 13 states have call predecessors, (15), 16 states have return successors, (20), 16 states have call predecessors, (20), 15 states have call successors, (20) [2025-01-09 04:01:24,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 173 transitions. [2025-01-09 04:01:24,730 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 173 transitions. Word has length 40 [2025-01-09 04:01:24,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:01:24,730 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 173 transitions. [2025-01-09 04:01:24,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 04:01:24,731 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 173 transitions. [2025-01-09 04:01:24,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 04:01:24,731 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:01:24,731 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:01:24,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:01:24,731 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:01:24,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:01:24,732 INFO L85 PathProgramCache]: Analyzing trace with hash -195307306, now seen corresponding path program 1 times [2025-01-09 04:01:24,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:01:24,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496218709] [2025-01-09 04:01:24,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:01:24,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:01:24,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 04:01:24,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 04:01:24,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:01:24,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:01:24,785 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:01:24,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:01:24,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496218709] [2025-01-09 04:01:24,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496218709] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:01:24,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:01:24,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:01:24,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275383273] [2025-01-09 04:01:24,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:01:24,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:01:24,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:01:24,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:01:24,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:01:24,787 INFO L87 Difference]: Start difference. First operand 140 states and 173 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 04:01:24,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:01:24,807 INFO L93 Difference]: Finished difference Result 276 states and 346 transitions. [2025-01-09 04:01:24,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:01:24,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2025-01-09 04:01:24,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:01:24,808 INFO L225 Difference]: With dead ends: 276 [2025-01-09 04:01:24,808 INFO L226 Difference]: Without dead ends: 143 [2025-01-09 04:01:24,809 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:01:24,809 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 334 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:01:24,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 334 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:01:24,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-01-09 04:01:24,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2025-01-09 04:01:24,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 111 states have (on average 1.2702702702702702) internal successors, (141), 118 states have internal predecessors, (141), 15 states have call successors, (15), 13 states have call predecessors, (15), 16 states have return successors, (20), 16 states have call predecessors, (20), 15 states have call successors, (20) [2025-01-09 04:01:24,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 176 transitions. [2025-01-09 04:01:24,820 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 176 transitions. Word has length 44 [2025-01-09 04:01:24,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:01:24,820 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 176 transitions. [2025-01-09 04:01:24,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 04:01:24,820 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 176 transitions. [2025-01-09 04:01:24,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 04:01:24,821 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:01:24,821 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:01:24,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:01:24,821 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:01:24,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:01:24,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1012955756, now seen corresponding path program 1 times [2025-01-09 04:01:24,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:01:24,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496734492] [2025-01-09 04:01:24,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:01:24,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:01:24,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 04:01:24,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 04:01:24,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:01:24,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:01:24,897 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:01:24,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:01:24,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496734492] [2025-01-09 04:01:24,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496734492] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:01:24,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:01:24,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:01:24,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905526655] [2025-01-09 04:01:24,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:01:24,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:01:24,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:01:24,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:01:24,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:01:24,898 INFO L87 Difference]: Start difference. First operand 143 states and 176 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 04:01:24,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:01:24,952 INFO L93 Difference]: Finished difference Result 281 states and 354 transitions. [2025-01-09 04:01:24,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:01:24,953 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), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2025-01-09 04:01:24,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:01:24,954 INFO L225 Difference]: With dead ends: 281 [2025-01-09 04:01:24,954 INFO L226 Difference]: Without dead ends: 145 [2025-01-09 04:01:24,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:01:24,955 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 85 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:01:24,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 249 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:01:24,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-01-09 04:01:24,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2025-01-09 04:01:24,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 113 states have (on average 1.2654867256637168) internal successors, (143), 120 states have internal predecessors, (143), 15 states have call successors, (15), 13 states have call predecessors, (15), 16 states have return successors, (20), 16 states have call predecessors, (20), 15 states have call successors, (20) [2025-01-09 04:01:24,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 178 transitions. [2025-01-09 04:01:24,970 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 178 transitions. Word has length 44 [2025-01-09 04:01:24,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:01:24,971 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 178 transitions. [2025-01-09 04:01:24,971 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), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 04:01:24,971 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 178 transitions. [2025-01-09 04:01:24,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 04:01:24,971 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:01:24,972 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:01:24,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 04:01:24,972 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:01:24,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:01:24,972 INFO L85 PathProgramCache]: Analyzing trace with hash -794101038, now seen corresponding path program 1 times [2025-01-09 04:01:24,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:01:24,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306567796] [2025-01-09 04:01:24,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:01:24,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:01:24,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 04:01:24,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 04:01:24,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:01:24,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:01:25,050 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:01:25,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:01:25,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306567796] [2025-01-09 04:01:25,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306567796] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:01:25,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:01:25,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:01:25,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422210067] [2025-01-09 04:01:25,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:01:25,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:01:25,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:01:25,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:01:25,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:01:25,053 INFO L87 Difference]: Start difference. First operand 145 states and 178 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 04:01:25,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:01:25,131 INFO L93 Difference]: Finished difference Result 448 states and 570 transitions. [2025-01-09 04:01:25,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:01:25,132 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2025-01-09 04:01:25,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:01:25,134 INFO L225 Difference]: With dead ends: 448 [2025-01-09 04:01:25,134 INFO L226 Difference]: Without dead ends: 310 [2025-01-09 04:01:25,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:01:25,135 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 119 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:01:25,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 289 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:01:25,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-01-09 04:01:25,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 195. [2025-01-09 04:01:25,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 151 states have (on average 1.2516556291390728) internal successors, (189), 160 states have internal predecessors, (189), 21 states have call successors, (21), 19 states have call predecessors, (21), 22 states have return successors, (27), 21 states have call predecessors, (27), 21 states have call successors, (27) [2025-01-09 04:01:25,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 237 transitions. [2025-01-09 04:01:25,166 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 237 transitions. Word has length 44 [2025-01-09 04:01:25,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:01:25,166 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 237 transitions. [2025-01-09 04:01:25,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 04:01:25,166 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 237 transitions. [2025-01-09 04:01:25,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 04:01:25,170 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:01:25,170 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:01:25,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 04:01:25,170 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:01:25,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:01:25,170 INFO L85 PathProgramCache]: Analyzing trace with hash -232760023, now seen corresponding path program 1 times [2025-01-09 04:01:25,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:01:25,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328591594] [2025-01-09 04:01:25,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:01:25,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:01:25,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 04:01:25,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 04:01:25,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:01:25,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:01:25,250 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:01:25,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:01:25,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328591594] [2025-01-09 04:01:25,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328591594] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:01:25,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:01:25,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:01:25,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873206834] [2025-01-09 04:01:25,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:01:25,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:01:25,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:01:25,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:01:25,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:01:25,254 INFO L87 Difference]: Start difference. First operand 195 states and 237 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 04:01:25,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:01:25,303 INFO L93 Difference]: Finished difference Result 381 states and 465 transitions. [2025-01-09 04:01:25,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:01:25,304 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2025-01-09 04:01:25,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:01:25,305 INFO L225 Difference]: With dead ends: 381 [2025-01-09 04:01:25,306 INFO L226 Difference]: Without dead ends: 193 [2025-01-09 04:01:25,306 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:01:25,307 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 34 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 320 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:01:25,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 320 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:01:25,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-01-09 04:01:25,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2025-01-09 04:01:25,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 149 states have (on average 1.2416107382550337) internal successors, (185), 158 states have internal predecessors, (185), 21 states have call successors, (21), 19 states have call predecessors, (21), 22 states have return successors, (27), 21 states have call predecessors, (27), 21 states have call successors, (27) [2025-01-09 04:01:25,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 233 transitions. [2025-01-09 04:01:25,336 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 233 transitions. Word has length 46 [2025-01-09 04:01:25,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:01:25,337 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 233 transitions. [2025-01-09 04:01:25,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 04:01:25,337 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 233 transitions. [2025-01-09 04:01:25,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 04:01:25,339 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:01:25,339 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, 1, 1] [2025-01-09 04:01:25,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:01:25,340 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:01:25,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:01:25,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1554012844, now seen corresponding path program 1 times [2025-01-09 04:01:25,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:01:25,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358227693] [2025-01-09 04:01:25,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:01:25,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:01:25,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 04:01:25,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 04:01:25,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:01:25,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:01:25,424 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:01:25,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:01:25,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358227693] [2025-01-09 04:01:25,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358227693] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:01:25,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:01:25,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 04:01:25,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261437625] [2025-01-09 04:01:25,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:01:25,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 04:01:25,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:01:25,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 04:01:25,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:01:25,427 INFO L87 Difference]: Start difference. First operand 193 states and 233 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 04:01:25,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:01:25,522 INFO L93 Difference]: Finished difference Result 333 states and 406 transitions. [2025-01-09 04:01:25,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:01:25,523 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2025-01-09 04:01:25,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:01:25,524 INFO L225 Difference]: With dead ends: 333 [2025-01-09 04:01:25,525 INFO L226 Difference]: Without dead ends: 193 [2025-01-09 04:01:25,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-01-09 04:01:25,526 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 166 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:01:25,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 428 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 04:01:25,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-01-09 04:01:25,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2025-01-09 04:01:25,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 149 states have (on average 1.221476510067114) internal successors, (182), 158 states have internal predecessors, (182), 21 states have call successors, (21), 19 states have call predecessors, (21), 22 states have return successors, (25), 21 states have call predecessors, (25), 21 states have call successors, (25) [2025-01-09 04:01:25,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 228 transitions. [2025-01-09 04:01:25,540 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 228 transitions. Word has length 48 [2025-01-09 04:01:25,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:01:25,540 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 228 transitions. [2025-01-09 04:01:25,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 04:01:25,540 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 228 transitions. [2025-01-09 04:01:25,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 04:01:25,541 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:01:25,542 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, 1, 1, 1, 1] [2025-01-09 04:01:25,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:01:25,542 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:01:25,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:01:25,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1446850179, now seen corresponding path program 1 times [2025-01-09 04:01:25,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:01:25,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910054528] [2025-01-09 04:01:25,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:01:25,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:01:25,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 04:01:25,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 04:01:25,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:01:25,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:01:25,647 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:01:25,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:01:25,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910054528] [2025-01-09 04:01:25,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910054528] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:01:25,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:01:25,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:01:25,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979954487] [2025-01-09 04:01:25,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:01:25,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:01:25,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:01:25,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:01:25,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:01:25,649 INFO L87 Difference]: Start difference. First operand 193 states and 228 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 04:01:25,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:01:25,710 INFO L93 Difference]: Finished difference Result 434 states and 537 transitions. [2025-01-09 04:01:25,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:01:25,710 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 50 [2025-01-09 04:01:25,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:01:25,712 INFO L225 Difference]: With dead ends: 434 [2025-01-09 04:01:25,712 INFO L226 Difference]: Without dead ends: 294 [2025-01-09 04:01:25,713 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:01:25,714 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 60 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:01:25,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 365 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:01:25,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-01-09 04:01:25,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 290. [2025-01-09 04:01:25,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 223 states have (on average 1.2152466367713004) internal successors, (271), 234 states have internal predecessors, (271), 34 states have call successors, (34), 30 states have call predecessors, (34), 32 states have return successors, (42), 33 states have call predecessors, (42), 34 states have call successors, (42) [2025-01-09 04:01:25,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 347 transitions. [2025-01-09 04:01:25,744 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 347 transitions. Word has length 50 [2025-01-09 04:01:25,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:01:25,744 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 347 transitions. [2025-01-09 04:01:25,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 04:01:25,744 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 347 transitions. [2025-01-09 04:01:25,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 04:01:25,745 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:01:25,745 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, 1, 1, 1, 1] [2025-01-09 04:01:25,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:01:25,745 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:01:25,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:01:25,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1312836673, now seen corresponding path program 1 times [2025-01-09 04:01:25,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:01:25,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224118175] [2025-01-09 04:01:25,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:01:25,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:01:25,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 04:01:25,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 04:01:25,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:01:25,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:01:25,789 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:01:25,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:01:25,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224118175] [2025-01-09 04:01:25,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224118175] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:01:25,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:01:25,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 04:01:25,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087194872] [2025-01-09 04:01:25,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:01:25,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 04:01:25,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:01:25,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 04:01:25,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:01:25,792 INFO L87 Difference]: Start difference. First operand 290 states and 347 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 04:01:25,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:01:25,821 INFO L93 Difference]: Finished difference Result 526 states and 636 transitions. [2025-01-09 04:01:25,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:01:25,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 50 [2025-01-09 04:01:25,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:01:25,824 INFO L225 Difference]: With dead ends: 526 [2025-01-09 04:01:25,824 INFO L226 Difference]: Without dead ends: 287 [2025-01-09 04:01:25,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 04:01:25,825 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:01:25,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 253 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:01:25,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-01-09 04:01:25,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2025-01-09 04:01:25,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 220 states have (on average 1.2136363636363636) internal successors, (267), 231 states have internal predecessors, (267), 34 states have call successors, (34), 30 states have call predecessors, (34), 32 states have return successors, (42), 33 states have call predecessors, (42), 34 states have call successors, (42) [2025-01-09 04:01:25,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 343 transitions. [2025-01-09 04:01:25,846 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 343 transitions. Word has length 50 [2025-01-09 04:01:25,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:01:25,847 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 343 transitions. [2025-01-09 04:01:25,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 04:01:25,847 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 343 transitions. [2025-01-09 04:01:25,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 04:01:25,848 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:01:25,848 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, 1, 1, 1, 1] [2025-01-09 04:01:25,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:01:25,848 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:01:25,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:01:25,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1531691391, now seen corresponding path program 1 times [2025-01-09 04:01:25,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:01:25,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100615391] [2025-01-09 04:01:25,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:01:25,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:01:25,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 04:01:25,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 04:01:25,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:01:25,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:01:25,914 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:01:25,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:01:25,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100615391] [2025-01-09 04:01:25,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100615391] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:01:25,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:01:25,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:01:25,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435136160] [2025-01-09 04:01:25,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:01:25,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:01:25,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:01:25,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:01:25,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:01:25,916 INFO L87 Difference]: Start difference. First operand 287 states and 343 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 04:01:25,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:01:25,966 INFO L93 Difference]: Finished difference Result 506 states and 610 transitions. [2025-01-09 04:01:25,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:01:25,967 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 50 [2025-01-09 04:01:25,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:01:25,968 INFO L225 Difference]: With dead ends: 506 [2025-01-09 04:01:25,969 INFO L226 Difference]: Without dead ends: 270 [2025-01-09 04:01:25,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:01:25,969 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 83 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:01:25,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 333 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:01:25,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-01-09 04:01:25,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2025-01-09 04:01:25,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 208 states have (on average 1.2067307692307692) internal successors, (251), 218 states have internal predecessors, (251), 32 states have call successors, (32), 29 states have call predecessors, (32), 29 states have return successors, (38), 30 states have call predecessors, (38), 32 states have call successors, (38) [2025-01-09 04:01:25,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 321 transitions. [2025-01-09 04:01:25,989 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 321 transitions. Word has length 50 [2025-01-09 04:01:25,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:01:25,990 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 321 transitions. [2025-01-09 04:01:25,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 04:01:25,990 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 321 transitions. [2025-01-09 04:01:25,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 04:01:25,991 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:01:25,991 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-01-09 04:01:25,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:01:25,991 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:01:25,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:01:25,991 INFO L85 PathProgramCache]: Analyzing trace with hash -687413731, now seen corresponding path program 1 times [2025-01-09 04:01:25,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:01:25,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068933392] [2025-01-09 04:01:25,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:01:25,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:01:26,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 04:01:26,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 04:01:26,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:01:26,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:01:26,186 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 04:01:26,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:01:26,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068933392] [2025-01-09 04:01:26,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068933392] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:01:26,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546711299] [2025-01-09 04:01:26,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:01:26,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:01:26,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:01:26,189 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:01:26,191 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:01:26,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 04:01:26,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 04:01:26,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:01:26,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:01:26,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 04:01:26,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:01:26,389 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 04:01:26,389 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:01:26,667 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 04:01:26,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546711299] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:01:26,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:01:26,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 15 [2025-01-09 04:01:26,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751151346] [2025-01-09 04:01:26,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:01:26,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 04:01:26,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:01:26,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 04:01:26,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-01-09 04:01:26,669 INFO L87 Difference]: Start difference. First operand 270 states and 321 transitions. Second operand has 15 states, 15 states have (on average 6.2) internal successors, (93), 13 states have internal predecessors, (93), 6 states have call successors, (17), 8 states have call predecessors, (17), 8 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) [2025-01-09 04:01:27,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:01:27,017 INFO L93 Difference]: Finished difference Result 552 states and 683 transitions. [2025-01-09 04:01:27,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 04:01:27,018 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.2) internal successors, (93), 13 states have internal predecessors, (93), 6 states have call successors, (17), 8 states have call predecessors, (17), 8 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) Word has length 81 [2025-01-09 04:01:27,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:01:27,019 INFO L225 Difference]: With dead ends: 552 [2025-01-09 04:01:27,020 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 04:01:27,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 155 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=419, Unknown=0, NotChecked=0, Total=650 [2025-01-09 04:01:27,023 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 360 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:01:27,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 303 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:01:27,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 04:01:27,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 04:01:27,024 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:01:27,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 04:01:27,024 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 81 [2025-01-09 04:01:27,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:01:27,024 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 04:01:27,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.2) internal successors, (93), 13 states have internal predecessors, (93), 6 states have call successors, (17), 8 states have call predecessors, (17), 8 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) [2025-01-09 04:01:27,024 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 04:01:27,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 04:01:27,028 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 04:01:27,035 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:01:27,233 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,SelfDestructingSolverStorable12 [2025-01-09 04:01:27,235 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:01:27,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 04:01:28,893 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 04:01:28,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:01:28 BoogieIcfgContainer [2025-01-09 04:01:28,902 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 04:01:28,902 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 04:01:28,902 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 04:01:28,902 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 04:01:28,903 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:01:23" (3/4) ... [2025-01-09 04:01:28,904 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 04:01:28,908 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base [2025-01-09 04:01:28,908 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel [2025-01-09 04:01:28,908 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure isMethaneLevelCritical [2025-01-09 04:01:28,908 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup [2025-01-09 04:01:28,908 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift [2025-01-09 04:01:28,908 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor [2025-01-09 04:01:28,909 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise [2025-01-09 04:01:28,913 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2025-01-09 04:01:28,913 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-01-09 04:01:28,913 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 04:01:28,913 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 04:01:28,914 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 04:01:28,983 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 04:01:28,983 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 04:01:28,983 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 04:01:28,984 INFO L158 Benchmark]: Toolchain (without parser) took 5854.01ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 112.5MB in the beginning and 73.2MB in the end (delta: 39.3MB). Peak memory consumption was 69.4MB. Max. memory is 16.1GB. [2025-01-09 04:01:28,984 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 226.5MB. Free memory is still 149.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:01:28,984 INFO L158 Benchmark]: CACSL2BoogieTranslator took 364.03ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 94.1MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 04:01:28,984 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.45ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 92.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:01:28,984 INFO L158 Benchmark]: Boogie Preprocessor took 37.04ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 90.6MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 04:01:28,984 INFO L158 Benchmark]: RCFGBuilder took 331.11ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 73.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 04:01:28,985 INFO L158 Benchmark]: TraceAbstraction took 4992.97ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 73.3MB in the beginning and 81.5MB in the end (delta: -8.2MB). Peak memory consumption was 53.7MB. Max. memory is 16.1GB. [2025-01-09 04:01:28,985 INFO L158 Benchmark]: Witness Printer took 81.08ms. Allocated memory is still 176.2MB. Free memory was 81.5MB in the beginning and 73.2MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 04:01:28,986 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.15ms. Allocated memory is still 226.5MB. Free memory is still 149.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 364.03ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 94.1MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.45ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 92.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.04ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 90.6MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 331.11ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 73.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4992.97ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 73.3MB in the beginning and 81.5MB in the end (delta: -8.2MB). Peak memory consumption was 53.7MB. Max. memory is 16.1GB. * Witness Printer took 81.08ms. Allocated memory is still 176.2MB. Free memory was 81.5MB in the beginning and 73.2MB in the end (delta: 8.3MB). 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,"featureselect.i","") [49] - GenericResultAtLocation [Line: 87]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [87] - GenericResultAtLocation [Line: 159]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [159] - GenericResultAtLocation [Line: 354]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [354] - GenericResultAtLocation [Line: 720]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [720] - GenericResultAtLocation [Line: 729]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [729] - GenericResultAtLocation [Line: 825]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [825] - GenericResultAtLocation [Line: 920]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [920] * 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: 725]: 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 8 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1193 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1185 mSDsluCounter, 3514 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2258 mSDsCounter, 194 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 559 IncrementalHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 194 mSolverCounterUnsat, 1256 mSDtfsCounter, 559 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 266 GetRequests, 190 SyntacticMatches, 7 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=290occurred in iteration=10, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 125 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 658 NumberOfCodeBlocks, 658 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 724 ConstructedInterpolants, 0 QuantifiedInterpolants, 1406 SizeOfPredicates, 2 NumberOfNonLiveVariables, 283 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 15 InterpolantComputations, 12 PerfectInterpolantSequences, 53/78 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: 741]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: (((((1 == systemActive) && (splverifierCounter == 0)) && (waterLevel <= 2)) && (pumpRunning == 1)) || ((((pumpRunning == 0) && (waterLevel <= 1)) && (1 == systemActive)) && (splverifierCounter == 0))) - InvariantResult [Line: 151]: Location Invariant Derived location invariant: 0 RESULT: Ultimate proved your program to be correct! [2025-01-09 04:01:29,000 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