./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/minepump_spec2_product49.cil.c --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version c7c6ca5d
Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec2_product49.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8ebbbe9395fd7f6497497f0e6f84282075bb296e20acc9821d0fb2d7075b331d
--- Real Ultimate output ---
This is Ultimate 0.2.5-?-c7c6ca5-m
[2024-11-08 15:14:11,996 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-08 15:14:12,078 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-08 15:14:12,091 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-08 15:14:12,091 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-08 15:14:12,117 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-08 15:14:12,118 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-08 15:14:12,118 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-08 15:14:12,119 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-08 15:14:12,120 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-08 15:14:12,121 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-08 15:14:12,121 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-08 15:14:12,122 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-08 15:14:12,122 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-08 15:14:12,124 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-08 15:14:12,125 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-08 15:14:12,125 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-08 15:14:12,125 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-08 15:14:12,125 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-08 15:14:12,126 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-08 15:14:12,126 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-08 15:14:12,127 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-08 15:14:12,128 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-08 15:14:12,128 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-08 15:14:12,128 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-08 15:14:12,128 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-08 15:14:12,129 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-08 15:14:12,129 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-08 15:14:12,129 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-08 15:14:12,130 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-08 15:14:12,130 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-08 15:14:12,130 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-08 15:14:12,130 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 15:14:12,131 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-08 15:14:12,131 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-08 15:14:12,131 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-08 15:14:12,131 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-08 15:14:12,131 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-08 15:14:12,132 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-08 15:14:12,132 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-08 15:14:12,132 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-08 15:14:12,132 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-08 15:14:12,133 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8ebbbe9395fd7f6497497f0e6f84282075bb296e20acc9821d0fb2d7075b331d
[2024-11-08 15:14:12,385 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-08 15:14:12,409 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-08 15:14:12,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-08 15:14:12,413 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-08 15:14:12,414 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-08 15:14:12,415 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec2_product49.cil.c
[2024-11-08 15:14:14,000 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-08 15:14:14,223 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-08 15:14:14,224 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product49.cil.c
[2024-11-08 15:14:14,243 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7d082d42/b0e1647cf4ff4402ac79da501a5a4ecd/FLAG4af2a8695
[2024-11-08 15:14:14,257 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7d082d42/b0e1647cf4ff4402ac79da501a5a4ecd
[2024-11-08 15:14:14,259 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-08 15:14:14,261 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-08 15:14:14,262 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-08 15:14:14,262 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-08 15:14:14,267 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-08 15:14:14,268 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:14:14" (1/1) ...
[2024-11-08 15:14:14,269 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31d7b436 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:14, skipping insertion in model container
[2024-11-08 15:14:14,269 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:14:14" (1/1) ...
[2024-11-08 15:14:14,311 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-08 15:14:14,646 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product49.cil.c[18359,18372]
[2024-11-08 15:14:14,656 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 15:14:14,672 INFO L200 MainTranslator]: Completed pre-run
[2024-11-08 15:14:14,681 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [49]
[2024-11-08 15:14:14,683 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [155]
[2024-11-08 15:14:14,683 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [264]
[2024-11-08 15:14:14,684 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [305]
[2024-11-08 15:14:14,684 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [370]
[2024-11-08 15:14:14,684 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [569]
[2024-11-08 15:14:14,684 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [935]
[2024-11-08 15:14:14,684 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [944]
[2024-11-08 15:14:14,752 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product49.cil.c[18359,18372]
[2024-11-08 15:14:14,753 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 15:14:14,775 INFO L204 MainTranslator]: Completed translation
[2024-11-08 15:14:14,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:14 WrapperNode
[2024-11-08 15:14:14,776 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-08 15:14:14,777 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-08 15:14:14,777 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-08 15:14:14,777 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-08 15:14:14,784 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:14" (1/1) ...
[2024-11-08 15:14:14,797 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:14" (1/1) ...
[2024-11-08 15:14:14,825 INFO L138 Inliner]: procedures = 56, calls = 99, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 206
[2024-11-08 15:14:14,826 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-08 15:14:14,826 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-08 15:14:14,826 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-08 15:14:14,827 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-08 15:14:14,837 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:14" (1/1) ...
[2024-11-08 15:14:14,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:14" (1/1) ...
[2024-11-08 15:14:14,840 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:14" (1/1) ...
[2024-11-08 15:14:14,867 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-11-08 15:14:14,870 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:14" (1/1) ...
[2024-11-08 15:14:14,870 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:14" (1/1) ...
[2024-11-08 15:14:14,876 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:14" (1/1) ...
[2024-11-08 15:14:14,881 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:14" (1/1) ...
[2024-11-08 15:14:14,882 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:14" (1/1) ...
[2024-11-08 15:14:14,883 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:14" (1/1) ...
[2024-11-08 15:14:14,886 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-08 15:14:14,887 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-08 15:14:14,887 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-08 15:14:14,887 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-08 15:14:14,888 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:14" (1/1) ...
[2024-11-08 15:14:14,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 15:14:14,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 15:14:14,915 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-08 15:14:14,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-08 15:14:14,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-08 15:14:14,959 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base
[2024-11-08 15:14:14,960 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base
[2024-11-08 15:14:14,960 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical
[2024-11-08 15:14:14,960 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical
[2024-11-08 15:14:14,960 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift
[2024-11-08 15:14:14,960 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift
[2024-11-08 15:14:14,960 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup
[2024-11-08 15:14:14,960 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup
[2024-11-08 15:14:14,960 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor
[2024-11-08 15:14:14,960 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor
[2024-11-08 15:14:14,960 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise
[2024-11-08 15:14:14,961 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise
[2024-11-08 15:14:14,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-08 15:14:14,961 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel
[2024-11-08 15:14:14,961 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel
[2024-11-08 15:14:14,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-08 15:14:14,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-08 15:14:15,029 INFO L238 CfgBuilder]: Building ICFG
[2024-11-08 15:14:15,031 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-08 15:14:15,320 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live.
[2024-11-08 15:14:15,321 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-08 15:14:15,338 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-08 15:14:15,338 INFO L316 CfgBuilder]: Removed 2 assume(true) statements.
[2024-11-08 15:14:15,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:14:15 BoogieIcfgContainer
[2024-11-08 15:14:15,339 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-08 15:14:15,341 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-08 15:14:15,342 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-08 15:14:15,345 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-08 15:14:15,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:14:14" (1/3) ...
[2024-11-08 15:14:15,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f0d56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:14:15, skipping insertion in model container
[2024-11-08 15:14:15,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:14" (2/3) ...
[2024-11-08 15:14:15,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f0d56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:14:15, skipping insertion in model container
[2024-11-08 15:14:15,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:14:15" (3/3) ...
[2024-11-08 15:14:15,348 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product49.cil.c
[2024-11-08 15:14:15,367 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-08 15:14:15,367 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-08 15:14:15,432 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-08 15:14:15,438 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;@66b93c6b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-08 15:14:15,438 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-08 15:14:15,443 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 76 states have internal predecessors, (95), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11)
[2024-11-08 15:14:15,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2024-11-08 15:14:15,452 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 15:14:15,453 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 15:14:15,454 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 15:14:15,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 15:14:15,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1277571174, now seen corresponding path program 1 times
[2024-11-08 15:14:15,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 15:14:15,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799051181]
[2024-11-08 15:14:15,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 15:14:15,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 15:14:15,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:15,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-08 15:14:15,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:15,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 15:14:15,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 15:14:15,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799051181]
[2024-11-08 15:14:15,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799051181] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 15:14:15,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 15:14:15,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 15:14:15,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389806048]
[2024-11-08 15:14:15,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 15:14:15,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-08 15:14:15,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 15:14:15,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-08 15:14:15,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-08 15:14:15,707 INFO L87 Difference]: Start difference. First operand has 88 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 76 states have internal predecessors, (95), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) 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)
[2024-11-08 15:14:15,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 15:14:15,732 INFO L93 Difference]: Finished difference Result 167 states and 228 transitions.
[2024-11-08 15:14:15,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-08 15:14:15,735 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
[2024-11-08 15:14:15,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 15:14:15,742 INFO L225 Difference]: With dead ends: 167
[2024-11-08 15:14:15,742 INFO L226 Difference]: Without dead ends: 79
[2024-11-08 15:14:15,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-08 15:14:15,748 INFO L432 NwaCegarLoop]: 111 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, 111 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-08 15:14:15,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 15:14:15,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states.
[2024-11-08 15:14:15,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79.
[2024-11-08 15:14:15,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 68 states have internal predecessors, (81), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10)
[2024-11-08 15:14:15,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 102 transitions.
[2024-11-08 15:14:15,787 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 102 transitions. Word has length 25
[2024-11-08 15:14:15,787 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 15:14:15,788 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 102 transitions.
[2024-11-08 15:14:15,788 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)
[2024-11-08 15:14:15,788 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 102 transitions.
[2024-11-08 15:14:15,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2024-11-08 15:14:15,791 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 15:14:15,791 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 15:14:15,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-08 15:14:15,792 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 15:14:15,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 15:14:15,792 INFO L85 PathProgramCache]: Analyzing trace with hash -941221246, now seen corresponding path program 1 times
[2024-11-08 15:14:15,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 15:14:15,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327597475]
[2024-11-08 15:14:15,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 15:14:15,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 15:14:15,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:15,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-08 15:14:15,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:15,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 15:14:15,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 15:14:15,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327597475]
[2024-11-08 15:14:15,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327597475] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 15:14:15,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 15:14:15,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 15:14:15,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410151720]
[2024-11-08 15:14:15,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 15:14:15,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 15:14:15,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 15:14:15,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 15:14:15,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 15:14:15,920 INFO L87 Difference]: Start difference. First operand 79 states and 102 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-11-08 15:14:15,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 15:14:15,939 INFO L93 Difference]: Finished difference Result 123 states and 159 transitions.
[2024-11-08 15:14:15,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 15:14:15,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 26
[2024-11-08 15:14:15,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 15:14:15,942 INFO L225 Difference]: With dead ends: 123
[2024-11-08 15:14:15,943 INFO L226 Difference]: Without dead ends: 70
[2024-11-08 15:14:15,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 15:14:15,945 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 12 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-08 15:14:15,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 162 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 15:14:15,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states.
[2024-11-08 15:14:15,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70.
[2024-11-08 15:14:15,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 62 states have internal predecessors, (74), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8)
[2024-11-08 15:14:15,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 90 transitions.
[2024-11-08 15:14:15,960 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 90 transitions. Word has length 26
[2024-11-08 15:14:15,960 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 15:14:15,960 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 90 transitions.
[2024-11-08 15:14:15,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-11-08 15:14:15,961 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 90 transitions.
[2024-11-08 15:14:15,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2024-11-08 15:14:15,966 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 15:14:15,966 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 15:14:15,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-08 15:14:15,966 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 15:14:15,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 15:14:15,968 INFO L85 PathProgramCache]: Analyzing trace with hash -913943674, now seen corresponding path program 1 times
[2024-11-08 15:14:15,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 15:14:15,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951063242]
[2024-11-08 15:14:15,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 15:14:15,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 15:14:16,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:16,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20
[2024-11-08 15:14:16,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:16,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 15:14:16,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 15:14:16,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951063242]
[2024-11-08 15:14:16,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951063242] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 15:14:16,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 15:14:16,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-08 15:14:16,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310200677]
[2024-11-08 15:14:16,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 15:14:16,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-08 15:14:16,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 15:14:16,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-08 15:14:16,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-08 15:14:16,179 INFO L87 Difference]: Start difference. First operand 70 states and 90 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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)
[2024-11-08 15:14:16,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 15:14:16,282 INFO L93 Difference]: Finished difference Result 132 states and 173 transitions.
[2024-11-08 15:14:16,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-08 15:14:16,282 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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
[2024-11-08 15:14:16,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 15:14:16,284 INFO L225 Difference]: With dead ends: 132
[2024-11-08 15:14:16,284 INFO L226 Difference]: Without dead ends: 70
[2024-11-08 15:14:16,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-11-08 15:14:16,286 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 86 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-08 15:14:16,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 222 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-08 15:14:16,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states.
[2024-11-08 15:14:16,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70.
[2024-11-08 15:14:16,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.3272727272727274) internal successors, (73), 62 states have internal predecessors, (73), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8)
[2024-11-08 15:14:16,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions.
[2024-11-08 15:14:16,301 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 30
[2024-11-08 15:14:16,301 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 15:14:16,301 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions.
[2024-11-08 15:14:16,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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)
[2024-11-08 15:14:16,302 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions.
[2024-11-08 15:14:16,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2024-11-08 15:14:16,303 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 15:14:16,305 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 15:14:16,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-08 15:14:16,306 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 15:14:16,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 15:14:16,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1798308510, now seen corresponding path program 1 times
[2024-11-08 15:14:16,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 15:14:16,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527739992]
[2024-11-08 15:14:16,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 15:14:16,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 15:14:16,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:16,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20
[2024-11-08 15:14:16,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:16,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-08 15:14:16,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:16,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30
[2024-11-08 15:14:16,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:16,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 15:14:16,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 15:14:16,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527739992]
[2024-11-08 15:14:16,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527739992] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 15:14:16,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 15:14:16,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-08 15:14:16,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787069270]
[2024-11-08 15:14:16,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 15:14:16,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-08 15:14:16,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 15:14:16,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-08 15:14:16,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-08 15:14:16,445 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-08 15:14:16,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 15:14:16,660 INFO L93 Difference]: Finished difference Result 206 states and 264 transitions.
[2024-11-08 15:14:16,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-08 15:14:16,661 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), 3 states have call successors, (4), 3 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
[2024-11-08 15:14:16,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 15:14:16,673 INFO L225 Difference]: With dead ends: 206
[2024-11-08 15:14:16,673 INFO L226 Difference]: Without dead ends: 144
[2024-11-08 15:14:16,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-11-08 15:14:16,674 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 167 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-08 15:14:16,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 282 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-08 15:14:16,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states.
[2024-11-08 15:14:16,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 138.
[2024-11-08 15:14:16,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 107 states have (on average 1.2897196261682242) internal successors, (138), 114 states have internal predecessors, (138), 14 states have call successors, (14), 13 states have call predecessors, (14), 16 states have return successors, (19), 15 states have call predecessors, (19), 14 states have call successors, (19)
[2024-11-08 15:14:16,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 171 transitions.
[2024-11-08 15:14:16,725 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 171 transitions. Word has length 40
[2024-11-08 15:14:16,726 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 15:14:16,726 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 171 transitions.
[2024-11-08 15:14:16,726 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), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-08 15:14:16,726 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 171 transitions.
[2024-11-08 15:14:16,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2024-11-08 15:14:16,749 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 15:14:16,749 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 15:14:16,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-08 15:14:16,750 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 15:14:16,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 15:14:16,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1579167755, now seen corresponding path program 1 times
[2024-11-08 15:14:16,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 15:14:16,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507461210]
[2024-11-08 15:14:16,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 15:14:16,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 15:14:16,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:16,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20
[2024-11-08 15:14:16,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:16,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2024-11-08 15:14:16,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:16,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 15:14:16,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 15:14:16,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507461210]
[2024-11-08 15:14:16,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507461210] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 15:14:16,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 15:14:16,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-08 15:14:16,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574473406]
[2024-11-08 15:14:16,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 15:14:16,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-08 15:14:16,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 15:14:16,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-08 15:14:16,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-08 15:14:16,890 INFO L87 Difference]: Start difference. First operand 138 states and 171 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 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)
[2024-11-08 15:14:17,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 15:14:17,029 INFO L93 Difference]: Finished difference Result 273 states and 342 transitions.
[2024-11-08 15:14:17,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-08 15:14:17,030 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 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
[2024-11-08 15:14:17,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 15:14:17,032 INFO L225 Difference]: With dead ends: 273
[2024-11-08 15:14:17,032 INFO L226 Difference]: Without dead ends: 143
[2024-11-08 15:14:17,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-11-08 15:14:17,036 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 51 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-08 15:14:17,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 355 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-08 15:14:17,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states.
[2024-11-08 15:14:17,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141.
[2024-11-08 15:14:17,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 110 states have (on average 1.2818181818181817) internal successors, (141), 117 states have internal predecessors, (141), 14 states have call successors, (14), 13 states have call predecessors, (14), 16 states have return successors, (19), 15 states have call predecessors, (19), 14 states have call successors, (19)
[2024-11-08 15:14:17,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 174 transitions.
[2024-11-08 15:14:17,057 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 174 transitions. Word has length 44
[2024-11-08 15:14:17,057 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 15:14:17,058 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 174 transitions.
[2024-11-08 15:14:17,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 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)
[2024-11-08 15:14:17,058 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 174 transitions.
[2024-11-08 15:14:17,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2024-11-08 15:14:17,060 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 15:14:17,060 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 15:14:17,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-08 15:14:17,061 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 15:14:17,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 15:14:17,062 INFO L85 PathProgramCache]: Analyzing trace with hash -109775987, now seen corresponding path program 1 times
[2024-11-08 15:14:17,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 15:14:17,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844434815]
[2024-11-08 15:14:17,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 15:14:17,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 15:14:17,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:17,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20
[2024-11-08 15:14:17,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:17,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2024-11-08 15:14:17,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:17,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 15:14:17,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 15:14:17,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844434815]
[2024-11-08 15:14:17,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844434815] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 15:14:17,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 15:14:17,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-08 15:14:17,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487819150]
[2024-11-08 15:14:17,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 15:14:17,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-08 15:14:17,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 15:14:17,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-08 15:14:17,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-08 15:14:17,143 INFO L87 Difference]: Start difference. First operand 141 states and 174 transitions. Second operand has 5 states, 5 states have (on average 7.8) 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)
[2024-11-08 15:14:17,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 15:14:17,255 INFO L93 Difference]: Finished difference Result 278 states and 350 transitions.
[2024-11-08 15:14:17,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-08 15:14:17,255 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) 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
[2024-11-08 15:14:17,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 15:14:17,258 INFO L225 Difference]: With dead ends: 278
[2024-11-08 15:14:17,261 INFO L226 Difference]: Without dead ends: 145
[2024-11-08 15:14:17,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-11-08 15:14:17,262 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 50 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-08 15:14:17,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 278 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-08 15:14:17,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states.
[2024-11-08 15:14:17,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143.
[2024-11-08 15:14:17,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 112 states have (on average 1.2767857142857142) internal successors, (143), 119 states have internal predecessors, (143), 14 states have call successors, (14), 13 states have call predecessors, (14), 16 states have return successors, (19), 15 states have call predecessors, (19), 14 states have call successors, (19)
[2024-11-08 15:14:17,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 176 transitions.
[2024-11-08 15:14:17,278 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 176 transitions. Word has length 44
[2024-11-08 15:14:17,278 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 15:14:17,278 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 176 transitions.
[2024-11-08 15:14:17,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) 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)
[2024-11-08 15:14:17,279 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 176 transitions.
[2024-11-08 15:14:17,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2024-11-08 15:14:17,280 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 15:14:17,280 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 15:14:17,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-08 15:14:17,280 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 15:14:17,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 15:14:17,281 INFO L85 PathProgramCache]: Analyzing trace with hash 312925839, now seen corresponding path program 1 times
[2024-11-08 15:14:17,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 15:14:17,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058329091]
[2024-11-08 15:14:17,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 15:14:17,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 15:14:17,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:17,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20
[2024-11-08 15:14:17,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:17,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2024-11-08 15:14:17,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:17,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 15:14:17,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 15:14:17,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058329091]
[2024-11-08 15:14:17,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058329091] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 15:14:17,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 15:14:17,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-08 15:14:17,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778184139]
[2024-11-08 15:14:17,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 15:14:17,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-08 15:14:17,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 15:14:17,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-08 15:14:17,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-08 15:14:17,385 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), 4 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-08 15:14:17,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 15:14:17,580 INFO L93 Difference]: Finished difference Result 400 states and 514 transitions.
[2024-11-08 15:14:17,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-08 15:14:17,581 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44
[2024-11-08 15:14:17,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 15:14:17,583 INFO L225 Difference]: With dead ends: 400
[2024-11-08 15:14:17,583 INFO L226 Difference]: Without dead ends: 265
[2024-11-08 15:14:17,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-11-08 15:14:17,588 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 200 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-08 15:14:17,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 287 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-08 15:14:17,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states.
[2024-11-08 15:14:17,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 257.
[2024-11-08 15:14:17,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 198 states have (on average 1.2676767676767677) internal successors, (251), 209 states have internal predecessors, (251), 29 states have call successors, (29), 28 states have call predecessors, (29), 29 states have return successors, (44), 29 states have call predecessors, (44), 29 states have call successors, (44)
[2024-11-08 15:14:17,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 324 transitions.
[2024-11-08 15:14:17,627 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 324 transitions. Word has length 44
[2024-11-08 15:14:17,628 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 15:14:17,628 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 324 transitions.
[2024-11-08 15:14:17,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-08 15:14:17,628 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 324 transitions.
[2024-11-08 15:14:17,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47
[2024-11-08 15:14:17,631 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 15:14:17,631 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 15:14:17,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-08 15:14:17,631 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 15:14:17,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 15:14:17,632 INFO L85 PathProgramCache]: Analyzing trace with hash 299238822, now seen corresponding path program 1 times
[2024-11-08 15:14:17,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 15:14:17,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288681333]
[2024-11-08 15:14:17,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 15:14:17,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 15:14:17,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:17,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20
[2024-11-08 15:14:17,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:17,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2024-11-08 15:14:17,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:17,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36
[2024-11-08 15:14:17,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:17,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 15:14:17,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 15:14:17,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288681333]
[2024-11-08 15:14:17,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288681333] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 15:14:17,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 15:14:17,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-08 15:14:17,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487122616]
[2024-11-08 15:14:17,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 15:14:17,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-08 15:14:17,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 15:14:17,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-08 15:14:17,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-08 15:14:17,758 INFO L87 Difference]: Start difference. First operand 257 states and 324 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2024-11-08 15:14:17,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 15:14:17,939 INFO L93 Difference]: Finished difference Result 504 states and 642 transitions.
[2024-11-08 15:14:17,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-11-08 15:14:17,942 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46
[2024-11-08 15:14:17,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 15:14:17,945 INFO L225 Difference]: With dead ends: 504
[2024-11-08 15:14:17,945 INFO L226 Difference]: Without dead ends: 255
[2024-11-08 15:14:17,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110
[2024-11-08 15:14:17,948 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 103 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-08 15:14:17,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 295 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-08 15:14:17,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states.
[2024-11-08 15:14:17,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 253.
[2024-11-08 15:14:17,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 194 states have (on average 1.231958762886598) internal successors, (239), 205 states have internal predecessors, (239), 29 states have call successors, (29), 28 states have call predecessors, (29), 29 states have return successors, (44), 29 states have call predecessors, (44), 29 states have call successors, (44)
[2024-11-08 15:14:17,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 312 transitions.
[2024-11-08 15:14:17,983 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 312 transitions. Word has length 46
[2024-11-08 15:14:17,983 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 15:14:17,983 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 312 transitions.
[2024-11-08 15:14:17,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2024-11-08 15:14:17,984 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 312 transitions.
[2024-11-08 15:14:17,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49
[2024-11-08 15:14:17,985 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 15:14:17,985 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 15:14:17,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-08 15:14:17,985 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 15:14:17,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 15:14:17,986 INFO L85 PathProgramCache]: Analyzing trace with hash 657916201, now seen corresponding path program 1 times
[2024-11-08 15:14:17,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 15:14:17,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005519860]
[2024-11-08 15:14:17,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 15:14:17,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 15:14:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:18,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2024-11-08 15:14:18,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:18,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24
[2024-11-08 15:14:18,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:18,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38
[2024-11-08 15:14:18,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:18,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 15:14:18,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 15:14:18,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005519860]
[2024-11-08 15:14:18,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005519860] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 15:14:18,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 15:14:18,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-08 15:14:18,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436537237]
[2024-11-08 15:14:18,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 15:14:18,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-08 15:14:18,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 15:14:18,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-08 15:14:18,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-08 15:14:18,061 INFO L87 Difference]: Start difference. First operand 253 states and 312 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2024-11-08 15:14:18,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 15:14:18,323 INFO L93 Difference]: Finished difference Result 470 states and 595 transitions.
[2024-11-08 15:14:18,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-11-08 15:14:18,324 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48
[2024-11-08 15:14:18,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 15:14:18,328 INFO L225 Difference]: With dead ends: 470
[2024-11-08 15:14:18,329 INFO L226 Difference]: Without dead ends: 468
[2024-11-08 15:14:18,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2024-11-08 15:14:18,330 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 279 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-08 15:14:18,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 221 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-08 15:14:18,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states.
[2024-11-08 15:14:18,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 428.
[2024-11-08 15:14:18,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 331 states have (on average 1.2356495468277946) internal successors, (409), 352 states have internal predecessors, (409), 48 states have call successors, (48), 42 states have call predecessors, (48), 48 states have return successors, (90), 47 states have call predecessors, (90), 48 states have call successors, (90)
[2024-11-08 15:14:18,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 547 transitions.
[2024-11-08 15:14:18,376 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 547 transitions. Word has length 48
[2024-11-08 15:14:18,377 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 15:14:18,377 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 547 transitions.
[2024-11-08 15:14:18,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2024-11-08 15:14:18,377 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 547 transitions.
[2024-11-08 15:14:18,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2024-11-08 15:14:18,379 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 15:14:18,379 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 15:14:18,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-08 15:14:18,380 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 15:14:18,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 15:14:18,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1908194548, now seen corresponding path program 1 times
[2024-11-08 15:14:18,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 15:14:18,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420643892]
[2024-11-08 15:14:18,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 15:14:18,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 15:14:18,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:18,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2024-11-08 15:14:18,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:18,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20
[2024-11-08 15:14:18,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:18,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3
[2024-11-08 15:14:18,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:18,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-08 15:14:18,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:18,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-11-08 15:14:18,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:18,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76
[2024-11-08 15:14:18,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:18,570 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2024-11-08 15:14:18,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 15:14:18,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420643892]
[2024-11-08 15:14:18,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420643892] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 15:14:18,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42284938]
[2024-11-08 15:14:18,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 15:14:18,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 15:14:18,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 15:14:18,573 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 15:14:18,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-08 15:14:18,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:18,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-08 15:14:18,678 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 15:14:18,750 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 15:14:18,751 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 15:14:18,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42284938] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 15:14:18,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-08 15:14:18,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 9
[2024-11-08 15:14:18,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435424552]
[2024-11-08 15:14:18,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 15:14:18,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 15:14:18,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 15:14:18,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 15:14:18,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-11-08 15:14:18,753 INFO L87 Difference]: Start difference. First operand 428 states and 547 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6)
[2024-11-08 15:14:18,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 15:14:18,800 INFO L93 Difference]: Finished difference Result 751 states and 975 transitions.
[2024-11-08 15:14:18,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 15:14:18,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 86
[2024-11-08 15:14:18,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 15:14:18,803 INFO L225 Difference]: With dead ends: 751
[2024-11-08 15:14:18,803 INFO L226 Difference]: Without dead ends: 379
[2024-11-08 15:14:18,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-11-08 15:14:18,806 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 38 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-08 15:14:18,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 191 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 15:14:18,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states.
[2024-11-08 15:14:18,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379.
[2024-11-08 15:14:18,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 293 states have (on average 1.2320819112627985) internal successors, (361), 312 states have internal predecessors, (361), 43 states have call successors, (43), 37 states have call predecessors, (43), 42 states have return successors, (68), 43 states have call predecessors, (68), 43 states have call successors, (68)
[2024-11-08 15:14:18,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 472 transitions.
[2024-11-08 15:14:18,839 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 472 transitions. Word has length 86
[2024-11-08 15:14:18,840 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 15:14:18,840 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 472 transitions.
[2024-11-08 15:14:18,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6)
[2024-11-08 15:14:18,840 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 472 transitions.
[2024-11-08 15:14:18,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90
[2024-11-08 15:14:18,842 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 15:14:18,842 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 15:14:18,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-11-08 15:14:19,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9
[2024-11-08 15:14:19,043 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 15:14:19,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 15:14:19,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1350194604, now seen corresponding path program 1 times
[2024-11-08 15:14:19,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 15:14:19,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693010794]
[2024-11-08 15:14:19,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 15:14:19,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 15:14:19,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:19,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2024-11-08 15:14:19,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:19,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20
[2024-11-08 15:14:19,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:19,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3
[2024-11-08 15:14:19,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:19,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-08 15:14:19,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:19,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69
[2024-11-08 15:14:19,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:19,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-08 15:14:19,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:19,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79
[2024-11-08 15:14:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:19,239 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-11-08 15:14:19,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 15:14:19,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693010794]
[2024-11-08 15:14:19,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693010794] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 15:14:19,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388214630]
[2024-11-08 15:14:19,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 15:14:19,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 15:14:19,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 15:14:19,249 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 15:14:19,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-11-08 15:14:19,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:19,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 11 conjuncts are in the unsatisfiable core
[2024-11-08 15:14:19,352 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 15:14:19,527 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked.
[2024-11-08 15:14:19,527 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 15:14:19,656 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2024-11-08 15:14:19,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388214630] provided 1 perfect and 1 imperfect interpolant sequences
[2024-11-08 15:14:19,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2024-11-08 15:14:19,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 5] total 14
[2024-11-08 15:14:19,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432752549]
[2024-11-08 15:14:19,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 15:14:19,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-08 15:14:19,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 15:14:19,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-08 15:14:19,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182
[2024-11-08 15:14:19,660 INFO L87 Difference]: Start difference. First operand 379 states and 472 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7)
[2024-11-08 15:14:19,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 15:14:19,782 INFO L93 Difference]: Finished difference Result 1061 states and 1357 transitions.
[2024-11-08 15:14:19,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-08 15:14:19,783 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 89
[2024-11-08 15:14:19,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 15:14:19,787 INFO L225 Difference]: With dead ends: 1061
[2024-11-08 15:14:19,788 INFO L226 Difference]: Without dead ends: 690
[2024-11-08 15:14:19,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 183 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240
[2024-11-08 15:14:19,790 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 47 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-08 15:14:19,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 397 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 15:14:19,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states.
[2024-11-08 15:14:19,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 640.
[2024-11-08 15:14:19,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 488 states have (on average 1.2008196721311475) internal successors, (586), 522 states have internal predecessors, (586), 75 states have call successors, (75), 65 states have call predecessors, (75), 76 states have return successors, (119), 75 states have call predecessors, (119), 75 states have call successors, (119)
[2024-11-08 15:14:19,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 780 transitions.
[2024-11-08 15:14:19,846 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 780 transitions. Word has length 89
[2024-11-08 15:14:19,846 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 15:14:19,846 INFO L471 AbstractCegarLoop]: Abstraction has 640 states and 780 transitions.
[2024-11-08 15:14:19,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7)
[2024-11-08 15:14:19,847 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 780 transitions.
[2024-11-08 15:14:19,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94
[2024-11-08 15:14:19,848 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 15:14:19,848 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 15:14:19,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2024-11-08 15:14:20,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10
[2024-11-08 15:14:20,049 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 15:14:20,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 15:14:20,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1128084440, now seen corresponding path program 1 times
[2024-11-08 15:14:20,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 15:14:20,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172299774]
[2024-11-08 15:14:20,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 15:14:20,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 15:14:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:20,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2024-11-08 15:14:20,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:20,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-08 15:14:20,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:20,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24
[2024-11-08 15:14:20,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:20,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3
[2024-11-08 15:14:20,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:20,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-08 15:14:20,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:20,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-11-08 15:14:20,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:20,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-08 15:14:20,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:20,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83
[2024-11-08 15:14:20,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:20,307 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-11-08 15:14:20,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 15:14:20,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172299774]
[2024-11-08 15:14:20,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172299774] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 15:14:20,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636568413]
[2024-11-08 15:14:20,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 15:14:20,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 15:14:20,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 15:14:20,310 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 15:14:20,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-11-08 15:14:20,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:20,410 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 11 conjuncts are in the unsatisfiable core
[2024-11-08 15:14:20,419 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 15:14:20,491 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 15:14:20,492 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 15:14:20,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636568413] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 15:14:20,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-08 15:14:20,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 11
[2024-11-08 15:14:20,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777393636]
[2024-11-08 15:14:20,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 15:14:20,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-08 15:14:20,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 15:14:20,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-08 15:14:20,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-11-08 15:14:20,495 INFO L87 Difference]: Start difference. First operand 640 states and 780 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8)
[2024-11-08 15:14:20,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 15:14:20,648 INFO L93 Difference]: Finished difference Result 1515 states and 1928 transitions.
[2024-11-08 15:14:20,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-08 15:14:20,649 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 93
[2024-11-08 15:14:20,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 15:14:20,655 INFO L225 Difference]: With dead ends: 1515
[2024-11-08 15:14:20,655 INFO L226 Difference]: Without dead ends: 977
[2024-11-08 15:14:20,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156
[2024-11-08 15:14:20,658 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 106 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-08 15:14:20,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 523 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-08 15:14:20,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states.
[2024-11-08 15:14:20,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 903.
[2024-11-08 15:14:20,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 903 states, 686 states have (on average 1.2011661807580174) internal successors, (824), 733 states have internal predecessors, (824), 107 states have call successors, (107), 95 states have call predecessors, (107), 109 states have return successors, (173), 102 states have call predecessors, (173), 107 states have call successors, (173)
[2024-11-08 15:14:20,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1104 transitions.
[2024-11-08 15:14:20,761 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1104 transitions. Word has length 93
[2024-11-08 15:14:20,763 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 15:14:20,763 INFO L471 AbstractCegarLoop]: Abstraction has 903 states and 1104 transitions.
[2024-11-08 15:14:20,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8)
[2024-11-08 15:14:20,764 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1104 transitions.
[2024-11-08 15:14:20,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94
[2024-11-08 15:14:20,766 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 15:14:20,766 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 15:14:20,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-11-08 15:14:20,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 15:14:20,967 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 15:14:20,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 15:14:20,969 INFO L85 PathProgramCache]: Analyzing trace with hash 994070934, now seen corresponding path program 1 times
[2024-11-08 15:14:20,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 15:14:20,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102133176]
[2024-11-08 15:14:20,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 15:14:20,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 15:14:20,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:21,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2024-11-08 15:14:21,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:21,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-11-08 15:14:21,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:21,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24
[2024-11-08 15:14:21,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:21,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3
[2024-11-08 15:14:21,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:21,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2024-11-08 15:14:21,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:21,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-11-08 15:14:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:21,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-11-08 15:14:21,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:21,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83
[2024-11-08 15:14:21,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:21,095 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2024-11-08 15:14:21,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 15:14:21,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102133176]
[2024-11-08 15:14:21,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102133176] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 15:14:21,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608593653]
[2024-11-08 15:14:21,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 15:14:21,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 15:14:21,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 15:14:21,098 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 15:14:21,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-11-08 15:14:21,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:21,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-08 15:14:21,194 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 15:14:21,234 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2024-11-08 15:14:21,234 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 15:14:21,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608593653] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 15:14:21,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-08 15:14:21,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12
[2024-11-08 15:14:21,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610837037]
[2024-11-08 15:14:21,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 15:14:21,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-08 15:14:21,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 15:14:21,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-08 15:14:21,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132
[2024-11-08 15:14:21,237 INFO L87 Difference]: Start difference. First operand 903 states and 1104 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8)
[2024-11-08 15:14:21,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 15:14:21,283 INFO L93 Difference]: Finished difference Result 1237 states and 1508 transitions.
[2024-11-08 15:14:21,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-08 15:14:21,283 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 93
[2024-11-08 15:14:21,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 15:14:21,285 INFO L225 Difference]: With dead ends: 1237
[2024-11-08 15:14:21,285 INFO L226 Difference]: Without dead ends: 0
[2024-11-08 15:14:21,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132
[2024-11-08 15:14:21,288 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-08 15:14:21,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 299 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 15:14:21,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2024-11-08 15:14:21,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2024-11-08 15:14:21,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 15:14:21,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2024-11-08 15:14:21,291 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 93
[2024-11-08 15:14:21,291 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 15:14:21,291 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2024-11-08 15:14:21,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8)
[2024-11-08 15:14:21,291 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2024-11-08 15:14:21,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2024-11-08 15:14:21,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-08 15:14:21,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-11-08 15:14:21,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 15:14:21,501 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 15:14:21,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2024-11-08 15:14:23,999 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-08 15:14:24,029 WARN L156 FloydHoareUtils]: Requires clause for changeMethaneLevel contained old-variable. Original clause: (let ((.cse0 (= ~methAndRunningLastTime~0 0))) (and (or (not (= |old(~methaneLevelCritical~0)| 0)) (= ~methaneLevelCritical~0 0) (not .cse0)) (let ((.cse1 (= ~pumpRunning~0 0)) (.cse3 (<= 2 ~waterLevel~0)) (.cse2 (= 1 ~systemActive~0))) (or (and .cse1 .cse0 .cse2 (= ~waterLevel~0 1)) (and (<= 1 ~pumpRunning~0) .cse3 .cse2) (and .cse1 .cse0 .cse3 .cse2))))) Eliminated clause: (let ((.cse0 (= ~pumpRunning~0 0)) (.cse1 (= ~methAndRunningLastTime~0 0)) (.cse3 (<= 2 ~waterLevel~0)) (.cse2 (= 1 ~systemActive~0))) (or (and .cse0 .cse1 .cse2 (= ~waterLevel~0 1)) (and (<= 1 ~pumpRunning~0) .cse3 .cse2) (and .cse0 .cse1 .cse3 .cse2)))
[2024-11-08 15:14:24,034 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception:
java.lang.IllegalStateException: Variable |isMethaneLevelCritical_#res| not permitted in ensures for changeMethaneLevel: (let ((.cse0 (= ~methAndRunningLastTime~0 0))) (and (or (not (= |old(~methaneLevelCritical~0)| 0)) (not (= ~methaneLevelCritical~0 0)) (= |isMethaneLevelCritical_#res| 0) (not .cse0)) (let ((.cse1 (= ~pumpRunning~0 0)) (.cse3 (<= 2 ~waterLevel~0)) (.cse2 (= 1 ~systemActive~0))) (or (and .cse1 .cse0 .cse2 (= ~waterLevel~0 1)) (and (<= 1 ~pumpRunning~0) .cse3 .cse2) (and .cse1 .cse0 .cse3 .cse2)))))
at de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.FloydHoareUtils.checkPermissibleVariables(FloydHoareUtils.java:204)
at de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.FloydHoareUtils.createProcedureContractResults(FloydHoareUtils.java:169)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:199)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.<init>(TraceAbstractionStarter.java:143)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319)
at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145)
at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63)
[2024-11-08 15:14:24,039 INFO L158 Benchmark]: Toolchain (without parser) took 9777.98ms. Allocated memory was 140.5MB in the beginning and 232.8MB in the end (delta: 92.3MB). Free memory was 84.0MB in the beginning and 134.0MB in the end (delta: -49.9MB). Peak memory consumption was 113.9MB. Max. memory is 16.1GB.
[2024-11-08 15:14:24,039 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 140.5MB. Free memory is still 104.9MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 15:14:24,039 INFO L158 Benchmark]: CACSL2BoogieTranslator took 514.67ms. Allocated memory is still 140.5MB. Free memory was 83.5MB in the beginning and 62.0MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB.
[2024-11-08 15:14:24,039 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.57ms. Allocated memory is still 140.5MB. Free memory was 62.0MB in the beginning and 59.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-11-08 15:14:24,039 INFO L158 Benchmark]: Boogie Preprocessor took 59.89ms. Allocated memory is still 140.5MB. Free memory was 59.5MB in the beginning and 57.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-11-08 15:14:24,040 INFO L158 Benchmark]: RCFGBuilder took 452.17ms. Allocated memory was 140.5MB in the beginning and 192.9MB in the end (delta: 52.4MB). Free memory was 57.4MB in the beginning and 161.7MB in the end (delta: -104.3MB). Peak memory consumption was 27.7MB. Max. memory is 16.1GB.
[2024-11-08 15:14:24,040 INFO L158 Benchmark]: TraceAbstraction took 8696.62ms. Allocated memory was 192.9MB in the beginning and 232.8MB in the end (delta: 39.8MB). Free memory was 160.7MB in the beginning and 134.0MB in the end (delta: 26.7MB). Peak memory consumption was 136.5MB. Max. memory is 16.1GB.
[2024-11-08 15:14:24,041 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.18ms. Allocated memory is still 140.5MB. Free memory is still 104.9MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 514.67ms. Allocated memory is still 140.5MB. Free memory was 83.5MB in the beginning and 62.0MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 48.57ms. Allocated memory is still 140.5MB. Free memory was 62.0MB in the beginning and 59.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 59.89ms. Allocated memory is still 140.5MB. Free memory was 59.5MB in the beginning and 57.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 452.17ms. Allocated memory was 140.5MB in the beginning and 192.9MB in the end (delta: 52.4MB). Free memory was 57.4MB in the beginning and 161.7MB in the end (delta: -104.3MB). Peak memory consumption was 27.7MB. Max. memory is 16.1GB.
* TraceAbstraction took 8696.62ms. Allocated memory was 192.9MB in the beginning and 232.8MB in the end (delta: 39.8MB). Free memory was 160.7MB in the beginning and 134.0MB in the end (delta: 26.7MB). Peak memory consumption was 136.5MB. 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,"Test.i","") [49]
- GenericResultAtLocation [Line: 155]: Unsoundness Warning
Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [155]
- GenericResultAtLocation [Line: 264]: Unsoundness Warning
Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [264]
- GenericResultAtLocation [Line: 305]: Unsoundness Warning
Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [305]
- GenericResultAtLocation [Line: 370]: Unsoundness Warning
Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [370]
- GenericResultAtLocation [Line: 569]: Unsoundness Warning
Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [569]
- GenericResultAtLocation [Line: 935]: Unsoundness Warning
Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [935]
- GenericResultAtLocation [Line: 944]: Unsoundness Warning
Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [944]
* 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: 940]: 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, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1164 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1139 mSDsluCounter, 3623 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2373 mSDsCounter, 219 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 841 IncrementalHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 219 mSolverCounterUnsat, 1250 mSDtfsCounter, 841 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 642 GetRequests, 551 SyntacticMatches, 3 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=903occurred in iteration=12, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 184 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1069 NumberOfCodeBlocks, 1069 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1140 ConstructedInterpolants, 0 QuantifiedInterpolants, 2117 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1235 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 18 InterpolantComputations, 13 PerfectInterpolantSequences, 247/259 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
- AllSpecificationsHoldResult: All specifications hold
1 specifications checked. All of them hold
- InvariantResult [Line: 315]: Location Invariant
Derived location invariant: 0
- InvariantResult [Line: 316]: Loop Invariant
Derived loop invariant: (((((1 <= pumpRunning) && (2 <= waterLevel)) && (1 == systemActive)) && (splverifierCounter == 0)) || (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 == systemActive)) && (splverifierCounter == 0)) && (1 <= waterLevel)))
- InvariantResult [Line: 62]: Loop Invariant
Derived loop invariant: 0
- ProcedureContractResult [Line: 400]: Procedure Contract for processEnvironment__wrappee__base
Derived contract for procedure processEnvironment__wrappee__base. Requires: (((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 == systemActive)) && (waterLevel == 1)) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (2 <= waterLevel)) && (1 == systemActive))) Ensures: ((((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (1 == systemActive)) && (waterLevel == 1)) || ((((pumpRunning == 0) && (methAndRunningLastTime == 0)) && (2 <= waterLevel)) && (1 == systemActive))) && (((((((cleanupTimeShifts == \old(cleanupTimeShifts)) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (methAndRunningLastTime == \old(methAndRunningLastTime))) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (head == \old(head))))
- ExceptionOrErrorResult: IllegalStateException: Variable |isMethaneLevelCritical_#res| not permitted in ensures for changeMethaneLevel: (let ((.cse0 (= ~methAndRunningLastTime~0 0))) (and (or (not (= |old(~methaneLevelCritical~0)| 0)) (not (= ~methaneLevelCritical~0 0)) (= |isMethaneLevelCritical_#res| 0) (not .cse0)) (let ((.cse1 (= ~pumpRunning~0 0)) (.cse3 (<= 2 ~waterLevel~0)) (.cse2 (= 1 ~systemActive~0))) (or (and .cse1 .cse0 .cse2 (= ~waterLevel~0 1)) (and (<= 1 ~pumpRunning~0) .cse3 .cse2) (and .cse1 .cse0 .cse3 .cse2)))))
de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: Variable |isMethaneLevelCritical_#res| not permitted in ensures for changeMethaneLevel: (let ((.cse0 (= ~methAndRunningLastTime~0 0))) (and (or (not (= |old(~methaneLevelCritical~0)| 0)) (not (= ~methaneLevelCritical~0 0)) (= |isMethaneLevelCritical_#res| 0) (not .cse0)) (let ((.cse1 (= ~pumpRunning~0 0)) (.cse3 (<= 2 ~waterLevel~0)) (.cse2 (= 1 ~systemActive~0))) (or (and .cse1 .cse0 .cse2 (= ~waterLevel~0 1)) (and (<= 1 ~pumpRunning~0) .cse3 .cse2) (and .cse1 .cse0 .cse3 .cse2))))): de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.FloydHoareUtils.checkPermissibleVariables(FloydHoareUtils.java:204)
RESULT: Ultimate could not prove your program: Toolchain returned no result.
[2024-11-08 15:14:24,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Using bit-precise analysis
Retrying with bit-precise analysis
### Bit-precise run ###
Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/minepump_spec2_product49.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8ebbbe9395fd7f6497497f0e6f84282075bb296e20acc9821d0fb2d7075b331d
--- Real Ultimate output ---
This is Ultimate 0.2.5-?-c7c6ca5-m
[2024-11-08 15:14:26,244 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-08 15:14:26,315 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2024-11-08 15:14:26,322 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-08 15:14:26,325 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-08 15:14:26,358 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-08 15:14:26,359 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-08 15:14:26,359 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-08 15:14:26,360 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-08 15:14:26,360 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-08 15:14:26,360 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-08 15:14:26,360 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-08 15:14:26,362 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-08 15:14:26,365 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-08 15:14:26,365 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-08 15:14:26,366 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-08 15:14:26,366 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-08 15:14:26,366 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-08 15:14:26,366 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-08 15:14:26,367 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-08 15:14:26,367 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-08 15:14:26,368 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-08 15:14:26,368 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-08 15:14:26,368 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-08 15:14:26,368 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-11-08 15:14:26,369 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-08 15:14:26,369 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-08 15:14:26,369 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-08 15:14:26,370 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-08 15:14:26,370 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-08 15:14:26,370 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-08 15:14:26,371 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-08 15:14:26,371 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-08 15:14:26,372 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-08 15:14:26,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 15:14:26,372 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-08 15:14:26,373 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-08 15:14:26,373 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-08 15:14:26,373 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF
[2024-11-08 15:14:26,374 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-08 15:14:26,374 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-08 15:14:26,374 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-08 15:14:26,374 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-08 15:14:26,374 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-08 15:14:26,375 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8ebbbe9395fd7f6497497f0e6f84282075bb296e20acc9821d0fb2d7075b331d
[2024-11-08 15:14:26,672 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-08 15:14:26,692 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-08 15:14:26,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-08 15:14:26,697 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-08 15:14:26,698 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-08 15:14:26,699 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/minepump_spec2_product49.cil.c
[2024-11-08 15:14:28,336 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-08 15:14:28,567 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-08 15:14:28,567 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product49.cil.c
[2024-11-08 15:14:28,588 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/226cb1a36/1158dd2adc884ccc8e50e3781b3983c5/FLAG588fdc55d
[2024-11-08 15:14:28,917 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/226cb1a36/1158dd2adc884ccc8e50e3781b3983c5
[2024-11-08 15:14:28,919 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-08 15:14:28,920 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-08 15:14:28,922 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-08 15:14:28,922 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-08 15:14:28,927 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-08 15:14:28,927 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:14:28" (1/1) ...
[2024-11-08 15:14:28,928 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2edab700 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:28, skipping insertion in model container
[2024-11-08 15:14:28,928 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:14:28" (1/1) ...
[2024-11-08 15:14:28,978 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-08 15:14:29,249 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-08 15:14:29,251 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-08 15:14:29,262 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-08 15:14:29,267 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-08 15:14:29,273 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-08 15:14:29,288 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-08 15:14:29,289 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-08 15:14:29,293 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-08 15:14:29,296 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model
[2024-11-08 15:14:29,308 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product49.cil.c[18359,18372]
[2024-11-08 15:14:29,313 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 15:14:29,328 INFO L200 MainTranslator]: Completed pre-run
[2024-11-08 15:14:29,337 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [49]
[2024-11-08 15:14:29,338 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [155]
[2024-11-08 15:14:29,338 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [264]
[2024-11-08 15:14:29,338 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [305]
[2024-11-08 15:14:29,339 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [370]
[2024-11-08 15:14:29,339 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [569]
[2024-11-08 15:14:29,339 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [935]
[2024-11-08 15:14:29,339 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [944]
[2024-11-08 15:14:29,418 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/minepump_spec2_product49.cil.c[18359,18372]
[2024-11-08 15:14:29,419 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 15:14:29,446 INFO L204 MainTranslator]: Completed translation
[2024-11-08 15:14:29,447 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:29 WrapperNode
[2024-11-08 15:14:29,447 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-08 15:14:29,448 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-08 15:14:29,448 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-08 15:14:29,448 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-08 15:14:29,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:29" (1/1) ...
[2024-11-08 15:14:29,472 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:29" (1/1) ...
[2024-11-08 15:14:29,509 INFO L138 Inliner]: procedures = 58, calls = 99, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 195
[2024-11-08 15:14:29,509 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-08 15:14:29,510 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-08 15:14:29,511 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-08 15:14:29,511 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-08 15:14:29,521 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:29" (1/1) ...
[2024-11-08 15:14:29,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:29" (1/1) ...
[2024-11-08 15:14:29,526 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:29" (1/1) ...
[2024-11-08 15:14:29,553 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-11-08 15:14:29,557 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:29" (1/1) ...
[2024-11-08 15:14:29,558 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:29" (1/1) ...
[2024-11-08 15:14:29,574 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:29" (1/1) ...
[2024-11-08 15:14:29,583 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:29" (1/1) ...
[2024-11-08 15:14:29,585 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:29" (1/1) ...
[2024-11-08 15:14:29,590 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:29" (1/1) ...
[2024-11-08 15:14:29,592 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-08 15:14:29,593 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-08 15:14:29,597 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-08 15:14:29,597 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-08 15:14:29,598 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:29" (1/1) ...
[2024-11-08 15:14:29,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 15:14:29,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 15:14:29,639 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-08 15:14:29,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-08 15:14:29,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-08 15:14:29,697 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__base
[2024-11-08 15:14:29,697 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__base
[2024-11-08 15:14:29,697 INFO L130 BoogieDeclarations]: Found specification of procedure isMethaneLevelCritical
[2024-11-08 15:14:29,698 INFO L138 BoogieDeclarations]: Found implementation of procedure isMethaneLevelCritical
[2024-11-08 15:14:29,698 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift
[2024-11-08 15:14:29,699 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift
[2024-11-08 15:14:29,699 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup
[2024-11-08 15:14:29,699 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup
[2024-11-08 15:14:29,699 INFO L130 BoogieDeclarations]: Found specification of procedure processEnvironment__wrappee__highWaterSensor
[2024-11-08 15:14:29,701 INFO L138 BoogieDeclarations]: Found implementation of procedure processEnvironment__wrappee__highWaterSensor
[2024-11-08 15:14:29,701 INFO L130 BoogieDeclarations]: Found specification of procedure waterRise
[2024-11-08 15:14:29,701 INFO L138 BoogieDeclarations]: Found implementation of procedure waterRise
[2024-11-08 15:14:29,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-08 15:14:29,701 INFO L130 BoogieDeclarations]: Found specification of procedure changeMethaneLevel
[2024-11-08 15:14:29,701 INFO L138 BoogieDeclarations]: Found implementation of procedure changeMethaneLevel
[2024-11-08 15:14:29,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-08 15:14:29,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-08 15:14:29,787 INFO L238 CfgBuilder]: Building ICFG
[2024-11-08 15:14:29,789 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-08 15:14:30,140 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live.
[2024-11-08 15:14:30,140 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-08 15:14:30,155 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-08 15:14:30,155 INFO L316 CfgBuilder]: Removed 2 assume(true) statements.
[2024-11-08 15:14:30,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:14:30 BoogieIcfgContainer
[2024-11-08 15:14:30,156 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-08 15:14:30,158 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-08 15:14:30,158 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-08 15:14:30,161 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-08 15:14:30,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:14:28" (1/3) ...
[2024-11-08 15:14:30,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f154c61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:14:30, skipping insertion in model container
[2024-11-08 15:14:30,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:14:29" (2/3) ...
[2024-11-08 15:14:30,163 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f154c61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:14:30, skipping insertion in model container
[2024-11-08 15:14:30,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:14:30" (3/3) ...
[2024-11-08 15:14:30,164 INFO L112 eAbstractionObserver]: Analyzing ICFG minepump_spec2_product49.cil.c
[2024-11-08 15:14:30,181 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-08 15:14:30,182 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-08 15:14:30,252 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-08 15:14:30,259 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;@72b2e918, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-08 15:14:30,259 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-08 15:14:30,263 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 76 states have internal predecessors, (95), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11)
[2024-11-08 15:14:30,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2024-11-08 15:14:30,273 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 15:14:30,274 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 15:14:30,274 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 15:14:30,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 15:14:30,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1277571174, now seen corresponding path program 1 times
[2024-11-08 15:14:30,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-08 15:14:30,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [481057679]
[2024-11-08 15:14:30,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 15:14:30,291 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 15:14:30,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-08 15:14:30,295 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-08 15:14:30,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process
[2024-11-08 15:14:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:30,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 1 conjuncts are in the unsatisfiable core
[2024-11-08 15:14:30,412 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 15:14:30,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 15:14:30,432 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 15:14:30,433 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-08 15:14:30,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [481057679]
[2024-11-08 15:14:30,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [481057679] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 15:14:30,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 15:14:30,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 15:14:30,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639603114]
[2024-11-08 15:14:30,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 15:14:30,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-08 15:14:30,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-08 15:14:30,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-08 15:14:30,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-08 15:14:30,471 INFO L87 Difference]: Start difference. First operand has 88 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 76 states have internal predecessors, (95), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) 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), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-11-08 15:14:30,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 15:14:30,500 INFO L93 Difference]: Finished difference Result 167 states and 228 transitions.
[2024-11-08 15:14:30,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-08 15:14:30,504 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), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25
[2024-11-08 15:14:30,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 15:14:30,512 INFO L225 Difference]: With dead ends: 167
[2024-11-08 15:14:30,512 INFO L226 Difference]: Without dead ends: 79
[2024-11-08 15:14:30,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-08 15:14:30,523 INFO L432 NwaCegarLoop]: 111 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, 111 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-08 15:14:30,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 15:14:30,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states.
[2024-11-08 15:14:30,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79.
[2024-11-08 15:14:30,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 68 states have internal predecessors, (81), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10)
[2024-11-08 15:14:30,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 102 transitions.
[2024-11-08 15:14:30,565 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 102 transitions. Word has length 25
[2024-11-08 15:14:30,565 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 15:14:30,566 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 102 transitions.
[2024-11-08 15:14:30,566 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), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-11-08 15:14:30,566 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 102 transitions.
[2024-11-08 15:14:30,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2024-11-08 15:14:30,570 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 15:14:30,571 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 15:14:30,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0
[2024-11-08 15:14:30,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 15:14:30,772 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 15:14:30,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 15:14:30,773 INFO L85 PathProgramCache]: Analyzing trace with hash -941221246, now seen corresponding path program 1 times
[2024-11-08 15:14:30,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-08 15:14:30,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1838968044]
[2024-11-08 15:14:30,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 15:14:30,774 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 15:14:30,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-08 15:14:30,777 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-08 15:14:30,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process
[2024-11-08 15:14:30,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:30,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-08 15:14:30,842 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 15:14:30,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 15:14:30,881 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 15:14:30,882 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-08 15:14:30,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1838968044]
[2024-11-08 15:14:30,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1838968044] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 15:14:30,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 15:14:30,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 15:14:30,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925859903]
[2024-11-08 15:14:30,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 15:14:30,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 15:14:30,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-08 15:14:30,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 15:14:30,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 15:14:30,888 INFO L87 Difference]: Start difference. First operand 79 states and 102 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-11-08 15:14:30,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 15:14:30,903 INFO L93 Difference]: Finished difference Result 123 states and 159 transitions.
[2024-11-08 15:14:30,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 15:14:30,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26
[2024-11-08 15:14:30,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 15:14:30,905 INFO L225 Difference]: With dead ends: 123
[2024-11-08 15:14:30,905 INFO L226 Difference]: Without dead ends: 70
[2024-11-08 15:14:30,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 15:14:30,909 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 12 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-08 15:14:30,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 162 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 15:14:30,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states.
[2024-11-08 15:14:30,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70.
[2024-11-08 15:14:30,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 62 states have internal predecessors, (74), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8)
[2024-11-08 15:14:30,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 90 transitions.
[2024-11-08 15:14:30,922 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 90 transitions. Word has length 26
[2024-11-08 15:14:30,923 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 15:14:30,923 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 90 transitions.
[2024-11-08 15:14:30,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-11-08 15:14:30,923 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 90 transitions.
[2024-11-08 15:14:30,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31
[2024-11-08 15:14:30,924 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 15:14:30,924 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 15:14:30,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0
[2024-11-08 15:14:31,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 15:14:31,125 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 15:14:31,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 15:14:31,126 INFO L85 PathProgramCache]: Analyzing trace with hash -913943674, now seen corresponding path program 1 times
[2024-11-08 15:14:31,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-08 15:14:31,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [891956754]
[2024-11-08 15:14:31,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 15:14:31,127 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 15:14:31,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-08 15:14:31,130 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-08 15:14:31,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process
[2024-11-08 15:14:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:31,190 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-08 15:14:31,191 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 15:14:31,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 15:14:31,246 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 15:14:31,247 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-08 15:14:31,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [891956754]
[2024-11-08 15:14:31,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [891956754] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 15:14:31,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 15:14:31,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 15:14:31,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341795299]
[2024-11-08 15:14:31,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 15:14:31,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 15:14:31,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-08 15:14:31,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 15:14:31,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 15:14:31,249 INFO L87 Difference]: Start difference. First operand 70 states and 90 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 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)
[2024-11-08 15:14:31,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 15:14:31,261 INFO L93 Difference]: Finished difference Result 132 states and 173 transitions.
[2024-11-08 15:14:31,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 15:14:31,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 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
[2024-11-08 15:14:31,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 15:14:31,263 INFO L225 Difference]: With dead ends: 132
[2024-11-08 15:14:31,263 INFO L226 Difference]: Without dead ends: 70
[2024-11-08 15:14:31,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 15:14:31,265 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 71 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-08 15:14:31,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 88 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 15:14:31,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states.
[2024-11-08 15:14:31,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70.
[2024-11-08 15:14:31,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.3272727272727274) internal successors, (73), 62 states have internal predecessors, (73), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8)
[2024-11-08 15:14:31,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions.
[2024-11-08 15:14:31,278 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 30
[2024-11-08 15:14:31,280 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 15:14:31,280 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions.
[2024-11-08 15:14:31,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 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)
[2024-11-08 15:14:31,280 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions.
[2024-11-08 15:14:31,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2024-11-08 15:14:31,282 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 15:14:31,283 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 15:14:31,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0
[2024-11-08 15:14:31,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 15:14:31,484 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 15:14:31,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 15:14:31,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1798308510, now seen corresponding path program 1 times
[2024-11-08 15:14:31,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-08 15:14:31,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1341101567]
[2024-11-08 15:14:31,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 15:14:31,486 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 15:14:31,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-08 15:14:31,489 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-08 15:14:31,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process
[2024-11-08 15:14:31,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:31,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-08 15:14:31,548 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 15:14:31,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 15:14:31,660 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 15:14:31,661 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-08 15:14:31,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1341101567]
[2024-11-08 15:14:31,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1341101567] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 15:14:31,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 15:14:31,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-08 15:14:31,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028819285]
[2024-11-08 15:14:31,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 15:14:31,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-08 15:14:31,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-08 15:14:31,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-08 15:14:31,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-11-08 15:14:31,663 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-08 15:14:31,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 15:14:31,912 INFO L93 Difference]: Finished difference Result 203 states and 260 transitions.
[2024-11-08 15:14:31,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-08 15:14:31,913 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 40
[2024-11-08 15:14:31,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 15:14:31,914 INFO L225 Difference]: With dead ends: 203
[2024-11-08 15:14:31,914 INFO L226 Difference]: Without dead ends: 141
[2024-11-08 15:14:31,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-11-08 15:14:31,916 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 215 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-08 15:14:31,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 269 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-08 15:14:31,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states.
[2024-11-08 15:14:31,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 135.
[2024-11-08 15:14:31,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 105 states have (on average 1.2857142857142858) internal successors, (135), 112 states have internal predecessors, (135), 14 states have call successors, (14), 12 states have call predecessors, (14), 15 states have return successors, (17), 15 states have call predecessors, (17), 14 states have call successors, (17)
[2024-11-08 15:14:31,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 166 transitions.
[2024-11-08 15:14:31,938 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 166 transitions. Word has length 40
[2024-11-08 15:14:31,938 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 15:14:31,938 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 166 transitions.
[2024-11-08 15:14:31,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-08 15:14:31,938 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 166 transitions.
[2024-11-08 15:14:31,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2024-11-08 15:14:31,940 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 15:14:31,940 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 15:14:31,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0
[2024-11-08 15:14:32,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 15:14:32,141 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 15:14:32,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 15:14:32,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1579167755, now seen corresponding path program 1 times
[2024-11-08 15:14:32,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-08 15:14:32,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1102366727]
[2024-11-08 15:14:32,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 15:14:32,142 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 15:14:32,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-08 15:14:32,143 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-08 15:14:32,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process
[2024-11-08 15:14:32,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:32,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-08 15:14:32,197 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 15:14:32,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 15:14:32,237 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 15:14:32,237 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-08 15:14:32,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1102366727]
[2024-11-08 15:14:32,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1102366727] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 15:14:32,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 15:14:32,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-08 15:14:32,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391852945]
[2024-11-08 15:14:32,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 15:14:32,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-08 15:14:32,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-08 15:14:32,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-08 15:14:32,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-08 15:14:32,240 INFO L87 Difference]: Start difference. First operand 135 states and 166 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), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-08 15:14:32,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 15:14:32,305 INFO L93 Difference]: Finished difference Result 265 states and 330 transitions.
[2024-11-08 15:14:32,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-08 15:14:32,310 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), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44
[2024-11-08 15:14:32,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 15:14:32,311 INFO L225 Difference]: With dead ends: 265
[2024-11-08 15:14:32,314 INFO L226 Difference]: Without dead ends: 138
[2024-11-08 15:14:32,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-08 15:14:32,316 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-08 15:14:32,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 338 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 15:14:32,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states.
[2024-11-08 15:14:32,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138.
[2024-11-08 15:14:32,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 108 states have (on average 1.2777777777777777) internal successors, (138), 115 states have internal predecessors, (138), 14 states have call successors, (14), 12 states have call predecessors, (14), 15 states have return successors, (17), 15 states have call predecessors, (17), 14 states have call successors, (17)
[2024-11-08 15:14:32,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 169 transitions.
[2024-11-08 15:14:32,341 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 169 transitions. Word has length 44
[2024-11-08 15:14:32,341 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 15:14:32,341 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 169 transitions.
[2024-11-08 15:14:32,341 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), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-08 15:14:32,342 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 169 transitions.
[2024-11-08 15:14:32,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2024-11-08 15:14:32,343 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 15:14:32,343 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 15:14:32,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0
[2024-11-08 15:14:32,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 15:14:32,544 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 15:14:32,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 15:14:32,545 INFO L85 PathProgramCache]: Analyzing trace with hash -109775987, now seen corresponding path program 1 times
[2024-11-08 15:14:32,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-08 15:14:32,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [149551672]
[2024-11-08 15:14:32,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 15:14:32,545 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 15:14:32,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-08 15:14:32,548 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-08 15:14:32,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process
[2024-11-08 15:14:32,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:32,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-08 15:14:32,603 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 15:14:32,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 15:14:32,619 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 15:14:32,620 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-08 15:14:32,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [149551672]
[2024-11-08 15:14:32,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [149551672] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 15:14:32,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 15:14:32,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-08 15:14:32,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112463898]
[2024-11-08 15:14:32,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 15:14:32,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 15:14:32,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-08 15:14:32,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 15:14:32,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-08 15:14:32,622 INFO L87 Difference]: Start difference. First operand 138 states and 169 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), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-08 15:14:32,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 15:14:32,645 INFO L93 Difference]: Finished difference Result 270 states and 337 transitions.
[2024-11-08 15:14:32,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-08 15:14:32,647 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), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44
[2024-11-08 15:14:32,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 15:14:32,654 INFO L225 Difference]: With dead ends: 270
[2024-11-08 15:14:32,655 INFO L226 Difference]: Without dead ends: 140
[2024-11-08 15:14:32,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-08 15:14:32,656 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-08 15:14:32,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 255 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 15:14:32,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states.
[2024-11-08 15:14:32,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140.
[2024-11-08 15:14:32,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 110 states have (on average 1.2727272727272727) internal successors, (140), 117 states have internal predecessors, (140), 14 states have call successors, (14), 12 states have call predecessors, (14), 15 states have return successors, (17), 15 states have call predecessors, (17), 14 states have call successors, (17)
[2024-11-08 15:14:32,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 171 transitions.
[2024-11-08 15:14:32,672 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 171 transitions. Word has length 44
[2024-11-08 15:14:32,672 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 15:14:32,673 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 171 transitions.
[2024-11-08 15:14:32,673 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), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-08 15:14:32,673 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 171 transitions.
[2024-11-08 15:14:32,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2024-11-08 15:14:32,674 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 15:14:32,674 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 15:14:32,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0
[2024-11-08 15:14:32,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 15:14:32,877 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 15:14:32,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 15:14:32,878 INFO L85 PathProgramCache]: Analyzing trace with hash 312925839, now seen corresponding path program 1 times
[2024-11-08 15:14:32,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-08 15:14:32,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1915320779]
[2024-11-08 15:14:32,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 15:14:32,878 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 15:14:32,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-08 15:14:32,880 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-08 15:14:32,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process
[2024-11-08 15:14:32,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:32,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-08 15:14:32,932 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 15:14:32,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 15:14:32,988 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 15:14:32,988 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-08 15:14:32,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1915320779]
[2024-11-08 15:14:32,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1915320779] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 15:14:32,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 15:14:32,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 15:14:32,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387455918]
[2024-11-08 15:14:32,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 15:14:32,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 15:14:32,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-08 15:14:32,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 15:14:32,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 15:14:32,991 INFO L87 Difference]: Start difference. First operand 140 states and 171 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-08 15:14:33,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 15:14:33,026 INFO L93 Difference]: Finished difference Result 321 states and 398 transitions.
[2024-11-08 15:14:33,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 15:14:33,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44
[2024-11-08 15:14:33,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 15:14:33,031 INFO L225 Difference]: With dead ends: 321
[2024-11-08 15:14:33,031 INFO L226 Difference]: Without dead ends: 189
[2024-11-08 15:14:33,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 15:14:33,036 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 40 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-08 15:14:33,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 161 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 15:14:33,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states.
[2024-11-08 15:14:33,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 187.
[2024-11-08 15:14:33,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 146 states have (on average 1.2602739726027397) internal successors, (184), 154 states have internal predecessors, (184), 20 states have call successors, (20), 18 states have call predecessors, (20), 20 states have return successors, (23), 20 states have call predecessors, (23), 20 states have call successors, (23)
[2024-11-08 15:14:33,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 227 transitions.
[2024-11-08 15:14:33,082 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 227 transitions. Word has length 44
[2024-11-08 15:14:33,082 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 15:14:33,082 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 227 transitions.
[2024-11-08 15:14:33,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2024-11-08 15:14:33,082 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 227 transitions.
[2024-11-08 15:14:33,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47
[2024-11-08 15:14:33,087 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 15:14:33,087 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 15:14:33,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0
[2024-11-08 15:14:33,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 15:14:33,288 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 15:14:33,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 15:14:33,289 INFO L85 PathProgramCache]: Analyzing trace with hash 299238822, now seen corresponding path program 1 times
[2024-11-08 15:14:33,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-08 15:14:33,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1120865560]
[2024-11-08 15:14:33,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 15:14:33,289 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 15:14:33,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-08 15:14:33,291 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-08 15:14:33,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process
[2024-11-08 15:14:33,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:33,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-08 15:14:33,347 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 15:14:33,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 15:14:33,448 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 15:14:33,448 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-08 15:14:33,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1120865560]
[2024-11-08 15:14:33,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1120865560] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 15:14:33,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 15:14:33,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-08 15:14:33,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669724446]
[2024-11-08 15:14:33,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 15:14:33,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-08 15:14:33,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-08 15:14:33,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-08 15:14:33,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-08 15:14:33,450 INFO L87 Difference]: Start difference. First operand 187 states and 227 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)
[2024-11-08 15:14:33,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 15:14:33,572 INFO L93 Difference]: Finished difference Result 528 states and 650 transitions.
[2024-11-08 15:14:33,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-08 15:14:33,573 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46
[2024-11-08 15:14:33,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 15:14:33,576 INFO L225 Difference]: With dead ends: 528
[2024-11-08 15:14:33,577 INFO L226 Difference]: Without dead ends: 349
[2024-11-08 15:14:33,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-11-08 15:14:33,579 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 40 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-08 15:14:33,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 403 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-08 15:14:33,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states.
[2024-11-08 15:14:33,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349.
[2024-11-08 15:14:33,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 268 states have (on average 1.2164179104477613) internal successors, (326), 283 states have internal predecessors, (326), 40 states have call successors, (40), 36 states have call predecessors, (40), 40 states have return successors, (49), 40 states have call predecessors, (49), 40 states have call successors, (49)
[2024-11-08 15:14:33,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 415 transitions.
[2024-11-08 15:14:33,642 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 415 transitions. Word has length 46
[2024-11-08 15:14:33,643 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 15:14:33,643 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 415 transitions.
[2024-11-08 15:14:33,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)
[2024-11-08 15:14:33,644 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 415 transitions.
[2024-11-08 15:14:33,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51
[2024-11-08 15:14:33,645 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 15:14:33,645 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 15:14:33,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0
[2024-11-08 15:14:33,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 15:14:33,846 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 15:14:33,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 15:14:33,847 INFO L85 PathProgramCache]: Analyzing trace with hash -658311774, now seen corresponding path program 1 times
[2024-11-08 15:14:33,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-08 15:14:33,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2042258813]
[2024-11-08 15:14:33,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 15:14:33,848 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 15:14:33,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-08 15:14:33,851 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-08 15:14:33,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process
[2024-11-08 15:14:33,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:33,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 9 conjuncts are in the unsatisfiable core
[2024-11-08 15:14:33,910 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 15:14:34,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 15:14:34,027 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 15:14:34,027 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-08 15:14:34,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2042258813]
[2024-11-08 15:14:34,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2042258813] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 15:14:34,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 15:14:34,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-08 15:14:34,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43791685]
[2024-11-08 15:14:34,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 15:14:34,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-08 15:14:34,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-08 15:14:34,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-08 15:14:34,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-08 15:14:34,029 INFO L87 Difference]: Start difference. First operand 349 states and 415 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-08 15:14:34,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 15:14:34,252 INFO L93 Difference]: Finished difference Result 689 states and 820 transitions.
[2024-11-08 15:14:34,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-11-08 15:14:34,253 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), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 50
[2024-11-08 15:14:34,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 15:14:34,255 INFO L225 Difference]: With dead ends: 689
[2024-11-08 15:14:34,256 INFO L226 Difference]: Without dead ends: 348
[2024-11-08 15:14:34,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110
[2024-11-08 15:14:34,257 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 93 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-08 15:14:34,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 295 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-08 15:14:34,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states.
[2024-11-08 15:14:34,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 346.
[2024-11-08 15:14:34,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 265 states have (on average 1.1962264150943396) internal successors, (317), 280 states have internal predecessors, (317), 40 states have call successors, (40), 36 states have call predecessors, (40), 40 states have return successors, (49), 40 states have call predecessors, (49), 40 states have call successors, (49)
[2024-11-08 15:14:34,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 406 transitions.
[2024-11-08 15:14:34,297 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 406 transitions. Word has length 50
[2024-11-08 15:14:34,297 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 15:14:34,297 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 406 transitions.
[2024-11-08 15:14:34,298 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), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2024-11-08 15:14:34,298 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 406 transitions.
[2024-11-08 15:14:34,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53
[2024-11-08 15:14:34,299 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 15:14:34,299 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 15:14:34,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0
[2024-11-08 15:14:34,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 15:14:34,500 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 15:14:34,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 15:14:34,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1829706971, now seen corresponding path program 1 times
[2024-11-08 15:14:34,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-08 15:14:34,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1218182950]
[2024-11-08 15:14:34,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 15:14:34,502 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 15:14:34,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-08 15:14:34,505 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-08 15:14:34,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process
[2024-11-08 15:14:34,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:34,571 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-08 15:14:34,575 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 15:14:34,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 15:14:34,666 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 15:14:34,666 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-08 15:14:34,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1218182950]
[2024-11-08 15:14:34,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1218182950] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 15:14:34,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 15:14:34,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 15:14:34,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336123790]
[2024-11-08 15:14:34,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 15:14:34,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 15:14:34,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-08 15:14:34,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 15:14:34,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 15:14:34,668 INFO L87 Difference]: Start difference. First operand 346 states and 406 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4)
[2024-11-08 15:14:34,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 15:14:34,719 INFO L93 Difference]: Finished difference Result 453 states and 535 transitions.
[2024-11-08 15:14:34,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 15:14:34,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 52
[2024-11-08 15:14:34,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 15:14:34,724 INFO L225 Difference]: With dead ends: 453
[2024-11-08 15:14:34,724 INFO L226 Difference]: Without dead ends: 451
[2024-11-08 15:14:34,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 15:14:34,725 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 40 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-08 15:14:34,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 148 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 15:14:34,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states.
[2024-11-08 15:14:34,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 443.
[2024-11-08 15:14:34,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 337 states have (on average 1.198813056379822) internal successors, (404), 358 states have internal predecessors, (404), 52 states have call successors, (52), 48 states have call predecessors, (52), 53 states have return successors, (67), 49 states have call predecessors, (67), 52 states have call successors, (67)
[2024-11-08 15:14:34,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 523 transitions.
[2024-11-08 15:14:34,766 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 523 transitions. Word has length 52
[2024-11-08 15:14:34,766 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 15:14:34,766 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 523 transitions.
[2024-11-08 15:14:34,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4)
[2024-11-08 15:14:34,766 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 523 transitions.
[2024-11-08 15:14:34,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94
[2024-11-08 15:14:34,768 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 15:14:34,768 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 15:14:34,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0
[2024-11-08 15:14:34,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 15:14:34,972 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 15:14:34,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 15:14:34,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1780679462, now seen corresponding path program 1 times
[2024-11-08 15:14:34,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-08 15:14:34,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1755234210]
[2024-11-08 15:14:34,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 15:14:34,973 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 15:14:34,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-08 15:14:34,974 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-08 15:14:34,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process
[2024-11-08 15:14:35,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:35,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 9 conjuncts are in the unsatisfiable core
[2024-11-08 15:14:35,049 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 15:14:35,158 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 17 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-11-08 15:14:35,159 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 15:14:35,435 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2024-11-08 15:14:35,436 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-08 15:14:35,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1755234210]
[2024-11-08 15:14:35,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1755234210] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 15:14:35,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-08 15:14:35,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11
[2024-11-08 15:14:35,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680345967]
[2024-11-08 15:14:35,437 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-08 15:14:35,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-11-08 15:14:35,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-08 15:14:35,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-11-08 15:14:35,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110
[2024-11-08 15:14:35,439 INFO L87 Difference]: Start difference. First operand 443 states and 523 transitions. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 10 states have internal predecessors, (114), 8 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (16), 6 states have call predecessors, (16), 8 states have call successors, (16)
[2024-11-08 15:14:36,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 15:14:36,043 INFO L93 Difference]: Finished difference Result 1560 states and 1974 transitions.
[2024-11-08 15:14:36,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2024-11-08 15:14:36,043 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 10 states have internal predecessors, (114), 8 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (16), 6 states have call predecessors, (16), 8 states have call successors, (16) Word has length 93
[2024-11-08 15:14:36,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 15:14:36,051 INFO L225 Difference]: With dead ends: 1560
[2024-11-08 15:14:36,051 INFO L226 Difference]: Without dead ends: 1215
[2024-11-08 15:14:36,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=202, Unknown=0, NotChecked=0, Total=306
[2024-11-08 15:14:36,054 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 682 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-08 15:14:36,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 411 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-08 15:14:36,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states.
[2024-11-08 15:14:36,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1131.
[2024-11-08 15:14:36,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1131 states, 866 states have (on average 1.199769053117783) internal successors, (1039), 921 states have internal predecessors, (1039), 131 states have call successors, (131), 117 states have call predecessors, (131), 133 states have return successors, (203), 122 states have call predecessors, (203), 131 states have call successors, (203)
[2024-11-08 15:14:36,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1373 transitions.
[2024-11-08 15:14:36,187 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1373 transitions. Word has length 93
[2024-11-08 15:14:36,187 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 15:14:36,187 INFO L471 AbstractCegarLoop]: Abstraction has 1131 states and 1373 transitions.
[2024-11-08 15:14:36,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 10 states have internal predecessors, (114), 8 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (16), 6 states have call predecessors, (16), 8 states have call successors, (16)
[2024-11-08 15:14:36,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1373 transitions.
[2024-11-08 15:14:36,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94
[2024-11-08 15:14:36,189 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 15:14:36,189 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 15:14:36,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0
[2024-11-08 15:14:36,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 15:14:36,390 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 15:14:36,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 15:14:36,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1128084440, now seen corresponding path program 1 times
[2024-11-08 15:14:36,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-08 15:14:36,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [906052335]
[2024-11-08 15:14:36,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 15:14:36,391 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 15:14:36,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-08 15:14:36,394 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-08 15:14:36,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process
[2024-11-08 15:14:36,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:36,456 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 13 conjuncts are in the unsatisfiable core
[2024-11-08 15:14:36,459 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 15:14:36,613 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-11-08 15:14:36,613 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 15:14:36,893 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2024-11-08 15:14:36,893 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-08 15:14:36,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [906052335]
[2024-11-08 15:14:36,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [906052335] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 15:14:36,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-11-08 15:14:36,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13
[2024-11-08 15:14:36,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962477122]
[2024-11-08 15:14:36,894 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-11-08 15:14:36,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2024-11-08 15:14:36,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-08 15:14:36,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2024-11-08 15:14:36,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156
[2024-11-08 15:14:36,896 INFO L87 Difference]: Start difference. First operand 1131 states and 1373 transitions. Second operand has 13 states, 13 states have (on average 9.0) internal successors, (117), 12 states have internal predecessors, (117), 8 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (16), 6 states have call predecessors, (16), 8 states have call successors, (16)
[2024-11-08 15:14:37,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 15:14:37,930 INFO L93 Difference]: Finished difference Result 4110 states and 5236 transitions.
[2024-11-08 15:14:37,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2024-11-08 15:14:37,930 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.0) internal successors, (117), 12 states have internal predecessors, (117), 8 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (16), 6 states have call predecessors, (16), 8 states have call successors, (16) Word has length 93
[2024-11-08 15:14:37,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 15:14:37,945 INFO L225 Difference]: With dead ends: 4110
[2024-11-08 15:14:37,946 INFO L226 Difference]: Without dead ends: 3073
[2024-11-08 15:14:37,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=544, Unknown=0, NotChecked=0, Total=702
[2024-11-08 15:14:37,950 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 661 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-08 15:14:37,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 717 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-08 15:14:37,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3073 states.
[2024-11-08 15:14:38,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3073 to 2707.
[2024-11-08 15:14:38,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2707 states, 2073 states have (on average 1.1987457790641582) internal successors, (2485), 2191 states have internal predecessors, (2485), 318 states have call successors, (318), 296 states have call predecessors, (318), 315 states have return successors, (520), 291 states have call predecessors, (520), 318 states have call successors, (520)
[2024-11-08 15:14:38,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2707 states to 2707 states and 3323 transitions.
[2024-11-08 15:14:38,250 INFO L78 Accepts]: Start accepts. Automaton has 2707 states and 3323 transitions. Word has length 93
[2024-11-08 15:14:38,250 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 15:14:38,250 INFO L471 AbstractCegarLoop]: Abstraction has 2707 states and 3323 transitions.
[2024-11-08 15:14:38,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.0) internal successors, (117), 12 states have internal predecessors, (117), 8 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (16), 6 states have call predecessors, (16), 8 states have call successors, (16)
[2024-11-08 15:14:38,251 INFO L276 IsEmpty]: Start isEmpty. Operand 2707 states and 3323 transitions.
[2024-11-08 15:14:38,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94
[2024-11-08 15:14:38,253 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 15:14:38,253 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 15:14:38,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0
[2024-11-08 15:14:38,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 15:14:38,456 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 15:14:38,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 15:14:38,457 INFO L85 PathProgramCache]: Analyzing trace with hash 994070934, now seen corresponding path program 1 times
[2024-11-08 15:14:38,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-08 15:14:38,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2137030279]
[2024-11-08 15:14:38,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 15:14:38,457 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 15:14:38,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-08 15:14:38,458 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-08 15:14:38,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process
[2024-11-08 15:14:38,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 15:14:38,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-08 15:14:38,543 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 15:14:38,563 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2024-11-08 15:14:38,563 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 15:14:38,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-08 15:14:38,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2137030279]
[2024-11-08 15:14:38,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2137030279] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 15:14:38,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 15:14:38,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-08 15:14:38,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939680444]
[2024-11-08 15:14:38,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 15:14:38,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-08 15:14:38,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-08 15:14:38,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-08 15:14:38,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-08 15:14:38,565 INFO L87 Difference]: Start difference. First operand 2707 states and 3323 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8)
[2024-11-08 15:14:38,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 15:14:38,627 INFO L93 Difference]: Finished difference Result 3069 states and 3745 transitions.
[2024-11-08 15:14:38,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-08 15:14:38,628 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 93
[2024-11-08 15:14:38,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 15:14:38,631 INFO L225 Difference]: With dead ends: 3069
[2024-11-08 15:14:38,631 INFO L226 Difference]: Without dead ends: 0
[2024-11-08 15:14:38,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-08 15:14:38,638 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-08 15:14:38,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 299 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 15:14:38,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2024-11-08 15:14:38,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2024-11-08 15:14:38,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 15:14:38,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2024-11-08 15:14:38,640 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 93
[2024-11-08 15:14:38,640 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 15:14:38,641 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2024-11-08 15:14:38,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8)
[2024-11-08 15:14:38,641 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2024-11-08 15:14:38,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2024-11-08 15:14:38,643 INFO L782 garLoopResultBuilder]: Registering result SAFE for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-08 15:14:38,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0
[2024-11-08 15:14:38,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-08 15:14:38,849 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 15:14:38,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2024-11-08 15:14:40,789 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-08 15:14:40,828 WARN L156 FloydHoareUtils]: Requires clause for changeMethaneLevel contained old-variable. Original clause: (let ((.cse0 (= ~methAndRunningLastTime~0 (_ bv0 32)))) (and (or (not .cse0) (not (= (_ bv0 32) |old(~methaneLevelCritical~0)|)) (= ~methaneLevelCritical~0 (_ bv0 32))) (let ((.cse2 (= (_ bv0 32) ~pumpRunning~0)) (.cse1 (= ~waterLevel~0 (_ bv2 32))) (.cse3 (= (_ bv1 32) ~systemActive~0))) (or (and .cse1 (not .cse2) .cse3) (and (= ~waterLevel~0 (_ bv1 32)) .cse2 .cse0 .cse3) (and .cse1 .cse0 .cse3))))) Eliminated clause: (let ((.cse1 (= (_ bv0 32) ~pumpRunning~0)) (.cse0 (= ~waterLevel~0 (_ bv2 32))) (.cse3 (= ~methAndRunningLastTime~0 (_ bv0 32))) (.cse2 (= (_ bv1 32) ~systemActive~0))) (or (and .cse0 (not .cse1) .cse2) (and (= ~waterLevel~0 (_ bv1 32)) .cse1 .cse3 .cse2) (and .cse0 .cse3 .cse2)))
[2024-11-08 15:14:40,858 WARN L156 FloydHoareUtils]: Requires clause for timeShift contained old-variable. Original clause: (let ((.cse0 (= (_ bv0 32) |old(~methAndRunningLastTime~0)|)) (.cse1 (= (_ bv2 32) |old(~waterLevel~0)|)) (.cse4 (= (_ bv1 32) |old(~waterLevel~0)|))) (and (let ((.cse3 (= (_ bv0 32) |old(~pumpRunning~0)|)) (.cse2 (= (_ bv1 32) ~systemActive~0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4 .cse2) (and (not .cse3) .cse1 .cse2))) (or (not .cse0) (= ~methAndRunningLastTime~0 (_ bv0 32))) (or (and (= |old(~pumpRunning~0)| ~pumpRunning~0) (= ~waterLevel~0 (_ bv2 32))) (not .cse1)) (or (and (= ~waterLevel~0 (_ bv1 32)) (= (_ bv0 32) ~pumpRunning~0)) (not .cse4)))) Eliminated clause: (exists ((|old(~waterLevel~0)| (_ BitVec 32)) (|old(~methAndRunningLastTime~0)| (_ BitVec 32)) (|old(~pumpRunning~0)| (_ BitVec 32))) (let ((.cse0 (= (_ bv0 32) |old(~methAndRunningLastTime~0)|)) (.cse1 (= (_ bv2 32) |old(~waterLevel~0)|)) (.cse4 (= (_ bv1 32) |old(~waterLevel~0)|))) (and (let ((.cse3 (= (_ bv0 32) |old(~pumpRunning~0)|)) (.cse2 (= (_ bv1 32) ~systemActive~0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4 .cse2) (and (not .cse3) .cse1 .cse2))) (or (not .cse0) (= ~methAndRunningLastTime~0 (_ bv0 32))) (or (and (= |old(~pumpRunning~0)| ~pumpRunning~0) (= ~waterLevel~0 (_ bv2 32))) (not .cse1)) (or (and (= ~waterLevel~0 (_ bv1 32)) (= (_ bv0 32) ~pumpRunning~0)) (not .cse4)))))
[2024-11-08 15:14:40,875 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression
[2024-11-08 15:14:40,881 WARN L156 FloydHoareUtils]: Requires clause for processEnvironment__wrappee__highWaterSensor contained old-variable. Original clause: (and (= (_ bv0 32) ~pumpRunning~0) (let ((.cse0 (= (_ bv0 32) |old(~pumpRunning~0)|)) (.cse1 (= ~methAndRunningLastTime~0 (_ bv0 32))) (.cse2 (= (_ bv1 32) ~systemActive~0))) (or (and .cse0 (= ~waterLevel~0 (_ bv2 32)) .cse1 .cse2) (and (= ~waterLevel~0 (_ bv1 32)) .cse0 .cse1 .cse2)))) Eliminated clause: (and (= (_ bv0 32) ~pumpRunning~0) (let ((.cse0 (= ~methAndRunningLastTime~0 (_ bv0 32))) (.cse1 (= (_ bv1 32) ~systemActive~0))) (or (and (= ~waterLevel~0 (_ bv2 32)) .cse0 .cse1) (and (= ~waterLevel~0 (_ bv1 32)) .cse0 .cse1))))
[2024-11-08 15:14:40,897 WARN L156 FloydHoareUtils]: Requires clause for waterRise contained old-variable. Original clause: (let ((.cse1 (= (_ bv1 32) |old(~waterLevel~0)|)) (.cse4 (= (_ bv2 32) |old(~waterLevel~0)|))) (and (let ((.cse0 (= (_ bv0 32) ~pumpRunning~0)) (.cse2 (= ~methAndRunningLastTime~0 (_ bv0 32))) (.cse3 (= (_ bv1 32) ~systemActive~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and (not .cse0) .cse4 .cse3) (and .cse2 .cse4 .cse3))) (or (= ~waterLevel~0 (_ bv1 32)) (not .cse1)) (or (= ~waterLevel~0 (_ bv2 32)) (not .cse4)))) Eliminated clause: (exists ((|old(~waterLevel~0)| (_ BitVec 32))) (let ((.cse1 (= (_ bv1 32) |old(~waterLevel~0)|)) (.cse4 (= (_ bv2 32) |old(~waterLevel~0)|))) (and (let ((.cse0 (= (_ bv0 32) ~pumpRunning~0)) (.cse2 (= ~methAndRunningLastTime~0 (_ bv0 32))) (.cse3 (= (_ bv1 32) ~systemActive~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and (not .cse0) .cse4 .cse3) (and .cse2 .cse4 .cse3))) (or (= ~waterLevel~0 (_ bv1 32)) (not .cse1)) (or (= ~waterLevel~0 (_ bv2 32)) (not .cse4)))))
[2024-11-08 15:14:40,901 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression
[2024-11-08 15:14:40,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 03:14:40 BoogieIcfgContainer
[2024-11-08 15:14:40,903 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-08 15:14:40,904 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-08 15:14:40,904 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-08 15:14:40,904 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-08 15:14:40,904 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:14:30" (3/4) ...
[2024-11-08 15:14:40,906 INFO L142 WitnessPrinter]: Generating witness for correct program
[2024-11-08 15:14:40,910 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__base
[2024-11-08 15:14:40,910 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure changeMethaneLevel
[2024-11-08 15:14:40,910 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure isMethaneLevelCritical
[2024-11-08 15:14:40,911 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure timeShift
[2024-11-08 15:14:40,911 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure cleanup
[2024-11-08 15:14:40,911 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure processEnvironment__wrappee__highWaterSensor
[2024-11-08 15:14:40,911 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure waterRise
[2024-11-08 15:14:40,921 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges
[2024-11-08 15:14:40,921 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges
[2024-11-08 15:14:40,921 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges
[2024-11-08 15:14:40,922 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2024-11-08 15:14:40,922 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2024-11-08 15:14:41,048 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-11-08 15:14:41,049 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2024-11-08 15:14:41,049 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-08 15:14:41,050 INFO L158 Benchmark]: Toolchain (without parser) took 12129.28ms. Allocated memory was 65.0MB in the beginning and 251.7MB in the end (delta: 186.6MB). Free memory was 34.5MB in the beginning and 138.3MB in the end (delta: -103.9MB). Peak memory consumption was 81.1MB. Max. memory is 16.1GB.
[2024-11-08 15:14:41,050 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 50.3MB. Free memory is still 33.4MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 15:14:41,050 INFO L158 Benchmark]: CACSL2BoogieTranslator took 525.90ms. Allocated memory is still 65.0MB. Free memory was 34.3MB in the beginning and 29.0MB in the end (delta: 5.3MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB.
[2024-11-08 15:14:41,051 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.31ms. Allocated memory is still 65.0MB. Free memory was 29.0MB in the beginning and 26.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-11-08 15:14:41,051 INFO L158 Benchmark]: Boogie Preprocessor took 82.38ms. Allocated memory is still 65.0MB. Free memory was 26.9MB in the beginning and 44.6MB in the end (delta: -17.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-11-08 15:14:41,051 INFO L158 Benchmark]: RCFGBuilder took 563.22ms. Allocated memory is still 65.0MB. Free memory was 44.3MB in the beginning and 42.0MB in the end (delta: 2.3MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB.
[2024-11-08 15:14:41,052 INFO L158 Benchmark]: TraceAbstraction took 10745.20ms. Allocated memory was 65.0MB in the beginning and 251.7MB in the end (delta: 186.6MB). Free memory was 41.2MB in the beginning and 145.7MB in the end (delta: -104.4MB). Peak memory consumption was 117.3MB. Max. memory is 16.1GB.
[2024-11-08 15:14:41,052 INFO L158 Benchmark]: Witness Printer took 145.68ms. Allocated memory is still 251.7MB. Free memory was 145.7MB in the beginning and 138.3MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
[2024-11-08 15:14:41,053 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.18ms. Allocated memory is still 50.3MB. Free memory is still 33.4MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 525.90ms. Allocated memory is still 65.0MB. Free memory was 34.3MB in the beginning and 29.0MB in the end (delta: 5.3MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 61.31ms. Allocated memory is still 65.0MB. Free memory was 29.0MB in the beginning and 26.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 82.38ms. Allocated memory is still 65.0MB. Free memory was 26.9MB in the beginning and 44.6MB in the end (delta: -17.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
* RCFGBuilder took 563.22ms. Allocated memory is still 65.0MB. Free memory was 44.3MB in the beginning and 42.0MB in the end (delta: 2.3MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB.
* TraceAbstraction took 10745.20ms. Allocated memory was 65.0MB in the beginning and 251.7MB in the end (delta: 186.6MB). Free memory was 41.2MB in the beginning and 145.7MB in the end (delta: -104.4MB). Peak memory consumption was 117.3MB. Max. memory is 16.1GB.
* Witness Printer took 145.68ms. Allocated memory is still 251.7MB. Free memory was 145.7MB in the beginning and 138.3MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
- GenericResultAtLocation [Line: 49]: Unsoundness Warning
Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [49]
- GenericResultAtLocation [Line: 155]: Unsoundness Warning
Ignoring preprocessor pragma C: #pragma merger(0,"Environment.i","") [155]
- GenericResultAtLocation [Line: 264]: Unsoundness Warning
Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [264]
- GenericResultAtLocation [Line: 305]: Unsoundness Warning
Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [305]
- GenericResultAtLocation [Line: 370]: Unsoundness Warning
Ignoring preprocessor pragma C: #pragma merger(0,"MinePump.i","") [370]
- GenericResultAtLocation [Line: 569]: Unsoundness Warning
Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [569]
- GenericResultAtLocation [Line: 935]: Unsoundness Warning
Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [935]
- GenericResultAtLocation [Line: 944]: Unsoundness Warning
Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [944]
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: ErrorAutomatonStatistics
NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
- PositiveResult [Line: 940]: 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, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.6s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1884 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1854 mSDsluCounter, 3657 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2458 mSDsCounter, 451 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1129 IncrementalHoareTripleChecker+Invalid, 1580 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 451 mSolverCounterUnsat, 1199 mSDtfsCounter, 1129 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 890 GetRequests, 817 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2707occurred in iteration=12, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 468 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 680 NumberOfCodeBlocks, 680 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 851 ConstructedInterpolants, 0 QuantifiedInterpolants, 1952 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1565 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 15 InterpolantComputations, 11 PerfectInterpolantSequences, 113/135 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
- AllSpecificationsHoldResult: All specifications hold
1 specifications checked. All of them hold
- InvariantResult [Line: 315]: Location Invariant
Derived location invariant: 0
- InvariantResult [Line: 316]: Loop Invariant
Derived loop invariant: ((((((waterLevel == 2) && (0 != pumpRunning)) && (0 == splverifierCounter)) && (1 == systemActive)) || ((((waterLevel == 2) && (methAndRunningLastTime == 0)) && (0 == splverifierCounter)) && (1 == systemActive))) || (((((waterLevel == 1) && (0 == pumpRunning)) && (methAndRunningLastTime == 0)) && (0 == splverifierCounter)) && (1 == systemActive)))
- InvariantResult [Line: 62]: Loop Invariant
Derived loop invariant: 0
- ProcedureContractResult [Line: 400]: Procedure Contract for processEnvironment__wrappee__base
Derived contract for procedure processEnvironment__wrappee__base. Requires: (((((waterLevel == 1) && (0 == pumpRunning)) && (methAndRunningLastTime == 0)) && (1 == systemActive)) || ((((0 == pumpRunning) && (waterLevel == 2)) && (methAndRunningLastTime == 0)) && (1 == systemActive))) Ensures: ((((((waterLevel == 1) && (0 == pumpRunning)) && (methAndRunningLastTime == 0)) && (1 == systemActive)) || ((((0 == pumpRunning) && (waterLevel == 2)) && (methAndRunningLastTime == 0)) && (1 == systemActive))) && (((((((cleanupTimeShifts == \old(cleanupTimeShifts)) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (methAndRunningLastTime == \old(methAndRunningLastTime))) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (head == \old(head))))
- ProcedureContractResult [Line: 188]: Procedure Contract for changeMethaneLevel
Derived contract for procedure changeMethaneLevel. Requires: (((((waterLevel == 2) && (0 != pumpRunning)) && (1 == systemActive)) || ((((waterLevel == 1) && (0 == pumpRunning)) && (methAndRunningLastTime == 0)) && (1 == systemActive))) || (((waterLevel == 2) && (methAndRunningLastTime == 0)) && (1 == systemActive))) Ensures: ((((((waterLevel == 2) && (0 != pumpRunning)) && (1 == systemActive)) || ((((waterLevel == 1) && (0 == pumpRunning)) && (methAndRunningLastTime == 0)) && (1 == systemActive))) || (((waterLevel == 2) && (methAndRunningLastTime == 0)) && (1 == systemActive))) && ((((((cleanupTimeShifts == \old(cleanupTimeShifts)) && (waterLevel == \old(waterLevel))) && (methAndRunningLastTime == \old(methAndRunningLastTime))) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (head == \old(head))))
- ProcedureContractResult [Line: 200]: Procedure Contract for isMethaneLevelCritical
Derived contract for procedure isMethaneLevelCritical. Requires: ((((waterLevel == 1) && (0 == pumpRunning)) && (1 == systemActive)) || (((waterLevel == 2) && (methAndRunningLastTime == 0)) && (1 == systemActive))) Ensures: ((((methaneLevelCritical != 0) || (0 == \result)) && ((((waterLevel == 1) && (0 == pumpRunning)) && (1 == systemActive)) || (((waterLevel == 2) && (methAndRunningLastTime == 0)) && (1 == systemActive)))) && (((((((cleanupTimeShifts == \old(cleanupTimeShifts)) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (methAndRunningLastTime == \old(methAndRunningLastTime))) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (head == \old(head))))
- ProcedureContractResult [Line: 376]: Procedure Contract for timeShift
Derived contract for procedure timeShift. Ensures: (((((((1 != \old(waterLevel)) || (((waterLevel == 1) && (0 == pumpRunning)) && (methAndRunningLastTime == 0))) && ((methaneLevelCritical != 0) || (methAndRunningLastTime == 0))) && (((((0 == \old(methAndRunningLastTime)) && (2 == \old(waterLevel))) && (1 == systemActive)) || ((((0 == \old(methAndRunningLastTime)) && (0 == \old(pumpRunning))) && (1 == \old(waterLevel))) && (1 == systemActive))) || (((0 != \old(pumpRunning)) && (2 == \old(waterLevel))) && (1 == systemActive)))) && (((((waterLevel == 2) && (methAndRunningLastTime == 0)) || (0 != \old(pumpRunning))) || (2 != \old(waterLevel))) || ((waterLevel == 2) && (0 != pumpRunning)))) && ((0 == \old(pumpRunning)) || (((waterLevel == 1) && (0 == pumpRunning)) && (methAndRunningLastTime == 0)))) && ((((cleanupTimeShifts == \old(cleanupTimeShifts)) && (methaneLevelCritical == \old(methaneLevelCritical))) && (systemActive == \old(systemActive))) && (head == \old(head))))
- ProcedureContractResult [Line: 52]: Procedure Contract for cleanup
Derived contract for procedure cleanup. Requires: 0 Ensures: (0 && ((((cleanupTimeShifts == \old(cleanupTimeShifts)) && (methaneLevelCritical == \old(methaneLevelCritical))) && (systemActive == \old(systemActive))) && (head == \old(head))))
- ProcedureContractResult [Line: 408]: Procedure Contract for processEnvironment__wrappee__highWaterSensor
Derived contract for procedure processEnvironment__wrappee__highWaterSensor. Requires: ((0 == pumpRunning) && ((((waterLevel == 2) && (methAndRunningLastTime == 0)) && (1 == systemActive)) || (((waterLevel == 1) && (methAndRunningLastTime == 0)) && (1 == systemActive)))) Ensures: ((((0 == pumpRunning) || (waterLevel != 1)) && (((((0 == \old(pumpRunning)) && (waterLevel == 2)) && (methAndRunningLastTime == 0)) && (1 == systemActive)) || ((((waterLevel == 1) && (0 == \old(pumpRunning))) && (methAndRunningLastTime == 0)) && (1 == systemActive)))) && ((((((cleanupTimeShifts == \old(cleanupTimeShifts)) && (waterLevel == \old(waterLevel))) && (methaneLevelCritical == \old(methaneLevelCritical))) && (methAndRunningLastTime == \old(methAndRunningLastTime))) && (systemActive == \old(systemActive))) && (head == \old(head))))
- ProcedureContractResult [Line: 176]: Procedure Contract for waterRise
Derived contract for procedure waterRise. Ensures: ((((((((0 == pumpRunning) && (1 == \old(waterLevel))) && (methAndRunningLastTime == 0)) && (1 == systemActive)) || (((0 != pumpRunning) && (2 == \old(waterLevel))) && (1 == systemActive))) || (((methAndRunningLastTime == 0) && (2 == \old(waterLevel))) && (1 == systemActive))) && (waterLevel == 2)) && ((((((cleanupTimeShifts == \old(cleanupTimeShifts)) && (methaneLevelCritical == \old(methaneLevelCritical))) && (methAndRunningLastTime == \old(methAndRunningLastTime))) && (pumpRunning == \old(pumpRunning))) && (systemActive == \old(systemActive))) && (head == \old(head))))
RESULT: Ultimate proved your program to be correct!
[2024-11-08 15:14:41,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE