./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/parity.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version 61a67961
Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/parity.i -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 d7c1c6c2f4d5b2d24ba57b817b67aabcbf492bd9ab5f9a13bcbf3c0241dcb4b3
--- Real Ultimate output ---
This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m
[2024-10-13 22:39:05,429 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-10-13 22:39:05,504 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-10-13 22:39:05,517 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-10-13 22:39:05,518 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-10-13 22:39:05,550 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-10-13 22:39:05,551 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-10-13 22:39:05,551 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-10-13 22:39:05,552 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-10-13 22:39:05,553 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-10-13 22:39:05,554 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-10-13 22:39:05,554 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-10-13 22:39:05,554 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-10-13 22:39:05,555 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-10-13 22:39:05,558 INFO L153 SettingsManager]: * Use SBE=true
[2024-10-13 22:39:05,558 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-10-13 22:39:05,558 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-10-13 22:39:05,559 INFO L153 SettingsManager]: * sizeof long=4
[2024-10-13 22:39:05,559 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-10-13 22:39:05,559 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-10-13 22:39:05,559 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-10-13 22:39:05,559 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-10-13 22:39:05,560 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-10-13 22:39:05,560 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-10-13 22:39:05,560 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-10-13 22:39:05,560 INFO L153 SettingsManager]: * sizeof long double=12
[2024-10-13 22:39:05,560 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-10-13 22:39:05,561 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-10-13 22:39:05,561 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-10-13 22:39:05,561 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-10-13 22:39:05,561 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-10-13 22:39:05,561 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-10-13 22:39:05,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-10-13 22:39:05,562 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-10-13 22:39:05,562 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-10-13 22:39:05,562 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-10-13 22:39:05,562 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-10-13 22:39:05,563 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-10-13 22:39:05,563 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-10-13 22:39:05,563 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-10-13 22:39:05,565 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-10-13 22:39:05,565 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-10-13 22:39:05,565 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 -> d7c1c6c2f4d5b2d24ba57b817b67aabcbf492bd9ab5f9a13bcbf3c0241dcb4b3
[2024-10-13 22:39:05,830 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-10-13 22:39:05,856 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-10-13 22:39:05,860 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-10-13 22:39:05,861 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-10-13 22:39:05,861 INFO L274 PluginConnector]: CDTParser initialized
[2024-10-13 22:39:05,862 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/parity.i
[2024-10-13 22:39:07,329 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-10-13 22:39:07,566 INFO L384 CDTParser]: Found 1 translation units.
[2024-10-13 22:39:07,567 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/parity.i
[2024-10-13 22:39:07,579 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d0bb38a7/bf05016402ee48c9b56dde7b6ace13ac/FLAGad052d830
[2024-10-13 22:39:07,911 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d0bb38a7/bf05016402ee48c9b56dde7b6ace13ac
[2024-10-13 22:39:07,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-10-13 22:39:07,915 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-10-13 22:39:07,917 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-10-13 22:39:07,917 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-10-13 22:39:07,924 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-10-13 22:39:07,925 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:39:07" (1/1) ...
[2024-10-13 22:39:07,926 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44c9a034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:07, skipping insertion in model container
[2024-10-13 22:39:07,928 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:39:07" (1/1) ...
[2024-10-13 22:39:07,950 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-10-13 22:39:08,126 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/parity.i[1162,1175]
[2024-10-13 22:39:08,145 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-10-13 22:39:08,157 INFO L200 MainTranslator]: Completed pre-run
[2024-10-13 22:39:08,167 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/parity.i[1162,1175]
[2024-10-13 22:39:08,174 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-10-13 22:39:08,187 INFO L204 MainTranslator]: Completed translation
[2024-10-13 22:39:08,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:08 WrapperNode
[2024-10-13 22:39:08,188 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-10-13 22:39:08,189 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-10-13 22:39:08,189 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-10-13 22:39:08,189 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-10-13 22:39:08,196 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:08" (1/1) ...
[2024-10-13 22:39:08,202 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:08" (1/1) ...
[2024-10-13 22:39:08,222 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 78
[2024-10-13 22:39:08,222 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-10-13 22:39:08,223 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-10-13 22:39:08,223 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-10-13 22:39:08,223 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-10-13 22:39:08,233 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:08" (1/1) ...
[2024-10-13 22:39:08,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:08" (1/1) ...
[2024-10-13 22:39:08,235 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:08" (1/1) ...
[2024-10-13 22:39:08,249 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-10-13 22:39:08,250 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:08" (1/1) ...
[2024-10-13 22:39:08,250 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:08" (1/1) ...
[2024-10-13 22:39:08,253 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:08" (1/1) ...
[2024-10-13 22:39:08,257 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:08" (1/1) ...
[2024-10-13 22:39:08,258 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:08" (1/1) ...
[2024-10-13 22:39:08,259 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:08" (1/1) ...
[2024-10-13 22:39:08,261 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-10-13 22:39:08,262 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-10-13 22:39:08,262 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-10-13 22:39:08,262 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-10-13 22:39:08,263 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:08" (1/1) ...
[2024-10-13 22:39:08,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-10-13 22:39:08,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-10-13 22:39:08,298 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-10-13 22:39:08,306 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-10-13 22:39:08,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-10-13 22:39:08,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-10-13 22:39:08,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-10-13 22:39:08,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-10-13 22:39:08,414 INFO L238 CfgBuilder]: Building ICFG
[2024-10-13 22:39:08,417 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-10-13 22:39:08,685 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live.
[2024-10-13 22:39:08,685 INFO L287 CfgBuilder]: Performing block encoding
[2024-10-13 22:39:08,709 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-10-13 22:39:08,710 INFO L314 CfgBuilder]: Removed 1 assume(true) statements.
[2024-10-13 22:39:08,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:39:08 BoogieIcfgContainer
[2024-10-13 22:39:08,710 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-10-13 22:39:08,713 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-10-13 22:39:08,713 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-10-13 22:39:08,716 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-10-13 22:39:08,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:39:07" (1/3) ...
[2024-10-13 22:39:08,717 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61ae8b8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:39:08, skipping insertion in model container
[2024-10-13 22:39:08,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:08" (2/3) ...
[2024-10-13 22:39:08,718 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61ae8b8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:39:08, skipping insertion in model container
[2024-10-13 22:39:08,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:39:08" (3/3) ...
[2024-10-13 22:39:08,720 INFO L112 eAbstractionObserver]: Analyzing ICFG parity.i
[2024-10-13 22:39:08,739 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-10-13 22:39:08,740 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-10-13 22:39:08,797 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-10-13 22:39:08,803 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;@2f58f8a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-10-13 22:39:08,804 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-10-13 22:39:08,807 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 28 states have internal predecessors, (43), 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-10-13 22:39:08,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2024-10-13 22:39:08,814 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-13 22:39:08,815 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-13 22:39:08,815 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-13 22:39:08,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-13 22:39:08,821 INFO L85 PathProgramCache]: Analyzing trace with hash 383220601, now seen corresponding path program 1 times
[2024-10-13 22:39:08,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-13 22:39:08,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255454433]
[2024-10-13 22:39:08,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-13 22:39:08,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-13 22:39:08,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 22:39:08,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-13 22:39:08,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-13 22:39:08,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255454433]
[2024-10-13 22:39:08,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255454433] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-13 22:39:08,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-13 22:39:08,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-13 22:39:08,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004043589]
[2024-10-13 22:39:08,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-13 22:39:09,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-10-13 22:39:09,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-13 22:39:09,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-10-13 22:39:09,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-10-13 22:39:09,052 INFO L87 Difference]: Start difference. First operand has 29 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 28 states have internal predecessors, (43), 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) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-10-13 22:39:09,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-13 22:39:09,076 INFO L93 Difference]: Finished difference Result 57 states and 85 transitions.
[2024-10-13 22:39:09,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-10-13 22:39:09,079 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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) Word has length 13
[2024-10-13 22:39:09,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-13 22:39:09,104 INFO L225 Difference]: With dead ends: 57
[2024-10-13 22:39:09,105 INFO L226 Difference]: Without dead ends: 27
[2024-10-13 22:39:09,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-10-13 22:39:09,112 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-13 22:39:09,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-13 22:39:09,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states.
[2024-10-13 22:39:09,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27.
[2024-10-13 22:39:09,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 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-10-13 22:39:09,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 38 transitions.
[2024-10-13 22:39:09,141 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 38 transitions. Word has length 13
[2024-10-13 22:39:09,141 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-13 22:39:09,141 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 38 transitions.
[2024-10-13 22:39:09,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-10-13 22:39:09,142 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions.
[2024-10-13 22:39:09,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2024-10-13 22:39:09,143 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-13 22:39:09,143 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-13 22:39:09,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-10-13 22:39:09,144 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-13 22:39:09,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-13 22:39:09,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1709285360, now seen corresponding path program 1 times
[2024-10-13 22:39:09,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-13 22:39:09,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620292177]
[2024-10-13 22:39:09,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-13 22:39:09,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-13 22:39:09,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 22:39:09,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-13 22:39:09,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-13 22:39:09,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620292177]
[2024-10-13 22:39:09,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620292177] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-13 22:39:09,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-13 22:39:09,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-10-13 22:39:09,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091809180]
[2024-10-13 22:39:09,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-13 22:39:09,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-10-13 22:39:09,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-13 22:39:09,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-10-13 22:39:09,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-10-13 22:39:09,406 INFO L87 Difference]: Start difference. First operand 27 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-10-13 22:39:09,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-13 22:39:09,457 INFO L93 Difference]: Finished difference Result 78 states and 112 transitions.
[2024-10-13 22:39:09,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-10-13 22:39:09,457 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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) Word has length 13
[2024-10-13 22:39:09,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-13 22:39:09,458 INFO L225 Difference]: With dead ends: 78
[2024-10-13 22:39:09,458 INFO L226 Difference]: Without dead ends: 50
[2024-10-13 22:39:09,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-10-13 22:39:09,460 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 24 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-13 22:39:09,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 150 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-13 22:39:09,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states.
[2024-10-13 22:39:09,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49.
[2024-10-13 22:39:09,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 48 states have internal predecessors, (70), 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-10-13 22:39:09,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 70 transitions.
[2024-10-13 22:39:09,473 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 70 transitions. Word has length 13
[2024-10-13 22:39:09,473 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-13 22:39:09,474 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 70 transitions.
[2024-10-13 22:39:09,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-10-13 22:39:09,474 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 70 transitions.
[2024-10-13 22:39:09,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2024-10-13 22:39:09,475 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-13 22:39:09,475 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-13 22:39:09,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-10-13 22:39:09,475 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-13 22:39:09,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-13 22:39:09,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1709344942, now seen corresponding path program 1 times
[2024-10-13 22:39:09,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-13 22:39:09,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583502540]
[2024-10-13 22:39:09,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-13 22:39:09,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-13 22:39:09,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 22:39:09,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-13 22:39:09,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-13 22:39:09,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583502540]
[2024-10-13 22:39:09,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583502540] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-13 22:39:09,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-13 22:39:09,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-10-13 22:39:09,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368278637]
[2024-10-13 22:39:09,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-13 22:39:09,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-10-13 22:39:09,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-13 22:39:09,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-10-13 22:39:09,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-10-13 22:39:09,689 INFO L87 Difference]: Start difference. First operand 49 states and 70 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-10-13 22:39:09,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-13 22:39:09,766 INFO L93 Difference]: Finished difference Result 57 states and 78 transitions.
[2024-10-13 22:39:09,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-10-13 22:39:09,767 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) Word has length 13
[2024-10-13 22:39:09,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-13 22:39:09,768 INFO L225 Difference]: With dead ends: 57
[2024-10-13 22:39:09,768 INFO L226 Difference]: Without dead ends: 51
[2024-10-13 22:39:09,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-10-13 22:39:09,770 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-10-13 22:39:09,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-10-13 22:39:09,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states.
[2024-10-13 22:39:09,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51.
[2024-10-13 22:39:09,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.42) internal successors, (71), 50 states have internal predecessors, (71), 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-10-13 22:39:09,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 71 transitions.
[2024-10-13 22:39:09,777 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 71 transitions. Word has length 13
[2024-10-13 22:39:09,778 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-13 22:39:09,778 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 71 transitions.
[2024-10-13 22:39:09,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-10-13 22:39:09,779 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 71 transitions.
[2024-10-13 22:39:09,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2024-10-13 22:39:09,780 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-13 22:39:09,780 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-13 22:39:09,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-10-13 22:39:09,781 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-13 22:39:09,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-13 22:39:09,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1217700076, now seen corresponding path program 1 times
[2024-10-13 22:39:09,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-13 22:39:09,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181444937]
[2024-10-13 22:39:09,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-13 22:39:09,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-13 22:39:09,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 22:39:09,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-13 22:39:09,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-13 22:39:09,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181444937]
[2024-10-13 22:39:09,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181444937] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-13 22:39:09,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-13 22:39:09,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-10-13 22:39:09,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548578280]
[2024-10-13 22:39:09,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-13 22:39:09,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-10-13 22:39:09,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-13 22:39:09,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-10-13 22:39:09,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-10-13 22:39:09,947 INFO L87 Difference]: Start difference. First operand 51 states and 71 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-10-13 22:39:10,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-13 22:39:10,010 INFO L93 Difference]: Finished difference Result 67 states and 90 transitions.
[2024-10-13 22:39:10,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-10-13 22:39:10,012 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) Word has length 14
[2024-10-13 22:39:10,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-13 22:39:10,013 INFO L225 Difference]: With dead ends: 67
[2024-10-13 22:39:10,013 INFO L226 Difference]: Without dead ends: 53
[2024-10-13 22:39:10,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-10-13 22:39:10,014 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-10-13 22:39:10,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-10-13 22:39:10,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states.
[2024-10-13 22:39:10,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53.
[2024-10-13 22:39:10,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 52 states have internal predecessors, (71), 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-10-13 22:39:10,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions.
[2024-10-13 22:39:10,027 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 71 transitions. Word has length 14
[2024-10-13 22:39:10,027 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-13 22:39:10,027 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 71 transitions.
[2024-10-13 22:39:10,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-10-13 22:39:10,028 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 71 transitions.
[2024-10-13 22:39:10,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2024-10-13 22:39:10,029 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-13 22:39:10,029 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-13 22:39:10,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-10-13 22:39:10,029 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-13 22:39:10,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-13 22:39:10,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1526802174, now seen corresponding path program 1 times
[2024-10-13 22:39:10,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-13 22:39:10,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113499970]
[2024-10-13 22:39:10,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-13 22:39:10,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-13 22:39:10,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 22:39:10,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-13 22:39:10,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-13 22:39:10,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113499970]
[2024-10-13 22:39:10,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113499970] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-13 22:39:10,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-13 22:39:10,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-10-13 22:39:10,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672332762]
[2024-10-13 22:39:10,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-13 22:39:10,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-10-13 22:39:10,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-13 22:39:10,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-10-13 22:39:10,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-10-13 22:39:10,196 INFO L87 Difference]: Start difference. First operand 53 states and 71 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-10-13 22:39:10,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-13 22:39:10,254 INFO L93 Difference]: Finished difference Result 83 states and 108 transitions.
[2024-10-13 22:39:10,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-10-13 22:39:10,254 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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) Word has length 15
[2024-10-13 22:39:10,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-13 22:39:10,255 INFO L225 Difference]: With dead ends: 83
[2024-10-13 22:39:10,255 INFO L226 Difference]: Without dead ends: 55
[2024-10-13 22:39:10,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-10-13 22:39:10,256 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-10-13 22:39:10,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-10-13 22:39:10,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states.
[2024-10-13 22:39:10,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55.
[2024-10-13 22:39:10,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 54 states have internal predecessors, (71), 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-10-13 22:39:10,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 71 transitions.
[2024-10-13 22:39:10,262 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 71 transitions. Word has length 15
[2024-10-13 22:39:10,262 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-13 22:39:10,263 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 71 transitions.
[2024-10-13 22:39:10,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-10-13 22:39:10,263 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 71 transitions.
[2024-10-13 22:39:10,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2024-10-13 22:39:10,264 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-13 22:39:10,264 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-13 22:39:10,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-10-13 22:39:10,264 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-13 22:39:10,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-13 22:39:10,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1275691200, now seen corresponding path program 1 times
[2024-10-13 22:39:10,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-13 22:39:10,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455094416]
[2024-10-13 22:39:10,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-13 22:39:10,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-13 22:39:10,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 22:39:10,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-13 22:39:10,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-13 22:39:10,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455094416]
[2024-10-13 22:39:10,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455094416] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-13 22:39:10,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-13 22:39:10,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-10-13 22:39:10,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530993839]
[2024-10-13 22:39:10,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-13 22:39:10,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-10-13 22:39:10,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-13 22:39:10,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-10-13 22:39:10,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-10-13 22:39:10,373 INFO L87 Difference]: Start difference. First operand 55 states and 71 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-10-13 22:39:10,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-13 22:39:10,461 INFO L93 Difference]: Finished difference Result 80 states and 100 transitions.
[2024-10-13 22:39:10,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-10-13 22:39:10,462 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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) Word has length 16
[2024-10-13 22:39:10,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-13 22:39:10,464 INFO L225 Difference]: With dead ends: 80
[2024-10-13 22:39:10,464 INFO L226 Difference]: Without dead ends: 60
[2024-10-13 22:39:10,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-10-13 22:39:10,465 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 4 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-10-13 22:39:10,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 96 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-10-13 22:39:10,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states.
[2024-10-13 22:39:10,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56.
[2024-10-13 22:39:10,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.309090909090909) internal successors, (72), 55 states have internal predecessors, (72), 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-10-13 22:39:10,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 72 transitions.
[2024-10-13 22:39:10,479 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 72 transitions. Word has length 16
[2024-10-13 22:39:10,479 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-13 22:39:10,479 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 72 transitions.
[2024-10-13 22:39:10,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-10-13 22:39:10,479 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 72 transitions.
[2024-10-13 22:39:10,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2024-10-13 22:39:10,481 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-13 22:39:10,482 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-13 22:39:10,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-10-13 22:39:10,482 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-13 22:39:10,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-13 22:39:10,482 INFO L85 PathProgramCache]: Analyzing trace with hash 547213085, now seen corresponding path program 1 times
[2024-10-13 22:39:10,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-13 22:39:10,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284152082]
[2024-10-13 22:39:10,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-13 22:39:10,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-13 22:39:10,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 22:39:10,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-13 22:39:10,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-13 22:39:10,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284152082]
[2024-10-13 22:39:10,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284152082] provided 0 perfect and 1 imperfect interpolant sequences
[2024-10-13 22:39:10,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183635575]
[2024-10-13 22:39:10,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-13 22:39:10,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-13 22:39:10,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-10-13 22:39:10,639 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-10-13 22:39:10,641 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-10-13 22:39:10,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 22:39:10,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 7 conjuncts are in the unsatisfiable core
[2024-10-13 22:39:10,696 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-10-13 22:39:10,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-13 22:39:10,816 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-10-13 22:39:10,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-13 22:39:10,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183635575] provided 1 perfect and 1 imperfect interpolant sequences
[2024-10-13 22:39:10,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2024-10-13 22:39:10,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9
[2024-10-13 22:39:10,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554309796]
[2024-10-13 22:39:10,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-13 22:39:10,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-10-13 22:39:10,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-13 22:39:10,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-10-13 22:39:10,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90
[2024-10-13 22:39:10,943 INFO L87 Difference]: Start difference. First operand 56 states and 72 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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-10-13 22:39:11,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-13 22:39:11,033 INFO L93 Difference]: Finished difference Result 84 states and 106 transitions.
[2024-10-13 22:39:11,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-10-13 22:39:11,034 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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) Word has length 17
[2024-10-13 22:39:11,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-13 22:39:11,034 INFO L225 Difference]: With dead ends: 84
[2024-10-13 22:39:11,035 INFO L226 Difference]: Without dead ends: 74
[2024-10-13 22:39:11,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90
[2024-10-13 22:39:11,036 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 20 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-10-13 22:39:11,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 52 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-10-13 22:39:11,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states.
[2024-10-13 22:39:11,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72.
[2024-10-13 22:39:11,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.295774647887324) internal successors, (92), 71 states have internal predecessors, (92), 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-10-13 22:39:11,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions.
[2024-10-13 22:39:11,042 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 17
[2024-10-13 22:39:11,042 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-13 22:39:11,042 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions.
[2024-10-13 22:39:11,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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-10-13 22:39:11,043 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions.
[2024-10-13 22:39:11,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2024-10-13 22:39:11,043 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-13 22:39:11,043 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-13 22:39:11,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-10-13 22:39:11,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-13 22:39:11,244 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-13 22:39:11,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-13 22:39:11,245 INFO L85 PathProgramCache]: Analyzing trace with hash 253285793, now seen corresponding path program 1 times
[2024-10-13 22:39:11,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-13 22:39:11,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319865563]
[2024-10-13 22:39:11,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-13 22:39:11,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-13 22:39:11,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 22:39:11,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-13 22:39:11,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-13 22:39:11,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319865563]
[2024-10-13 22:39:11,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319865563] provided 0 perfect and 1 imperfect interpolant sequences
[2024-10-13 22:39:11,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522777942]
[2024-10-13 22:39:11,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-13 22:39:11,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-13 22:39:11,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-10-13 22:39:11,401 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-10-13 22:39:11,402 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-10-13 22:39:11,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 22:39:11,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 11 conjuncts are in the unsatisfiable core
[2024-10-13 22:39:11,451 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-10-13 22:39:11,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-13 22:39:11,540 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-10-13 22:39:11,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-13 22:39:11,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522777942] provided 1 perfect and 1 imperfect interpolant sequences
[2024-10-13 22:39:11,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2024-10-13 22:39:11,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 11
[2024-10-13 22:39:11,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737807834]
[2024-10-13 22:39:11,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-13 22:39:11,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-10-13 22:39:11,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-13 22:39:11,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-10-13 22:39:11,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132
[2024-10-13 22:39:11,680 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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-10-13 22:39:11,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-13 22:39:11,822 INFO L93 Difference]: Finished difference Result 86 states and 106 transitions.
[2024-10-13 22:39:11,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-10-13 22:39:11,823 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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) Word has length 18
[2024-10-13 22:39:11,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-13 22:39:11,824 INFO L225 Difference]: With dead ends: 86
[2024-10-13 22:39:11,824 INFO L226 Difference]: Without dead ends: 78
[2024-10-13 22:39:11,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132
[2024-10-13 22:39:11,825 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 14 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-10-13 22:39:11,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 96 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-10-13 22:39:11,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states.
[2024-10-13 22:39:11,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74.
[2024-10-13 22:39:11,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.2876712328767124) internal successors, (94), 73 states have internal predecessors, (94), 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-10-13 22:39:11,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions.
[2024-10-13 22:39:11,839 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 18
[2024-10-13 22:39:11,839 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-13 22:39:11,842 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions.
[2024-10-13 22:39:11,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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-10-13 22:39:11,842 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions.
[2024-10-13 22:39:11,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2024-10-13 22:39:11,843 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-13 22:39:11,843 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-13 22:39:11,866 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-10-13 22:39:12,044 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,SelfDestructingSolverStorable7
[2024-10-13 22:39:12,044 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-13 22:39:12,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-13 22:39:12,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1037021361, now seen corresponding path program 1 times
[2024-10-13 22:39:12,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-13 22:39:12,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454010146]
[2024-10-13 22:39:12,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-13 22:39:12,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-13 22:39:12,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 22:39:12,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-13 22:39:12,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-13 22:39:12,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454010146]
[2024-10-13 22:39:12,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454010146] provided 0 perfect and 1 imperfect interpolant sequences
[2024-10-13 22:39:12,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643565882]
[2024-10-13 22:39:12,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-13 22:39:12,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-13 22:39:12,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-10-13 22:39:12,229 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-10-13 22:39:12,231 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-10-13 22:39:12,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 22:39:12,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 15 conjuncts are in the unsatisfiable core
[2024-10-13 22:39:12,274 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-10-13 22:39:12,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-13 22:39:12,391 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-10-13 22:39:12,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-13 22:39:12,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643565882] provided 1 perfect and 1 imperfect interpolant sequences
[2024-10-13 22:39:12,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2024-10-13 22:39:12,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 13
[2024-10-13 22:39:12,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794983526]
[2024-10-13 22:39:12,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-13 22:39:12,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-10-13 22:39:12,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-13 22:39:12,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-10-13 22:39:12,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182
[2024-10-13 22:39:12,556 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 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-10-13 22:39:12,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-13 22:39:12,678 INFO L93 Difference]: Finished difference Result 88 states and 108 transitions.
[2024-10-13 22:39:12,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-10-13 22:39:12,679 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 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) Word has length 19
[2024-10-13 22:39:12,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-13 22:39:12,680 INFO L225 Difference]: With dead ends: 88
[2024-10-13 22:39:12,680 INFO L226 Difference]: Without dead ends: 82
[2024-10-13 22:39:12,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 8 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182
[2024-10-13 22:39:12,681 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 18 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-10-13 22:39:12,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 80 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-10-13 22:39:12,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states.
[2024-10-13 22:39:12,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76.
[2024-10-13 22:39:12,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.28) internal successors, (96), 75 states have internal predecessors, (96), 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-10-13 22:39:12,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 96 transitions.
[2024-10-13 22:39:12,694 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 96 transitions. Word has length 19
[2024-10-13 22:39:12,694 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-13 22:39:12,694 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 96 transitions.
[2024-10-13 22:39:12,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 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-10-13 22:39:12,695 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions.
[2024-10-13 22:39:12,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2024-10-13 22:39:12,696 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-13 22:39:12,696 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-13 22:39:12,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-10-13 22:39:12,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-13 22:39:12,898 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-13 22:39:12,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-13 22:39:12,899 INFO L85 PathProgramCache]: Analyzing trace with hash 835348250, now seen corresponding path program 1 times
[2024-10-13 22:39:12,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-13 22:39:12,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184463483]
[2024-10-13 22:39:12,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-13 22:39:12,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-13 22:39:12,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 22:39:13,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-13 22:39:13,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-13 22:39:13,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184463483]
[2024-10-13 22:39:13,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184463483] provided 0 perfect and 1 imperfect interpolant sequences
[2024-10-13 22:39:13,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255314112]
[2024-10-13 22:39:13,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-13 22:39:13,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-13 22:39:13,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-10-13 22:39:13,018 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-10-13 22:39:13,019 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-10-13 22:39:13,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 22:39:13,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 8 conjuncts are in the unsatisfiable core
[2024-10-13 22:39:13,071 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-10-13 22:39:13,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-13 22:39:13,183 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-10-13 22:39:13,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-13 22:39:13,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255314112] provided 1 perfect and 1 imperfect interpolant sequences
[2024-10-13 22:39:13,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2024-10-13 22:39:13,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 6] total 10
[2024-10-13 22:39:13,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000154409]
[2024-10-13 22:39:13,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-13 22:39:13,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-10-13 22:39:13,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-13 22:39:13,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-10-13 22:39:13,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110
[2024-10-13 22:39:13,281 INFO L87 Difference]: Start difference. First operand 76 states and 96 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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-10-13 22:39:13,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-13 22:39:13,355 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions.
[2024-10-13 22:39:13,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-10-13 22:39:13,355 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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) Word has length 19
[2024-10-13 22:39:13,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-13 22:39:13,356 INFO L225 Difference]: With dead ends: 86
[2024-10-13 22:39:13,356 INFO L226 Difference]: Without dead ends: 76
[2024-10-13 22:39:13,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110
[2024-10-13 22:39:13,357 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 13 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-10-13 22:39:13,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 59 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-10-13 22:39:13,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states.
[2024-10-13 22:39:13,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 58.
[2024-10-13 22:39:13,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 57 states have internal predecessors, (71), 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-10-13 22:39:13,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions.
[2024-10-13 22:39:13,362 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 19
[2024-10-13 22:39:13,363 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-13 22:39:13,363 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions.
[2024-10-13 22:39:13,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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-10-13 22:39:13,363 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions.
[2024-10-13 22:39:13,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2024-10-13 22:39:13,364 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-13 22:39:13,364 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]
[2024-10-13 22:39:13,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-10-13 22:39:13,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-13 22:39:13,566 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-13 22:39:13,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-13 22:39:13,566 INFO L85 PathProgramCache]: Analyzing trace with hash -583107147, now seen corresponding path program 1 times
[2024-10-13 22:39:13,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-13 22:39:13,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074452421]
[2024-10-13 22:39:13,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-13 22:39:13,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-13 22:39:13,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 22:39:13,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-13 22:39:13,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-13 22:39:13,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074452421]
[2024-10-13 22:39:13,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074452421] provided 0 perfect and 1 imperfect interpolant sequences
[2024-10-13 22:39:13,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566356728]
[2024-10-13 22:39:13,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-13 22:39:13,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-13 22:39:13,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-10-13 22:39:13,769 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-10-13 22:39:13,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-10-13 22:39:13,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 22:39:13,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 16 conjuncts are in the unsatisfiable core
[2024-10-13 22:39:13,815 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-10-13 22:39:13,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-13 22:39:13,928 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-10-13 22:39:14,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-13 22:39:14,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566356728] provided 1 perfect and 1 imperfect interpolant sequences
[2024-10-13 22:39:14,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2024-10-13 22:39:14,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 17
[2024-10-13 22:39:14,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77196122]
[2024-10-13 22:39:14,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-13 22:39:14,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-10-13 22:39:14,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-13 22:39:14,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-10-13 22:39:14,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306
[2024-10-13 22:39:14,100 INFO L87 Difference]: Start difference. First operand 58 states and 71 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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-10-13 22:39:14,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-13 22:39:14,237 INFO L93 Difference]: Finished difference Result 102 states and 127 transitions.
[2024-10-13 22:39:14,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-10-13 22:39:14,238 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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) Word has length 20
[2024-10-13 22:39:14,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-13 22:39:14,238 INFO L225 Difference]: With dead ends: 102
[2024-10-13 22:39:14,238 INFO L226 Difference]: Without dead ends: 94
[2024-10-13 22:39:14,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306
[2024-10-13 22:39:14,239 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 15 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-10-13 22:39:14,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 87 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-10-13 22:39:14,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states.
[2024-10-13 22:39:14,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 62.
[2024-10-13 22:39:14,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 61 states have internal predecessors, (75), 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-10-13 22:39:14,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions.
[2024-10-13 22:39:14,248 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 20
[2024-10-13 22:39:14,248 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-13 22:39:14,248 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions.
[2024-10-13 22:39:14,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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-10-13 22:39:14,249 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions.
[2024-10-13 22:39:14,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2024-10-13 22:39:14,253 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-13 22:39:14,253 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]
[2024-10-13 22:39:14,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2024-10-13 22:39:14,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10
[2024-10-13 22:39:14,458 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-13 22:39:14,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-13 22:39:14,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1231741986, now seen corresponding path program 1 times
[2024-10-13 22:39:14,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-13 22:39:14,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682621691]
[2024-10-13 22:39:14,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-13 22:39:14,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-13 22:39:14,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 22:39:14,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-13 22:39:14,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-13 22:39:14,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682621691]
[2024-10-13 22:39:14,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682621691] provided 0 perfect and 1 imperfect interpolant sequences
[2024-10-13 22:39:14,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572024870]
[2024-10-13 22:39:14,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-13 22:39:14,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-13 22:39:14,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-10-13 22:39:14,646 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-10-13 22:39:14,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-10-13 22:39:14,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 22:39:14,692 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 9 conjuncts are in the unsatisfiable core
[2024-10-13 22:39:14,694 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-10-13 22:39:14,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-13 22:39:14,767 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-10-13 22:39:14,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-13 22:39:14,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572024870] provided 1 perfect and 1 imperfect interpolant sequences
[2024-10-13 22:39:14,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2024-10-13 22:39:14,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 5] total 10
[2024-10-13 22:39:14,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553454405]
[2024-10-13 22:39:14,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-13 22:39:14,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-10-13 22:39:14,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-13 22:39:14,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-10-13 22:39:14,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110
[2024-10-13 22:39:14,888 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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-10-13 22:39:14,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-13 22:39:14,968 INFO L93 Difference]: Finished difference Result 122 states and 149 transitions.
[2024-10-13 22:39:14,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-10-13 22:39:14,969 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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) Word has length 20
[2024-10-13 22:39:14,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-13 22:39:14,969 INFO L225 Difference]: With dead ends: 122
[2024-10-13 22:39:14,969 INFO L226 Difference]: Without dead ends: 82
[2024-10-13 22:39:14,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110
[2024-10-13 22:39:14,970 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 12 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-10-13 22:39:14,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 70 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-10-13 22:39:14,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states.
[2024-10-13 22:39:14,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82.
[2024-10-13 22:39:14,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.2469135802469136) internal successors, (101), 81 states have internal predecessors, (101), 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-10-13 22:39:14,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions.
[2024-10-13 22:39:14,980 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 20
[2024-10-13 22:39:14,980 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-13 22:39:14,981 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions.
[2024-10-13 22:39:14,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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-10-13 22:39:14,981 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions.
[2024-10-13 22:39:14,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2024-10-13 22:39:14,982 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-13 22:39:14,982 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]
[2024-10-13 22:39:14,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2024-10-13 22:39:15,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-13 22:39:15,183 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-13 22:39:15,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-13 22:39:15,183 INFO L85 PathProgramCache]: Analyzing trace with hash 818404110, now seen corresponding path program 1 times
[2024-10-13 22:39:15,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-13 22:39:15,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675443721]
[2024-10-13 22:39:15,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-13 22:39:15,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-13 22:39:15,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-13 22:39:15,202 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-10-13 22:39:15,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-10-13 22:39:15,231 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-10-13 22:39:15,232 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-10-13 22:39:15,233 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-10-13 22:39:15,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-10-13 22:39:15,238 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-13 22:39:15,264 INFO L165 ceAbstractionStarter]: Computing trace abstraction results
[2024-10-13 22:39:15,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 10:39:15 BoogieIcfgContainer
[2024-10-13 22:39:15,268 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-10-13 22:39:15,268 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-10-13 22:39:15,269 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-10-13 22:39:15,269 INFO L274 PluginConnector]: Witness Printer initialized
[2024-10-13 22:39:15,269 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:39:08" (3/4) ...
[2024-10-13 22:39:15,271 INFO L142 WitnessPrinter]: No result that supports witness generation found
[2024-10-13 22:39:15,273 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-10-13 22:39:15,273 INFO L158 Benchmark]: Toolchain (without parser) took 7358.31ms. Allocated memory was 176.2MB in the beginning and 213.9MB in the end (delta: 37.7MB). Free memory was 118.7MB in the beginning and 179.1MB in the end (delta: -60.4MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-10-13 22:39:15,273 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 176.2MB. Free memory is still 137.6MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-10-13 22:39:15,274 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.66ms. Allocated memory is still 176.2MB. Free memory was 118.3MB in the beginning and 106.2MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
[2024-10-13 22:39:15,274 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.44ms. Allocated memory is still 176.2MB. Free memory was 106.2MB in the beginning and 104.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-10-13 22:39:15,274 INFO L158 Benchmark]: Boogie Preprocessor took 38.27ms. Allocated memory is still 176.2MB. Free memory was 104.5MB in the beginning and 102.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-10-13 22:39:15,275 INFO L158 Benchmark]: RCFGBuilder took 448.90ms. Allocated memory is still 176.2MB. Free memory was 102.4MB in the beginning and 88.9MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
[2024-10-13 22:39:15,275 INFO L158 Benchmark]: TraceAbstraction took 6555.26ms. Allocated memory was 176.2MB in the beginning and 213.9MB in the end (delta: 37.7MB). Free memory was 88.2MB in the beginning and 179.1MB in the end (delta: -90.9MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-10-13 22:39:15,275 INFO L158 Benchmark]: Witness Printer took 4.32ms. Allocated memory is still 213.9MB. Free memory is still 179.1MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-10-13 22:39:15,276 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.17ms. Allocated memory is still 176.2MB. Free memory is still 137.6MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 271.66ms. Allocated memory is still 176.2MB. Free memory was 118.3MB in the beginning and 106.2MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 33.44ms. Allocated memory is still 176.2MB. Free memory was 106.2MB in the beginning and 104.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 38.27ms. Allocated memory is still 176.2MB. Free memory was 104.5MB in the beginning and 102.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 448.90ms. Allocated memory is still 176.2MB. Free memory was 102.4MB in the beginning and 88.9MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
* TraceAbstraction took 6555.26ms. Allocated memory was 176.2MB in the beginning and 213.9MB in the end (delta: 37.7MB). Free memory was 88.2MB in the beginning and 179.1MB in the end (delta: -90.9MB). There was no memory consumed. Max. memory is 16.1GB.
* Witness Printer took 4.32ms. Allocated memory is still 213.9MB. Free memory is still 179.1MB. There was no memory consumed. Max. memory is 16.1GB.
* 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
- UnprovableResult [Line: 25]: Unable to prove that a call to reach_error is unreachable
Unable to prove that a call to reach_error is unreachable
Reason: overapproximation of bitwiseAnd at line 61.
Possible FailurePath:
[L42] unsigned int v = __VERIFIER_nondet_uint();
[L43] unsigned int v1;
[L44] unsigned int v2;
[L45] char parity1;
[L46] char parity2;
[L47] v1 = v
[L48] parity1 = (char)0
VAL [parity1=0, v1=-4294967295, v=-4294967295]
[L49] COND TRUE v1 != 0
VAL [parity1=0, v1=-4294967295, v=-4294967295]
[L50] COND TRUE parity1 == (char)0
[L51] parity1 = (char)1
VAL [parity1=1, v1=-4294967295, v=-4294967295]
[L55] EXPR v1 & (v1 - 1U)
VAL [parity1=1, v=-4294967295]
[L55] v1 = v1 & (v1 - 1U)
[L49] COND FALSE !(v1 != 0)
VAL [parity1=1, v=-4294967295]
[L57] v2 = v
[L58] parity2 = (char)0
VAL [parity1=1, v2=-4294967295]
[L59] EXPR v2 ^ (v2 >> 1u)
VAL [parity1=1]
[L59] v2 = v2 ^ (v2 >> 1u)
[L60] EXPR v2 ^ (v2 >> 2u)
VAL [parity1=1]
[L60] v2 = v2 ^ (v2 >> 2u)
[L61] EXPR v2 & 286331153U
VAL [parity1=1]
[L61] v2 = (v2 & 286331153U) * 286331153U
[L62] COND TRUE ((v2 >> 28u) & 1u) == 0
[L63] parity2 = (char)0
VAL [parity1=1, parity2=0]
[L67] CALL __VERIFIER_assert(parity1 == parity2)
[L24] COND TRUE !(cond)
[L25] reach_error()
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 1 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.5s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 120 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 120 mSDsluCounter, 963 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 610 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 728 IncrementalHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 353 mSDtfsCounter, 728 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 281 GetRequests, 178 SyntacticMatches, 26 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=12, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 67 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 331 NumberOfCodeBlocks, 331 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 399 ConstructedInterpolants, 0 QuantifiedInterpolants, 2333 SizeOfPredicates, 1 NumberOfNonLiveVariables, 404 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 24 InterpolantComputations, 12 PerfectInterpolantSequences, 6/18 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
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2024-10-13 22:39:15,310 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/parity.i -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 d7c1c6c2f4d5b2d24ba57b817b67aabcbf492bd9ab5f9a13bcbf3c0241dcb4b3
--- Real Ultimate output ---
This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m
[2024-10-13 22:39:17,643 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-10-13 22:39:17,730 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf
[2024-10-13 22:39:17,741 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-10-13 22:39:17,742 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-10-13 22:39:17,781 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-10-13 22:39:17,783 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-10-13 22:39:17,784 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-10-13 22:39:17,785 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-10-13 22:39:17,786 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-10-13 22:39:17,787 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-10-13 22:39:17,787 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-10-13 22:39:17,788 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-10-13 22:39:17,788 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-10-13 22:39:17,788 INFO L153 SettingsManager]: * Use SBE=true
[2024-10-13 22:39:17,789 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-10-13 22:39:17,789 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-10-13 22:39:17,789 INFO L153 SettingsManager]: * sizeof long=4
[2024-10-13 22:39:17,789 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-10-13 22:39:17,790 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-10-13 22:39:17,790 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-10-13 22:39:17,796 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-10-13 22:39:17,796 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-10-13 22:39:17,797 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-10-13 22:39:17,797 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-10-13 22:39:17,797 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-10-13 22:39:17,798 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-10-13 22:39:17,798 INFO L153 SettingsManager]: * sizeof long double=12
[2024-10-13 22:39:17,798 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-10-13 22:39:17,798 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-10-13 22:39:17,799 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-10-13 22:39:17,800 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-10-13 22:39:17,801 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-10-13 22:39:17,801 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-10-13 22:39:17,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-10-13 22:39:17,802 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-10-13 22:39:17,802 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-10-13 22:39:17,803 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-10-13 22:39:17,803 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF
[2024-10-13 22:39:17,803 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt
[2024-10-13 22:39:17,803 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-10-13 22:39:17,804 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-10-13 22:39:17,804 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-10-13 22:39:17,804 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-10-13 22:39:17,804 INFO L153 SettingsManager]: * Logic for external solver=AUFBV
[2024-10-13 22:39:17,805 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 -> d7c1c6c2f4d5b2d24ba57b817b67aabcbf492bd9ab5f9a13bcbf3c0241dcb4b3
[2024-10-13 22:39:18,165 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-10-13 22:39:18,194 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-10-13 22:39:18,198 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-10-13 22:39:18,199 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-10-13 22:39:18,200 INFO L274 PluginConnector]: CDTParser initialized
[2024-10-13 22:39:18,201 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/parity.i
[2024-10-13 22:39:19,768 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-10-13 22:39:20,004 INFO L384 CDTParser]: Found 1 translation units.
[2024-10-13 22:39:20,005 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/parity.i
[2024-10-13 22:39:20,013 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb3922920/0fed8403c80f46589375a4dbaa77ea67/FLAGc0838596d
[2024-10-13 22:39:20,372 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb3922920/0fed8403c80f46589375a4dbaa77ea67
[2024-10-13 22:39:20,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-10-13 22:39:20,376 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-10-13 22:39:20,378 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-10-13 22:39:20,378 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-10-13 22:39:20,383 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-10-13 22:39:20,384 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:39:20" (1/1) ...
[2024-10-13 22:39:20,385 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ff695cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:20, skipping insertion in model container
[2024-10-13 22:39:20,385 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:39:20" (1/1) ...
[2024-10-13 22:39:20,406 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-10-13 22:39:20,597 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/parity.i[1162,1175]
[2024-10-13 22:39:20,623 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-10-13 22:39:20,643 INFO L200 MainTranslator]: Completed pre-run
[2024-10-13 22:39:20,654 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/parity.i[1162,1175]
[2024-10-13 22:39:20,665 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-10-13 22:39:20,683 INFO L204 MainTranslator]: Completed translation
[2024-10-13 22:39:20,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:20 WrapperNode
[2024-10-13 22:39:20,683 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-10-13 22:39:20,684 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-10-13 22:39:20,684 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-10-13 22:39:20,685 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-10-13 22:39:20,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:20" (1/1) ...
[2024-10-13 22:39:20,697 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:20" (1/1) ...
[2024-10-13 22:39:20,712 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 42
[2024-10-13 22:39:20,712 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-10-13 22:39:20,713 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-10-13 22:39:20,713 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-10-13 22:39:20,713 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-10-13 22:39:20,724 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:20" (1/1) ...
[2024-10-13 22:39:20,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:20" (1/1) ...
[2024-10-13 22:39:20,728 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:20" (1/1) ...
[2024-10-13 22:39:20,745 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-10-13 22:39:20,746 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:20" (1/1) ...
[2024-10-13 22:39:20,747 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:20" (1/1) ...
[2024-10-13 22:39:20,756 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:20" (1/1) ...
[2024-10-13 22:39:20,760 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:20" (1/1) ...
[2024-10-13 22:39:20,761 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:20" (1/1) ...
[2024-10-13 22:39:20,764 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:20" (1/1) ...
[2024-10-13 22:39:20,766 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-10-13 22:39:20,767 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-10-13 22:39:20,768 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-10-13 22:39:20,768 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-10-13 22:39:20,768 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:20" (1/1) ...
[2024-10-13 22:39:20,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-10-13 22:39:20,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-10-13 22:39:20,801 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-10-13 22:39:20,806 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-10-13 22:39:20,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-10-13 22:39:20,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-10-13 22:39:20,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-10-13 22:39:20,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-10-13 22:39:20,926 INFO L238 CfgBuilder]: Building ICFG
[2024-10-13 22:39:20,928 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-10-13 22:39:21,088 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live.
[2024-10-13 22:39:21,088 INFO L287 CfgBuilder]: Performing block encoding
[2024-10-13 22:39:21,112 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-10-13 22:39:21,113 INFO L314 CfgBuilder]: Removed 1 assume(true) statements.
[2024-10-13 22:39:21,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:39:21 BoogieIcfgContainer
[2024-10-13 22:39:21,113 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-10-13 22:39:21,115 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-10-13 22:39:21,115 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-10-13 22:39:21,119 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-10-13 22:39:21,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:39:20" (1/3) ...
[2024-10-13 22:39:21,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7059e118 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:39:21, skipping insertion in model container
[2024-10-13 22:39:21,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:39:20" (2/3) ...
[2024-10-13 22:39:21,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7059e118 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:39:21, skipping insertion in model container
[2024-10-13 22:39:21,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:39:21" (3/3) ...
[2024-10-13 22:39:21,122 INFO L112 eAbstractionObserver]: Analyzing ICFG parity.i
[2024-10-13 22:39:21,144 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-10-13 22:39:21,145 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-10-13 22:39:21,215 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-10-13 22:39:21,227 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;@16d36f7e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-10-13 22:39:21,227 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-10-13 22:39:21,232 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 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-10-13 22:39:21,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8
[2024-10-13 22:39:21,239 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-13 22:39:21,240 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-10-13 22:39:21,241 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-13 22:39:21,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-13 22:39:21,247 INFO L85 PathProgramCache]: Analyzing trace with hash -675522828, now seen corresponding path program 1 times
[2024-10-13 22:39:21,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-10-13 22:39:21,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1499635471]
[2024-10-13 22:39:21,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-13 22:39:21,261 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-10-13 22:39:21,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-10-13 22:39:21,264 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-10-13 22:39:21,266 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-10-13 22:39:21,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 22:39:21,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 1 conjuncts are in the unsatisfiable core
[2024-10-13 22:39:21,345 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-10-13 22:39:21,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-13 22:39:21,366 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-10-13 22:39:21,368 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-10-13 22:39:21,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1499635471]
[2024-10-13 22:39:21,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1499635471] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-13 22:39:21,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-13 22:39:21,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-13 22:39:21,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404786093]
[2024-10-13 22:39:21,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-13 22:39:21,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-10-13 22:39:21,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-10-13 22:39:21,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-10-13 22:39:21,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-10-13 22:39:21,404 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 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) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-10-13 22:39:21,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-13 22:39:21,442 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions.
[2024-10-13 22:39:21,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-10-13 22:39:21,444 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) Word has length 7
[2024-10-13 22:39:21,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-13 22:39:21,452 INFO L225 Difference]: With dead ends: 20
[2024-10-13 22:39:21,453 INFO L226 Difference]: Without dead ends: 10
[2024-10-13 22:39:21,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 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-10-13 22:39:21,462 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-13 22:39:21,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-13 22:39:21,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states.
[2024-10-13 22:39:21,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10.
[2024-10-13 22:39:21,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 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-10-13 22:39:21,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions.
[2024-10-13 22:39:21,494 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 7
[2024-10-13 22:39:21,495 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-13 22:39:21,495 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions.
[2024-10-13 22:39:21,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-10-13 22:39:21,495 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions.
[2024-10-13 22:39:21,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8
[2024-10-13 22:39:21,496 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-13 22:39:21,496 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-10-13 22:39:21,499 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 (2)] Ended with exit code 0
[2024-10-13 22:39:21,699 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-10-13 22:39:21,699 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-13 22:39:21,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-13 22:39:21,700 INFO L85 PathProgramCache]: Analyzing trace with hash -990443489, now seen corresponding path program 1 times
[2024-10-13 22:39:21,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-10-13 22:39:21,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [211652159]
[2024-10-13 22:39:21,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-13 22:39:21,701 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-10-13 22:39:21,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-10-13 22:39:21,703 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-10-13 22:39:21,704 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-10-13 22:39:21,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 22:39:21,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-10-13 22:39:21,760 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-10-13 22:39:21,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-13 22:39:21,855 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-10-13 22:39:21,855 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-10-13 22:39:21,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [211652159]
[2024-10-13 22:39:21,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [211652159] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-13 22:39:21,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-13 22:39:21,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-10-13 22:39:21,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484011374]
[2024-10-13 22:39:21,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-13 22:39:21,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-10-13 22:39:21,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-10-13 22:39:21,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-10-13 22:39:21,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-10-13 22:39:21,863 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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-10-13 22:39:21,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-13 22:39:21,891 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions.
[2024-10-13 22:39:21,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-10-13 22:39:21,892 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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) Word has length 7
[2024-10-13 22:39:21,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-13 22:39:21,892 INFO L225 Difference]: With dead ends: 27
[2024-10-13 22:39:21,893 INFO L226 Difference]: Without dead ends: 16
[2024-10-13 22:39:21,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-10-13 22:39:21,894 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 3 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-13 22:39:21,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 31 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-13 22:39:21,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states.
[2024-10-13 22:39:21,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15.
[2024-10-13 22:39:21,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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-10-13 22:39:21,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions.
[2024-10-13 22:39:21,900 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 7
[2024-10-13 22:39:21,900 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-13 22:39:21,901 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions.
[2024-10-13 22:39:21,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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-10-13 22:39:21,901 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions.
[2024-10-13 22:39:21,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8
[2024-10-13 22:39:21,902 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-13 22:39:21,902 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-10-13 22:39:21,906 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 (3)] Forceful destruction successful, exit code 0
[2024-10-13 22:39:22,102 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-10-13 22:39:22,103 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-13 22:39:22,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-13 22:39:22,104 INFO L85 PathProgramCache]: Analyzing trace with hash -990383907, now seen corresponding path program 1 times
[2024-10-13 22:39:22,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-10-13 22:39:22,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [504466647]
[2024-10-13 22:39:22,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-13 22:39:22,105 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-10-13 22:39:22,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-10-13 22:39:22,108 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-10-13 22:39:22,111 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-10-13 22:39:22,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 22:39:22,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-10-13 22:39:22,141 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-10-13 22:39:22,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-13 22:39:22,174 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-10-13 22:39:22,175 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-10-13 22:39:22,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [504466647]
[2024-10-13 22:39:22,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [504466647] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-13 22:39:22,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-13 22:39:22,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-10-13 22:39:22,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531840536]
[2024-10-13 22:39:22,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-13 22:39:22,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-10-13 22:39:22,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-10-13 22:39:22,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-10-13 22:39:22,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-10-13 22:39:22,186 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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-10-13 22:39:22,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-13 22:39:22,225 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions.
[2024-10-13 22:39:22,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-10-13 22:39:22,227 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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) Word has length 7
[2024-10-13 22:39:22,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-13 22:39:22,228 INFO L225 Difference]: With dead ends: 24
[2024-10-13 22:39:22,228 INFO L226 Difference]: Without dead ends: 18
[2024-10-13 22:39:22,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-10-13 22:39:22,229 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-13 22:39:22,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 27 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-13 22:39:22,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states.
[2024-10-13 22:39:22,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16.
[2024-10-13 22:39:22,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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-10-13 22:39:22,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions.
[2024-10-13 22:39:22,238 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 7
[2024-10-13 22:39:22,238 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-13 22:39:22,238 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions.
[2024-10-13 22:39:22,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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-10-13 22:39:22,238 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions.
[2024-10-13 22:39:22,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2024-10-13 22:39:22,239 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-13 22:39:22,239 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-13 22:39:22,243 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-10-13 22:39:22,442 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-10-13 22:39:22,442 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-13 22:39:22,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-13 22:39:22,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1541171670, now seen corresponding path program 1 times
[2024-10-13 22:39:22,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-10-13 22:39:22,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [62022029]
[2024-10-13 22:39:22,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-13 22:39:22,444 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-10-13 22:39:22,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-10-13 22:39:22,449 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-10-13 22:39:22,450 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-10-13 22:39:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 22:39:22,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-10-13 22:39:22,478 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-10-13 22:39:22,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-13 22:39:22,716 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-10-13 22:39:23,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-13 22:39:23,245 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-10-13 22:39:23,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [62022029]
[2024-10-13 22:39:23,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [62022029] provided 0 perfect and 2 imperfect interpolant sequences
[2024-10-13 22:39:23,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-10-13 22:39:23,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11
[2024-10-13 22:39:23,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909677423]
[2024-10-13 22:39:23,246 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-10-13 22:39:23,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-10-13 22:39:23,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-10-13 22:39:23,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-10-13 22:39:23,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132
[2024-10-13 22:39:23,248 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 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-10-13 22:39:23,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-13 22:39:23,458 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions.
[2024-10-13 22:39:23,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2024-10-13 22:39:23,458 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 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) Word has length 10
[2024-10-13 22:39:23,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-13 22:39:23,460 INFO L225 Difference]: With dead ends: 40
[2024-10-13 22:39:23,461 INFO L226 Difference]: Without dead ends: 36
[2024-10-13 22:39:23,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132
[2024-10-13 22:39:23,465 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 8 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-10-13 22:39:23,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 45 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-10-13 22:39:23,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states.
[2024-10-13 22:39:23,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28.
[2024-10-13 22:39:23,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 27 states have internal predecessors, (37), 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-10-13 22:39:23,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions.
[2024-10-13 22:39:23,478 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 10
[2024-10-13 22:39:23,478 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-13 22:39:23,478 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions.
[2024-10-13 22:39:23,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 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-10-13 22:39:23,479 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions.
[2024-10-13 22:39:23,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2024-10-13 22:39:23,479 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-13 22:39:23,479 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-13 22:39:23,484 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-10-13 22:39:23,680 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-10-13 22:39:23,680 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-13 22:39:23,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-13 22:39:23,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1541231252, now seen corresponding path program 1 times
[2024-10-13 22:39:23,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-10-13 22:39:23,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [311103806]
[2024-10-13 22:39:23,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-13 22:39:23,682 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-10-13 22:39:23,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-10-13 22:39:23,685 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-10-13 22:39:23,689 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-10-13 22:39:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 22:39:23,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-10-13 22:39:23,717 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-10-13 22:39:23,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-13 22:39:23,767 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-10-13 22:39:23,767 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-10-13 22:39:23,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [311103806]
[2024-10-13 22:39:23,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [311103806] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-13 22:39:23,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-13 22:39:23,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-10-13 22:39:23,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564358323]
[2024-10-13 22:39:23,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-13 22:39:23,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-10-13 22:39:23,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-10-13 22:39:23,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-10-13 22:39:23,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-10-13 22:39:23,773 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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-10-13 22:39:23,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-13 22:39:23,793 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions.
[2024-10-13 22:39:23,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-10-13 22:39:23,794 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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) Word has length 10
[2024-10-13 22:39:23,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-13 22:39:23,795 INFO L225 Difference]: With dead ends: 49
[2024-10-13 22:39:23,795 INFO L226 Difference]: Without dead ends: 26
[2024-10-13 22:39:23,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-10-13 22:39:23,797 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-13 22:39:23,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 30 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-13 22:39:23,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states.
[2024-10-13 22:39:23,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25.
[2024-10-13 22:39:23,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 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-10-13 22:39:23,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions.
[2024-10-13 22:39:23,805 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 10
[2024-10-13 22:39:23,805 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-13 22:39:23,805 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions.
[2024-10-13 22:39:23,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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-10-13 22:39:23,805 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions.
[2024-10-13 22:39:23,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2024-10-13 22:39:23,806 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-13 22:39:23,806 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-13 22:39:23,810 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 (6)] Forceful destruction successful, exit code 0
[2024-10-13 22:39:24,007 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-10-13 22:39:24,007 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-13 22:39:24,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-13 22:39:24,008 INFO L85 PathProgramCache]: Analyzing trace with hash 453368635, now seen corresponding path program 1 times
[2024-10-13 22:39:24,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-10-13 22:39:24,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1769413720]
[2024-10-13 22:39:24,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-13 22:39:24,008 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-10-13 22:39:24,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-10-13 22:39:24,010 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-10-13 22:39:24,011 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-10-13 22:39:24,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 22:39:24,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 8 conjuncts are in the unsatisfiable core
[2024-10-13 22:39:24,037 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-10-13 22:39:24,329 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-13 22:39:24,329 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-10-13 22:39:25,194 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-13 22:39:25,194 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-10-13 22:39:25,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1769413720]
[2024-10-13 22:39:25,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1769413720] provided 0 perfect and 2 imperfect interpolant sequences
[2024-10-13 22:39:25,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-10-13 22:39:25,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14
[2024-10-13 22:39:25,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559331189]
[2024-10-13 22:39:25,195 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-10-13 22:39:25,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-10-13 22:39:25,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-10-13 22:39:25,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-10-13 22:39:25,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210
[2024-10-13 22:39:25,197 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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-10-13 22:39:25,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-13 22:39:25,476 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions.
[2024-10-13 22:39:25,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2024-10-13 22:39:25,476 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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) Word has length 13
[2024-10-13 22:39:25,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-13 22:39:25,477 INFO L225 Difference]: With dead ends: 36
[2024-10-13 22:39:25,477 INFO L226 Difference]: Without dead ends: 28
[2024-10-13 22:39:25,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210
[2024-10-13 22:39:25,478 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 5 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-10-13 22:39:25,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 59 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-10-13 22:39:25,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states.
[2024-10-13 22:39:25,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28.
[2024-10-13 22:39:25,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 27 states have internal predecessors, (29), 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-10-13 22:39:25,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions.
[2024-10-13 22:39:25,486 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 13
[2024-10-13 22:39:25,486 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-13 22:39:25,486 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions.
[2024-10-13 22:39:25,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 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-10-13 22:39:25,486 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions.
[2024-10-13 22:39:25,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2024-10-13 22:39:25,488 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-13 22:39:25,488 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1]
[2024-10-13 22:39:25,490 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 (7)] Forceful destruction successful, exit code 0
[2024-10-13 22:39:25,688 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-10-13 22:39:25,689 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-13 22:39:25,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-13 22:39:25,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1775642086, now seen corresponding path program 1 times
[2024-10-13 22:39:25,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-10-13 22:39:25,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [380319020]
[2024-10-13 22:39:25,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-13 22:39:25,690 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-10-13 22:39:25,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-10-13 22:39:25,691 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-10-13 22:39:25,693 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-10-13 22:39:25,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-13 22:39:25,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 14 conjuncts are in the unsatisfiable core
[2024-10-13 22:39:25,778 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-10-13 22:39:26,965 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-13 22:39:26,965 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-10-13 22:39:31,243 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-13 22:39:31,244 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-10-13 22:39:31,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [380319020]
[2024-10-13 22:39:31,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [380319020] provided 0 perfect and 2 imperfect interpolant sequences
[2024-10-13 22:39:31,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-10-13 22:39:31,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 23
[2024-10-13 22:39:31,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491210183]
[2024-10-13 22:39:31,244 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-10-13 22:39:31,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states
[2024-10-13 22:39:31,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-10-13 22:39:31,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2024-10-13 22:39:31,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552
[2024-10-13 22:39:31,246 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 24 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 23 states have internal predecessors, (41), 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-10-13 22:39:36,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-13 22:39:36,259 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions.
[2024-10-13 22:39:36,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states.
[2024-10-13 22:39:36,259 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 23 states have internal predecessors, (41), 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) Word has length 22
[2024-10-13 22:39:36,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-13 22:39:36,260 INFO L225 Difference]: With dead ends: 57
[2024-10-13 22:39:36,260 INFO L226 Difference]: Without dead ends: 49
[2024-10-13 22:39:36,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=184, Invalid=686, Unknown=0, NotChecked=0, Total=870
[2024-10-13 22:39:36,262 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 11 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2024-10-13 22:39:36,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 147 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2024-10-13 22:39:36,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states.
[2024-10-13 22:39:36,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49.
[2024-10-13 22:39:36,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 48 states have internal predecessors, (53), 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-10-13 22:39:36,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions.
[2024-10-13 22:39:36,277 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 22
[2024-10-13 22:39:36,277 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-13 22:39:36,278 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions.
[2024-10-13 22:39:36,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 23 states have internal predecessors, (41), 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-10-13 22:39:36,278 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions.
[2024-10-13 22:39:36,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2024-10-13 22:39:36,279 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-13 22:39:36,279 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 1, 1, 1, 1, 1, 1, 1]
[2024-10-13 22:39:36,284 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 (8)] Forceful destruction successful, exit code 0
[2024-10-13 22:39:36,479 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-10-13 22:39:36,480 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-13 22:39:36,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-13 22:39:36,481 INFO L85 PathProgramCache]: Analyzing trace with hash -727624585, now seen corresponding path program 2 times
[2024-10-13 22:39:36,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-10-13 22:39:36,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1458208428]
[2024-10-13 22:39:36,481 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-10-13 22:39:36,481 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-10-13 22:39:36,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-10-13 22:39:36,483 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-10-13 22:39:36,484 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-10-13 22:39:36,569 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-10-13 22:39:36,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-10-13 22:39:36,571 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 16 conjuncts are in the unsatisfiable core
[2024-10-13 22:39:36,573 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-10-13 22:39:37,573 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-13 22:39:37,574 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-10-13 22:39:43,888 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-13 22:39:43,888 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-10-13 22:39:43,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1458208428]
[2024-10-13 22:39:43,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1458208428] provided 0 perfect and 2 imperfect interpolant sequences
[2024-10-13 22:39:43,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2024-10-13 22:39:43,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 26
[2024-10-13 22:39:43,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963378466]
[2024-10-13 22:39:43,889 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2024-10-13 22:39:43,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2024-10-13 22:39:43,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-10-13 22:39:43,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2024-10-13 22:39:43,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=573, Unknown=0, NotChecked=0, Total=702
[2024-10-13 22:39:43,891 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 27 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 26 states have internal predecessors, (47), 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-10-13 22:39:50,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-13 22:39:50,839 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions.
[2024-10-13 22:39:50,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states.
[2024-10-13 22:39:50,840 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 26 states have internal predecessors, (47), 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) Word has length 25
[2024-10-13 22:39:50,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-13 22:39:50,842 INFO L225 Difference]: With dead ends: 60
[2024-10-13 22:39:50,842 INFO L226 Difference]: Without dead ends: 52
[2024-10-13 22:39:50,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=210, Invalid=846, Unknown=0, NotChecked=0, Total=1056
[2024-10-13 22:39:50,844 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 11 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2024-10-13 22:39:50,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 128 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2024-10-13 22:39:50,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states.
[2024-10-13 22:39:50,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52.
[2024-10-13 22:39:50,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 51 states have internal predecessors, (53), 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-10-13 22:39:50,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions.
[2024-10-13 22:39:50,860 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 25
[2024-10-13 22:39:50,860 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-10-13 22:39:50,860 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions.
[2024-10-13 22:39:50,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 26 states have internal predecessors, (47), 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-10-13 22:39:50,861 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions.
[2024-10-13 22:39:50,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47
[2024-10-13 22:39:50,862 INFO L207 NwaCegarLoop]: Found error trace
[2024-10-13 22:39:50,862 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 7, 6, 1, 1, 1, 1, 1, 1, 1]
[2024-10-13 22:39:50,868 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 (9)] Forceful destruction successful, exit code 0
[2024-10-13 22:39:51,062 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-10-13 22:39:51,063 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-13 22:39:51,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-10-13 22:39:51,064 INFO L85 PathProgramCache]: Analyzing trace with hash 342812834, now seen corresponding path program 2 times
[2024-10-13 22:39:51,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-10-13 22:39:51,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [142091744]
[2024-10-13 22:39:51,064 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-10-13 22:39:51,064 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-10-13 22:39:51,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-10-13 22:39:51,065 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-10-13 22:39:51,067 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-10-13 22:39:51,377 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-10-13 22:39:51,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-10-13 22:39:51,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 30 conjuncts are in the unsatisfiable core
[2024-10-13 22:39:51,383 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-10-13 22:40:04,328 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-10-13 22:40:04,329 INFO L311 TraceCheckSpWp]: Computing backward predicates...