./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 03:01:03,339 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 03:01:03,388 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 03:01:03,391 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 03:01:03,392 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 03:01:03,415 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 03:01:03,415 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 03:01:03,416 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 03:01:03,416 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 03:01:03,418 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 03:01:03,419 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 03:01:03,419 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 03:01:03,420 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 03:01:03,420 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 03:01:03,420 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 03:01:03,420 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 03:01:03,420 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 03:01:03,421 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 03:01:03,421 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 03:01:03,421 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 03:01:03,421 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 03:01:03,423 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 03:01:03,423 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 03:01:03,423 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 03:01:03,423 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 03:01:03,423 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 03:01:03,424 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 03:01:03,424 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 03:01:03,424 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 03:01:03,424 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 03:01:03,424 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 03:01:03,424 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 03:01:03,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 03:01:03,425 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 03:01:03,425 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 03:01:03,425 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 03:01:03,426 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 03:01:03,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 03:01:03,426 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 03:01:03,426 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 03:01:03,427 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 03:01:03,427 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 03:01:03,427 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 -> c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a [2024-11-16 03:01:03,633 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 03:01:03,653 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 03:01:03,655 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 03:01:03,656 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 03:01:03,656 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 03:01:03,657 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2024-11-16 03:01:04,958 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 03:01:05,125 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 03:01:05,125 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2024-11-16 03:01:05,135 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13891d2c4/6fcbdf2c3f4a4e85b4cc69cbeb4830a7/FLAGb51c81451 [2024-11-16 03:01:05,151 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13891d2c4/6fcbdf2c3f4a4e85b4cc69cbeb4830a7 [2024-11-16 03:01:05,154 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 03:01:05,155 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 03:01:05,157 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 03:01:05,157 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 03:01:05,161 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 03:01:05,162 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:01:05" (1/1) ... [2024-11-16 03:01:05,163 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c48a624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:01:05, skipping insertion in model container [2024-11-16 03:01:05,163 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:01:05" (1/1) ... [2024-11-16 03:01:05,189 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 03:01:05,376 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c[730,743] [2024-11-16 03:01:05,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 03:01:05,438 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 03:01:05,448 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c[730,743] [2024-11-16 03:01:05,466 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 03:01:05,478 INFO L204 MainTranslator]: Completed translation [2024-11-16 03:01:05,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:01:05 WrapperNode [2024-11-16 03:01:05,481 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 03:01:05,482 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 03:01:05,482 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 03:01:05,482 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 03:01:05,488 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:01:05" (1/1) ... [2024-11-16 03:01:05,494 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:01:05" (1/1) ... [2024-11-16 03:01:05,506 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2024-11-16 03:01:05,506 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 03:01:05,507 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 03:01:05,507 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 03:01:05,507 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 03:01:05,515 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:01:05" (1/1) ... [2024-11-16 03:01:05,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:01:05" (1/1) ... [2024-11-16 03:01:05,518 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:01:05" (1/1) ... [2024-11-16 03:01:05,533 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 03:01:05,533 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:01:05" (1/1) ... [2024-11-16 03:01:05,534 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:01:05" (1/1) ... [2024-11-16 03:01:05,539 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:01:05" (1/1) ... [2024-11-16 03:01:05,542 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:01:05" (1/1) ... [2024-11-16 03:01:05,543 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:01:05" (1/1) ... [2024-11-16 03:01:05,544 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:01:05" (1/1) ... [2024-11-16 03:01:05,549 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 03:01:05,550 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 03:01:05,550 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 03:01:05,550 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 03:01:05,551 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:01:05" (1/1) ... [2024-11-16 03:01:05,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 03:01:05,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:01:05,579 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 03:01:05,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 03:01:05,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 03:01:05,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 03:01:05,619 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-16 03:01:05,619 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-16 03:01:05,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 03:01:05,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 03:01:05,619 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2024-11-16 03:01:05,620 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2024-11-16 03:01:05,620 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-16 03:01:05,620 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-16 03:01:05,676 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 03:01:05,678 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 03:01:05,948 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2024-11-16 03:01:05,948 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 03:01:05,972 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 03:01:05,973 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-16 03:01:05,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:01:05 BoogieIcfgContainer [2024-11-16 03:01:05,973 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 03:01:05,975 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 03:01:05,975 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 03:01:05,977 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 03:01:05,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:01:05" (1/3) ... [2024-11-16 03:01:05,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72e91196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:01:05, skipping insertion in model container [2024-11-16 03:01:05,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:01:05" (2/3) ... [2024-11-16 03:01:05,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72e91196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:01:05, skipping insertion in model container [2024-11-16 03:01:05,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:01:05" (3/3) ... [2024-11-16 03:01:05,980 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_4-3a.c.cil.c [2024-11-16 03:01:05,994 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 03:01:05,995 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 03:01:06,039 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 03:01:06,044 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;@6c6ef14c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 03:01:06,044 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 03:01:06,047 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 73 states have internal predecessors, (104), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-16 03:01:06,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-16 03:01:06,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:06,056 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:06,058 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:06,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:06,062 INFO L85 PathProgramCache]: Analyzing trace with hash -971520357, now seen corresponding path program 1 times [2024-11-16 03:01:06,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:01:06,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797012965] [2024-11-16 03:01:06,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:06,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:01:06,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:06,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:01:06,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:06,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:01:06,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:06,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 03:01:06,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:06,577 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-16 03:01:06,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:01:06,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797012965] [2024-11-16 03:01:06,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797012965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:06,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:06,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 03:01:06,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052029136] [2024-11-16 03:01:06,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:06,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 03:01:06,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:01:06,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 03:01:06,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 03:01:06,603 INFO L87 Difference]: Start difference. First operand has 86 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 73 states have internal predecessors, (104), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:06,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:06,746 INFO L93 Difference]: Finished difference Result 188 states and 279 transitions. [2024-11-16 03:01:06,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 03:01:06,749 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2024-11-16 03:01:06,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:06,758 INFO L225 Difference]: With dead ends: 188 [2024-11-16 03:01:06,758 INFO L226 Difference]: Without dead ends: 99 [2024-11-16 03:01:06,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-16 03:01:06,767 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 13 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:06,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 696 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 03:01:06,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-16 03:01:06,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 92. [2024-11-16 03:01:06,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 78 states have internal predecessors, (101), 10 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-16 03:01:06,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 123 transitions. [2024-11-16 03:01:06,805 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 123 transitions. Word has length 36 [2024-11-16 03:01:06,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:06,805 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 123 transitions. [2024-11-16 03:01:06,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:06,806 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 123 transitions. [2024-11-16 03:01:06,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-16 03:01:06,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:06,808 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:06,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 03:01:06,809 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:06,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:06,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1676975581, now seen corresponding path program 1 times [2024-11-16 03:01:06,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:01:06,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086364942] [2024-11-16 03:01:06,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:06,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:01:06,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:06,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:01:06,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:06,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:01:06,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:07,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 03:01:07,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:07,021 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-16 03:01:07,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:01:07,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086364942] [2024-11-16 03:01:07,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086364942] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 03:01:07,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468540401] [2024-11-16 03:01:07,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:07,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:01:07,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:01:07,025 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 03:01:07,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 03:01:07,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:07,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-16 03:01:07,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:07,300 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-16 03:01:07,300 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 03:01:07,661 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-16 03:01:07,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468540401] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 03:01:07,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 03:01:07,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 26 [2024-11-16 03:01:07,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247589091] [2024-11-16 03:01:07,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 03:01:07,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-16 03:01:07,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:01:07,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-16 03:01:07,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2024-11-16 03:01:07,667 INFO L87 Difference]: Start difference. First operand 92 states and 123 transitions. Second operand has 26 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 19 states have internal predecessors, (48), 6 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-16 03:01:08,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:08,099 INFO L93 Difference]: Finished difference Result 222 states and 307 transitions. [2024-11-16 03:01:08,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-16 03:01:08,099 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 19 states have internal predecessors, (48), 6 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) Word has length 42 [2024-11-16 03:01:08,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:08,101 INFO L225 Difference]: With dead ends: 222 [2024-11-16 03:01:08,102 INFO L226 Difference]: Without dead ends: 176 [2024-11-16 03:01:08,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=922, Unknown=0, NotChecked=0, Total=1056 [2024-11-16 03:01:08,103 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 97 mSDsluCounter, 1712 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1823 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:08,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1823 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 03:01:08,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-16 03:01:08,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 156. [2024-11-16 03:01:08,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 127 states have (on average 1.2992125984251968) internal successors, (165), 130 states have internal predecessors, (165), 18 states have call successors, (18), 8 states have call predecessors, (18), 10 states have return successors, (25), 17 states have call predecessors, (25), 17 states have call successors, (25) [2024-11-16 03:01:08,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 208 transitions. [2024-11-16 03:01:08,126 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 208 transitions. Word has length 42 [2024-11-16 03:01:08,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:08,126 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 208 transitions. [2024-11-16 03:01:08,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 19 states have internal predecessors, (48), 6 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-16 03:01:08,127 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 208 transitions. [2024-11-16 03:01:08,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-16 03:01:08,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:08,128 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:08,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-16 03:01:08,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:01:08,333 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:08,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:08,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1687363261, now seen corresponding path program 1 times [2024-11-16 03:01:08,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:01:08,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191841279] [2024-11-16 03:01:08,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:08,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:01:08,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:08,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:01:08,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:08,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:01:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:08,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 03:01:08,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:08,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 03:01:08,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:08,467 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-16 03:01:08,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:01:08,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191841279] [2024-11-16 03:01:08,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191841279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:08,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:08,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 03:01:08,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288728810] [2024-11-16 03:01:08,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:08,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 03:01:08,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:01:08,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 03:01:08,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-16 03:01:08,469 INFO L87 Difference]: Start difference. First operand 156 states and 208 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 03:01:08,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:08,576 INFO L93 Difference]: Finished difference Result 278 states and 377 transitions. [2024-11-16 03:01:08,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 03:01:08,577 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 44 [2024-11-16 03:01:08,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:08,579 INFO L225 Difference]: With dead ends: 278 [2024-11-16 03:01:08,579 INFO L226 Difference]: Without dead ends: 208 [2024-11-16 03:01:08,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-16 03:01:08,580 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 83 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:08,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 911 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 03:01:08,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-16 03:01:08,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 199. [2024-11-16 03:01:08,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 163 states have (on average 1.312883435582822) internal successors, (214), 166 states have internal predecessors, (214), 23 states have call successors, (23), 10 states have call predecessors, (23), 12 states have return successors, (30), 22 states have call predecessors, (30), 22 states have call successors, (30) [2024-11-16 03:01:08,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 267 transitions. [2024-11-16 03:01:08,605 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 267 transitions. Word has length 44 [2024-11-16 03:01:08,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:08,607 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 267 transitions. [2024-11-16 03:01:08,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 03:01:08,607 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 267 transitions. [2024-11-16 03:01:08,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-16 03:01:08,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:08,608 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:08,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 03:01:08,609 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:08,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:08,613 INFO L85 PathProgramCache]: Analyzing trace with hash -80499347, now seen corresponding path program 1 times [2024-11-16 03:01:08,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:01:08,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538236868] [2024-11-16 03:01:08,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:08,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:01:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:08,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:01:08,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:08,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:01:08,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:08,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 03:01:08,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:08,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 03:01:08,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:08,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-16 03:01:08,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:08,896 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 03:01:08,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:01:08,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538236868] [2024-11-16 03:01:08,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538236868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:08,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:08,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-16 03:01:08,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520096936] [2024-11-16 03:01:08,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:08,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-16 03:01:08,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:01:08,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-16 03:01:08,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-11-16 03:01:08,899 INFO L87 Difference]: Start difference. First operand 199 states and 267 transitions. Second operand has 15 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-16 03:01:09,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:09,160 INFO L93 Difference]: Finished difference Result 271 states and 360 transitions. [2024-11-16 03:01:09,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-16 03:01:09,160 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 45 [2024-11-16 03:01:09,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:09,162 INFO L225 Difference]: With dead ends: 271 [2024-11-16 03:01:09,162 INFO L226 Difference]: Without dead ends: 262 [2024-11-16 03:01:09,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2024-11-16 03:01:09,163 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 57 mSDsluCounter, 1551 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 1675 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:09,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 1675 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 03:01:09,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-11-16 03:01:09,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 208. [2024-11-16 03:01:09,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 171 states have (on average 1.304093567251462) internal successors, (223), 173 states have internal predecessors, (223), 23 states have call successors, (23), 10 states have call predecessors, (23), 13 states have return successors, (31), 24 states have call predecessors, (31), 22 states have call successors, (31) [2024-11-16 03:01:09,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 277 transitions. [2024-11-16 03:01:09,183 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 277 transitions. Word has length 45 [2024-11-16 03:01:09,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:09,184 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 277 transitions. [2024-11-16 03:01:09,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-16 03:01:09,184 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 277 transitions. [2024-11-16 03:01:09,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-16 03:01:09,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:09,187 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:09,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 03:01:09,188 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:09,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:09,189 INFO L85 PathProgramCache]: Analyzing trace with hash -209582066, now seen corresponding path program 1 times [2024-11-16 03:01:09,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:01:09,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987958837] [2024-11-16 03:01:09,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:09,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:01:09,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:09,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:01:09,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:09,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:01:09,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:09,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 03:01:09,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:09,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 03:01:09,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:09,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-16 03:01:09,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:09,355 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-16 03:01:09,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:01:09,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987958837] [2024-11-16 03:01:09,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987958837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:09,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:09,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 03:01:09,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798654608] [2024-11-16 03:01:09,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:09,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 03:01:09,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:01:09,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 03:01:09,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-16 03:01:09,359 INFO L87 Difference]: Start difference. First operand 208 states and 277 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-16 03:01:09,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:09,477 INFO L93 Difference]: Finished difference Result 265 states and 350 transitions. [2024-11-16 03:01:09,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 03:01:09,478 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 45 [2024-11-16 03:01:09,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:09,479 INFO L225 Difference]: With dead ends: 265 [2024-11-16 03:01:09,479 INFO L226 Difference]: Without dead ends: 249 [2024-11-16 03:01:09,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-16 03:01:09,480 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 57 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:09,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 894 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 03:01:09,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-11-16 03:01:09,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 202. [2024-11-16 03:01:09,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 166 states have (on average 1.3012048192771084) internal successors, (216), 168 states have internal predecessors, (216), 23 states have call successors, (23), 10 states have call predecessors, (23), 12 states have return successors, (30), 23 states have call predecessors, (30), 22 states have call successors, (30) [2024-11-16 03:01:09,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 269 transitions. [2024-11-16 03:01:09,498 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 269 transitions. Word has length 45 [2024-11-16 03:01:09,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:09,498 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 269 transitions. [2024-11-16 03:01:09,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-16 03:01:09,499 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 269 transitions. [2024-11-16 03:01:09,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-16 03:01:09,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:09,500 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:09,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 03:01:09,500 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:09,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:09,501 INFO L85 PathProgramCache]: Analyzing trace with hash 521154379, now seen corresponding path program 1 times [2024-11-16 03:01:09,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:01:09,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357615544] [2024-11-16 03:01:09,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:09,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:01:09,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:09,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:01:09,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:09,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:01:09,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:09,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 03:01:09,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:09,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 03:01:09,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:09,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-16 03:01:09,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:09,574 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-16 03:01:09,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:01:09,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357615544] [2024-11-16 03:01:09,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357615544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:09,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:09,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 03:01:09,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336827137] [2024-11-16 03:01:09,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:09,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 03:01:09,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:01:09,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 03:01:09,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 03:01:09,576 INFO L87 Difference]: Start difference. First operand 202 states and 269 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-16 03:01:09,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:09,619 INFO L93 Difference]: Finished difference Result 211 states and 277 transitions. [2024-11-16 03:01:09,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 03:01:09,620 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 47 [2024-11-16 03:01:09,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:09,621 INFO L225 Difference]: With dead ends: 211 [2024-11-16 03:01:09,621 INFO L226 Difference]: Without dead ends: 183 [2024-11-16 03:01:09,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-16 03:01:09,622 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 3 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:09,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 491 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 03:01:09,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-16 03:01:09,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2024-11-16 03:01:09,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 151 states have (on average 1.3245033112582782) internal successors, (200), 154 states have internal predecessors, (200), 21 states have call successors, (21), 8 states have call predecessors, (21), 10 states have return successors, (27), 20 states have call predecessors, (27), 20 states have call successors, (27) [2024-11-16 03:01:09,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 248 transitions. [2024-11-16 03:01:09,630 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 248 transitions. Word has length 47 [2024-11-16 03:01:09,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:09,630 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 248 transitions. [2024-11-16 03:01:09,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-16 03:01:09,631 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 248 transitions. [2024-11-16 03:01:09,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-16 03:01:09,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:09,631 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:09,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 03:01:09,632 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:09,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:09,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1664988069, now seen corresponding path program 2 times [2024-11-16 03:01:09,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:01:09,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389978058] [2024-11-16 03:01:09,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:09,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:01:09,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:09,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:01:09,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:09,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:01:09,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:09,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 03:01:09,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:09,912 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 03:01:09,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:01:09,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389978058] [2024-11-16 03:01:09,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389978058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:09,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:09,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-16 03:01:09,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147253872] [2024-11-16 03:01:09,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:09,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 03:01:09,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:01:09,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 03:01:09,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-16 03:01:09,914 INFO L87 Difference]: Start difference. First operand 183 states and 248 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:10,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:10,131 INFO L93 Difference]: Finished difference Result 233 states and 315 transitions. [2024-11-16 03:01:10,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-16 03:01:10,132 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2024-11-16 03:01:10,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:10,134 INFO L225 Difference]: With dead ends: 233 [2024-11-16 03:01:10,134 INFO L226 Difference]: Without dead ends: 230 [2024-11-16 03:01:10,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2024-11-16 03:01:10,134 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 60 mSDsluCounter, 1171 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:10,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 1298 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 03:01:10,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-16 03:01:10,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 221. [2024-11-16 03:01:10,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 183 states have (on average 1.3333333333333333) internal successors, (244), 186 states have internal predecessors, (244), 25 states have call successors, (25), 10 states have call predecessors, (25), 12 states have return successors, (31), 24 states have call predecessors, (31), 24 states have call successors, (31) [2024-11-16 03:01:10,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 300 transitions. [2024-11-16 03:01:10,151 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 300 transitions. Word has length 48 [2024-11-16 03:01:10,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:10,152 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 300 transitions. [2024-11-16 03:01:10,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 9 states have internal predecessors, (30), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:10,152 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 300 transitions. [2024-11-16 03:01:10,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-16 03:01:10,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:10,153 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:10,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 03:01:10,153 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:10,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:10,154 INFO L85 PathProgramCache]: Analyzing trace with hash 2105586822, now seen corresponding path program 1 times [2024-11-16 03:01:10,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:01:10,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048372540] [2024-11-16 03:01:10,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:10,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:01:10,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:10,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:01:10,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:10,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:01:10,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:10,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 03:01:10,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:10,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 03:01:10,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:10,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-16 03:01:10,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:10,316 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-16 03:01:10,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:01:10,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048372540] [2024-11-16 03:01:10,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048372540] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 03:01:10,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510876690] [2024-11-16 03:01:10,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:10,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:01:10,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:01:10,318 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 03:01:10,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 03:01:10,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:10,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-16 03:01:10,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:10,503 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-16 03:01:10,504 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 03:01:10,826 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-16 03:01:10,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510876690] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 03:01:10,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 03:01:10,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 13] total 32 [2024-11-16 03:01:10,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849532304] [2024-11-16 03:01:10,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 03:01:10,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-16 03:01:10,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:01:10,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-16 03:01:10,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2024-11-16 03:01:10,828 INFO L87 Difference]: Start difference. First operand 221 states and 300 transitions. Second operand has 32 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 25 states have internal predecessors, (53), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-16 03:01:12,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:12,189 INFO L93 Difference]: Finished difference Result 481 states and 688 transitions. [2024-11-16 03:01:12,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-16 03:01:12,190 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 25 states have internal predecessors, (53), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) Word has length 51 [2024-11-16 03:01:12,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:12,193 INFO L225 Difference]: With dead ends: 481 [2024-11-16 03:01:12,193 INFO L226 Difference]: Without dead ends: 467 [2024-11-16 03:01:12,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 685 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=327, Invalid=3579, Unknown=0, NotChecked=0, Total=3906 [2024-11-16 03:01:12,196 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 279 mSDsluCounter, 3239 mSDsCounter, 0 mSdLazyCounter, 1439 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 3398 SdHoareTripleChecker+Invalid, 1528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:12,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 3398 Invalid, 1528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1439 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 03:01:12,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2024-11-16 03:01:12,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 283. [2024-11-16 03:01:12,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 231 states have (on average 1.3073593073593073) internal successors, (302), 238 states have internal predecessors, (302), 33 states have call successors, (33), 11 states have call predecessors, (33), 18 states have return successors, (52), 33 states have call predecessors, (52), 32 states have call successors, (52) [2024-11-16 03:01:12,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 387 transitions. [2024-11-16 03:01:12,225 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 387 transitions. Word has length 51 [2024-11-16 03:01:12,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:12,225 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 387 transitions. [2024-11-16 03:01:12,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 25 states have internal predecessors, (53), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-16 03:01:12,225 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 387 transitions. [2024-11-16 03:01:12,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-16 03:01:12,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:12,227 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:12,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 03:01:12,429 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-11-16 03:01:12,430 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:12,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:12,431 INFO L85 PathProgramCache]: Analyzing trace with hash 428102358, now seen corresponding path program 2 times [2024-11-16 03:01:12,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:01:12,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206847341] [2024-11-16 03:01:12,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:12,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:01:12,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:12,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:01:12,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:12,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:01:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:12,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 03:01:12,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:12,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 03:01:12,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:12,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-16 03:01:12,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:12,588 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-16 03:01:12,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:01:12,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206847341] [2024-11-16 03:01:12,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206847341] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 03:01:12,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528041901] [2024-11-16 03:01:12,589 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 03:01:12,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:01:12,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:01:12,590 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 03:01:12,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-16 03:01:12,638 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 03:01:12,639 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 03:01:12,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-16 03:01:12,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:12,767 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-16 03:01:12,767 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 03:01:13,060 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-16 03:01:13,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528041901] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 03:01:13,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 03:01:13,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 13] total 32 [2024-11-16 03:01:13,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862195697] [2024-11-16 03:01:13,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 03:01:13,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-16 03:01:13,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:01:13,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-16 03:01:13,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2024-11-16 03:01:13,062 INFO L87 Difference]: Start difference. First operand 283 states and 387 transitions. Second operand has 32 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 25 states have internal predecessors, (54), 6 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) [2024-11-16 03:01:14,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:14,369 INFO L93 Difference]: Finished difference Result 509 states and 763 transitions. [2024-11-16 03:01:14,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-16 03:01:14,370 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 25 states have internal predecessors, (54), 6 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) Word has length 51 [2024-11-16 03:01:14,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:14,372 INFO L225 Difference]: With dead ends: 509 [2024-11-16 03:01:14,372 INFO L226 Difference]: Without dead ends: 493 [2024-11-16 03:01:14,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=295, Invalid=3245, Unknown=0, NotChecked=0, Total=3540 [2024-11-16 03:01:14,374 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 372 mSDsluCounter, 3033 mSDsCounter, 0 mSdLazyCounter, 1556 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 3201 SdHoareTripleChecker+Invalid, 1645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:14,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 3201 Invalid, 1645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1556 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 03:01:14,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2024-11-16 03:01:14,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 309. [2024-11-16 03:01:14,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 247 states have (on average 1.2874493927125505) internal successors, (318), 257 states have internal predecessors, (318), 39 states have call successors, (39), 12 states have call predecessors, (39), 22 states have return successors, (78), 39 states have call predecessors, (78), 38 states have call successors, (78) [2024-11-16 03:01:14,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 435 transitions. [2024-11-16 03:01:14,393 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 435 transitions. Word has length 51 [2024-11-16 03:01:14,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:14,394 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 435 transitions. [2024-11-16 03:01:14,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 25 states have internal predecessors, (54), 6 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) [2024-11-16 03:01:14,394 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 435 transitions. [2024-11-16 03:01:14,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-16 03:01:14,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:14,395 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:14,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-16 03:01:14,599 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-11-16 03:01:14,600 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:14,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:14,600 INFO L85 PathProgramCache]: Analyzing trace with hash 729009988, now seen corresponding path program 1 times [2024-11-16 03:01:14,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:01:14,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660032984] [2024-11-16 03:01:14,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:14,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:01:14,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:14,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:01:14,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:14,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:01:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:14,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 03:01:14,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:14,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 03:01:14,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:14,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-16 03:01:14,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:14,768 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-16 03:01:14,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:01:14,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660032984] [2024-11-16 03:01:14,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660032984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:14,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:14,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 03:01:14,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476970455] [2024-11-16 03:01:14,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:14,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 03:01:14,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:01:14,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 03:01:14,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-16 03:01:14,770 INFO L87 Difference]: Start difference. First operand 309 states and 435 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 03:01:14,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:14,895 INFO L93 Difference]: Finished difference Result 383 states and 564 transitions. [2024-11-16 03:01:14,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 03:01:14,895 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 53 [2024-11-16 03:01:14,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:14,897 INFO L225 Difference]: With dead ends: 383 [2024-11-16 03:01:14,897 INFO L226 Difference]: Without dead ends: 369 [2024-11-16 03:01:14,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-16 03:01:14,898 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 46 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:14,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 1010 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 03:01:14,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-11-16 03:01:14,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 316. [2024-11-16 03:01:14,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 251 states have (on average 1.2828685258964143) internal successors, (322), 262 states have internal predecessors, (322), 41 states have call successors, (41), 12 states have call predecessors, (41), 23 states have return successors, (91), 41 states have call predecessors, (91), 40 states have call successors, (91) [2024-11-16 03:01:14,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 454 transitions. [2024-11-16 03:01:14,918 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 454 transitions. Word has length 53 [2024-11-16 03:01:14,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:14,918 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 454 transitions. [2024-11-16 03:01:14,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 03:01:14,918 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 454 transitions. [2024-11-16 03:01:14,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-16 03:01:14,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:14,919 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:14,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 03:01:14,919 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:14,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:14,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1731941166, now seen corresponding path program 1 times [2024-11-16 03:01:14,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:01:14,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703801771] [2024-11-16 03:01:14,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:14,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:01:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:14,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:01:14,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:14,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:01:14,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:14,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 03:01:14,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:14,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 03:01:14,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:14,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-16 03:01:14,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:14,996 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-16 03:01:14,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:01:14,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703801771] [2024-11-16 03:01:14,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703801771] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 03:01:14,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801658310] [2024-11-16 03:01:14,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:14,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:01:14,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:01:14,998 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 03:01:14,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-16 03:01:15,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:15,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-16 03:01:15,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:15,113 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-16 03:01:15,114 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 03:01:15,318 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-16 03:01:15,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801658310] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 03:01:15,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 03:01:15,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 10] total 21 [2024-11-16 03:01:15,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083750006] [2024-11-16 03:01:15,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 03:01:15,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-16 03:01:15,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:01:15,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-16 03:01:15,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2024-11-16 03:01:15,320 INFO L87 Difference]: Start difference. First operand 316 states and 454 transitions. Second operand has 21 states, 19 states have (on average 3.210526315789474) internal successors, (61), 18 states have internal predecessors, (61), 5 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 7 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-16 03:01:15,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:15,765 INFO L93 Difference]: Finished difference Result 545 states and 830 transitions. [2024-11-16 03:01:15,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-16 03:01:15,766 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 3.210526315789474) internal successors, (61), 18 states have internal predecessors, (61), 5 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 7 states have call predecessors, (11), 4 states have call successors, (11) Word has length 53 [2024-11-16 03:01:15,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:15,769 INFO L225 Difference]: With dead ends: 545 [2024-11-16 03:01:15,769 INFO L226 Difference]: Without dead ends: 525 [2024-11-16 03:01:15,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2024-11-16 03:01:15,770 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 130 mSDsluCounter, 2379 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 2565 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:15,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 2565 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 03:01:15,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2024-11-16 03:01:15,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 336. [2024-11-16 03:01:15,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 263 states have (on average 1.2661596958174905) internal successors, (333), 277 states have internal predecessors, (333), 46 states have call successors, (46), 12 states have call predecessors, (46), 26 states have return successors, (120), 46 states have call predecessors, (120), 45 states have call successors, (120) [2024-11-16 03:01:15,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 499 transitions. [2024-11-16 03:01:15,791 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 499 transitions. Word has length 53 [2024-11-16 03:01:15,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:15,791 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 499 transitions. [2024-11-16 03:01:15,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 3.210526315789474) internal successors, (61), 18 states have internal predecessors, (61), 5 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 7 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-16 03:01:15,791 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 499 transitions. [2024-11-16 03:01:15,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-16 03:01:15,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:15,792 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:15,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-16 03:01:15,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:01:15,997 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:15,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:15,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1555489211, now seen corresponding path program 1 times [2024-11-16 03:01:15,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:01:15,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417024724] [2024-11-16 03:01:15,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:15,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:01:16,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:16,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:01:16,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:16,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:01:16,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:16,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 03:01:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:16,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 03:01:16,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:16,137 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 03:01:16,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:01:16,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417024724] [2024-11-16 03:01:16,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417024724] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 03:01:16,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264921938] [2024-11-16 03:01:16,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:16,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:01:16,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:01:16,139 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-11-16 03:01:16,140 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-11-16 03:01:16,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:16,184 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-16 03:01:16,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:16,316 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 03:01:16,316 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:01:16,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264921938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:16,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 03:01:16,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [9] total 18 [2024-11-16 03:01:16,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409903289] [2024-11-16 03:01:16,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:16,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-16 03:01:16,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:01:16,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-16 03:01:16,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2024-11-16 03:01:16,318 INFO L87 Difference]: Start difference. First operand 336 states and 499 transitions. Second operand has 15 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-16 03:01:16,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:16,550 INFO L93 Difference]: Finished difference Result 567 states and 814 transitions. [2024-11-16 03:01:16,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-16 03:01:16,550 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 54 [2024-11-16 03:01:16,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:16,552 INFO L225 Difference]: With dead ends: 567 [2024-11-16 03:01:16,553 INFO L226 Difference]: Without dead ends: 436 [2024-11-16 03:01:16,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2024-11-16 03:01:16,554 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 63 mSDsluCounter, 1772 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1931 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:16,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 1931 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 03:01:16,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2024-11-16 03:01:16,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 411. [2024-11-16 03:01:16,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 326 states have (on average 1.2699386503067485) internal successors, (414), 341 states have internal predecessors, (414), 53 states have call successors, (53), 16 states have call predecessors, (53), 31 states have return successors, (122), 53 states have call predecessors, (122), 52 states have call successors, (122) [2024-11-16 03:01:16,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 589 transitions. [2024-11-16 03:01:16,588 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 589 transitions. Word has length 54 [2024-11-16 03:01:16,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:16,588 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 589 transitions. [2024-11-16 03:01:16,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-16 03:01:16,589 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 589 transitions. [2024-11-16 03:01:16,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-16 03:01:16,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:16,590 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:16,604 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-11-16 03:01:16,790 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,SelfDestructingSolverStorable11 [2024-11-16 03:01:16,791 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:16,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:16,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1093708074, now seen corresponding path program 1 times [2024-11-16 03:01:16,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:01:16,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391877236] [2024-11-16 03:01:16,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:16,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:01:16,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:16,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:01:16,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:16,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:01:16,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:16,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 03:01:16,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:16,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 03:01:16,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:16,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 03:01:16,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:16,902 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-16 03:01:16,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:01:16,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391877236] [2024-11-16 03:01:16,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391877236] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 03:01:16,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647325102] [2024-11-16 03:01:16,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:16,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:01:16,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:01:16,906 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-11-16 03:01:16,908 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-11-16 03:01:16,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:16,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-16 03:01:16,962 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:17,048 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-16 03:01:17,049 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 03:01:17,262 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-16 03:01:17,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647325102] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 03:01:17,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 03:01:17,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11] total 24 [2024-11-16 03:01:17,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335849741] [2024-11-16 03:01:17,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 03:01:17,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-16 03:01:17,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:01:17,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-16 03:01:17,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2024-11-16 03:01:17,265 INFO L87 Difference]: Start difference. First operand 411 states and 589 transitions. Second operand has 24 states, 23 states have (on average 2.782608695652174) internal successors, (64), 18 states have internal predecessors, (64), 6 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (11), 8 states have call predecessors, (11), 5 states have call successors, (11) [2024-11-16 03:01:17,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:17,664 INFO L93 Difference]: Finished difference Result 560 states and 779 transitions. [2024-11-16 03:01:17,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-16 03:01:17,668 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.782608695652174) internal successors, (64), 18 states have internal predecessors, (64), 6 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (11), 8 states have call predecessors, (11), 5 states have call successors, (11) Word has length 56 [2024-11-16 03:01:17,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:17,671 INFO L225 Difference]: With dead ends: 560 [2024-11-16 03:01:17,672 INFO L226 Difference]: Without dead ends: 420 [2024-11-16 03:01:17,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=988, Unknown=0, NotChecked=0, Total=1122 [2024-11-16 03:01:17,674 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 261 mSDsluCounter, 1994 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 2140 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:17,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 2140 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 03:01:17,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-11-16 03:01:17,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 392. [2024-11-16 03:01:17,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 313 states have (on average 1.2715654952076678) internal successors, (398), 326 states have internal predecessors, (398), 50 states have call successors, (50), 15 states have call predecessors, (50), 28 states have return successors, (96), 50 states have call predecessors, (96), 49 states have call successors, (96) [2024-11-16 03:01:17,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 544 transitions. [2024-11-16 03:01:17,695 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 544 transitions. Word has length 56 [2024-11-16 03:01:17,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:17,695 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 544 transitions. [2024-11-16 03:01:17,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.782608695652174) internal successors, (64), 18 states have internal predecessors, (64), 6 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (11), 8 states have call predecessors, (11), 5 states have call successors, (11) [2024-11-16 03:01:17,695 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 544 transitions. [2024-11-16 03:01:17,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-16 03:01:17,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:17,697 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:17,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-16 03:01:17,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:01:17,898 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:17,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:17,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1989621980, now seen corresponding path program 1 times [2024-11-16 03:01:17,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:01:17,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001450194] [2024-11-16 03:01:17,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:17,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:01:17,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:17,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:01:17,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:17,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:01:17,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:17,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 03:01:17,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:18,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 03:01:18,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:18,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 03:01:18,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:18,021 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-16 03:01:18,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:01:18,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001450194] [2024-11-16 03:01:18,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001450194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:18,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:18,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 03:01:18,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193679418] [2024-11-16 03:01:18,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:18,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 03:01:18,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:01:18,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 03:01:18,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-16 03:01:18,023 INFO L87 Difference]: Start difference. First operand 392 states and 544 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-16 03:01:18,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:18,106 INFO L93 Difference]: Finished difference Result 415 states and 566 transitions. [2024-11-16 03:01:18,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 03:01:18,106 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 56 [2024-11-16 03:01:18,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:18,108 INFO L225 Difference]: With dead ends: 415 [2024-11-16 03:01:18,108 INFO L226 Difference]: Without dead ends: 358 [2024-11-16 03:01:18,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-16 03:01:18,109 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 10 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:18,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 832 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 03:01:18,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-11-16 03:01:18,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 353. [2024-11-16 03:01:18,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 281 states have (on average 1.2633451957295374) internal successors, (355), 293 states have internal predecessors, (355), 45 states have call successors, (45), 14 states have call predecessors, (45), 26 states have return successors, (87), 45 states have call predecessors, (87), 44 states have call successors, (87) [2024-11-16 03:01:18,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 487 transitions. [2024-11-16 03:01:18,126 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 487 transitions. Word has length 56 [2024-11-16 03:01:18,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:18,127 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 487 transitions. [2024-11-16 03:01:18,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-16 03:01:18,127 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 487 transitions. [2024-11-16 03:01:18,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-16 03:01:18,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:18,128 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:18,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 03:01:18,128 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:18,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:18,129 INFO L85 PathProgramCache]: Analyzing trace with hash -420787939, now seen corresponding path program 1 times [2024-11-16 03:01:18,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:01:18,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130974741] [2024-11-16 03:01:18,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:18,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:01:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:18,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:01:18,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:18,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:01:18,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:18,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 03:01:18,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:18,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 03:01:18,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:18,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-16 03:01:18,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:18,157 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 03:01:18,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:01:18,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130974741] [2024-11-16 03:01:18,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130974741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:18,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:18,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:01:18,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629602989] [2024-11-16 03:01:18,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:18,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:01:18,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:01:18,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:01:18,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:01:18,159 INFO L87 Difference]: Start difference. First operand 353 states and 487 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 03:01:18,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:18,206 INFO L93 Difference]: Finished difference Result 716 states and 991 transitions. [2024-11-16 03:01:18,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:01:18,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2024-11-16 03:01:18,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:18,208 INFO L225 Difference]: With dead ends: 716 [2024-11-16 03:01:18,208 INFO L226 Difference]: Without dead ends: 366 [2024-11-16 03:01:18,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:01:18,210 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 13 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:18,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 180 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 03:01:18,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-11-16 03:01:18,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 359. [2024-11-16 03:01:18,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 287 states have (on average 1.2613240418118468) internal successors, (362), 299 states have internal predecessors, (362), 45 states have call successors, (45), 14 states have call predecessors, (45), 26 states have return successors, (87), 45 states have call predecessors, (87), 44 states have call successors, (87) [2024-11-16 03:01:18,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 494 transitions. [2024-11-16 03:01:18,227 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 494 transitions. Word has length 57 [2024-11-16 03:01:18,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:18,227 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 494 transitions. [2024-11-16 03:01:18,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 03:01:18,228 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 494 transitions. [2024-11-16 03:01:18,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-16 03:01:18,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:18,229 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:18,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 03:01:18,229 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:18,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:18,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1423091872, now seen corresponding path program 1 times [2024-11-16 03:01:18,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:01:18,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959144479] [2024-11-16 03:01:18,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:18,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:01:18,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:18,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:01:18,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:18,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:01:18,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:18,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 03:01:18,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:18,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 03:01:18,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:18,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 03:01:18,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:18,262 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 03:01:18,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:01:18,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959144479] [2024-11-16 03:01:18,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959144479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:18,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:18,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 03:01:18,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963804174] [2024-11-16 03:01:18,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:18,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 03:01:18,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:01:18,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 03:01:18,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:01:18,264 INFO L87 Difference]: Start difference. First operand 359 states and 494 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 03:01:18,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:18,303 INFO L93 Difference]: Finished difference Result 721 states and 996 transitions. [2024-11-16 03:01:18,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 03:01:18,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2024-11-16 03:01:18,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:18,305 INFO L225 Difference]: With dead ends: 721 [2024-11-16 03:01:18,305 INFO L226 Difference]: Without dead ends: 365 [2024-11-16 03:01:18,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 03:01:18,307 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 7 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 184 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.0s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:18,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 184 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 03:01:18,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-11-16 03:01:18,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 361. [2024-11-16 03:01:18,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 289 states have (on average 1.259515570934256) internal successors, (364), 301 states have internal predecessors, (364), 45 states have call successors, (45), 14 states have call predecessors, (45), 26 states have return successors, (87), 45 states have call predecessors, (87), 44 states have call successors, (87) [2024-11-16 03:01:18,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 496 transitions. [2024-11-16 03:01:18,324 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 496 transitions. Word has length 58 [2024-11-16 03:01:18,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:18,324 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 496 transitions. [2024-11-16 03:01:18,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 03:01:18,324 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 496 transitions. [2024-11-16 03:01:18,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-16 03:01:18,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:18,325 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:18,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 03:01:18,325 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:18,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:18,326 INFO L85 PathProgramCache]: Analyzing trace with hash -511944975, now seen corresponding path program 1 times [2024-11-16 03:01:18,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:01:18,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973316484] [2024-11-16 03:01:18,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:18,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:01:18,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:18,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:01:18,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:18,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:01:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:18,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 03:01:18,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:18,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-16 03:01:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:18,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 03:01:18,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:18,397 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 03:01:18,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:01:18,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973316484] [2024-11-16 03:01:18,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973316484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:18,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:18,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 03:01:18,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908942568] [2024-11-16 03:01:18,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:18,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 03:01:18,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:01:18,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 03:01:18,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 03:01:18,398 INFO L87 Difference]: Start difference. First operand 361 states and 496 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 03:01:18,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:18,458 INFO L93 Difference]: Finished difference Result 730 states and 1007 transitions. [2024-11-16 03:01:18,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 03:01:18,458 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 59 [2024-11-16 03:01:18,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:18,460 INFO L225 Difference]: With dead ends: 730 [2024-11-16 03:01:18,460 INFO L226 Difference]: Without dead ends: 372 [2024-11-16 03:01:18,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 03:01:18,462 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 11 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:18,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 287 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 03:01:18,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-11-16 03:01:18,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 359. [2024-11-16 03:01:18,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 287 states have (on average 1.2578397212543555) internal successors, (361), 299 states have internal predecessors, (361), 45 states have call successors, (45), 14 states have call predecessors, (45), 26 states have return successors, (87), 45 states have call predecessors, (87), 44 states have call successors, (87) [2024-11-16 03:01:18,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 493 transitions. [2024-11-16 03:01:18,479 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 493 transitions. Word has length 59 [2024-11-16 03:01:18,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:18,479 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 493 transitions. [2024-11-16 03:01:18,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 03:01:18,480 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 493 transitions. [2024-11-16 03:01:18,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-16 03:01:18,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:18,480 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:18,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 03:01:18,481 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:18,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:18,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1678552679, now seen corresponding path program 1 times [2024-11-16 03:01:18,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:01:18,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998837723] [2024-11-16 03:01:18,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:18,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:01:18,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:18,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:01:18,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:18,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:01:18,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:18,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 03:01:18,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:18,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-16 03:01:18,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:18,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 03:01:18,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:18,643 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-16 03:01:18,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:01:18,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998837723] [2024-11-16 03:01:18,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998837723] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 03:01:18,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237552021] [2024-11-16 03:01:18,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:18,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:01:18,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:01:18,646 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 03:01:18,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-16 03:01:18,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:18,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-16 03:01:18,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:18,723 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-16 03:01:18,723 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 03:01:18,938 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-16 03:01:18,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237552021] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 03:01:18,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 03:01:18,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2024-11-16 03:01:18,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642373948] [2024-11-16 03:01:18,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 03:01:18,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-16 03:01:18,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:01:18,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-16 03:01:18,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2024-11-16 03:01:18,940 INFO L87 Difference]: Start difference. First operand 359 states and 493 transitions. Second operand has 25 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 21 states have internal predecessors, (58), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-16 03:01:19,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:19,578 INFO L93 Difference]: Finished difference Result 431 states and 612 transitions. [2024-11-16 03:01:19,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-16 03:01:19,579 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 21 states have internal predecessors, (58), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2024-11-16 03:01:19,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:19,580 INFO L225 Difference]: With dead ends: 431 [2024-11-16 03:01:19,581 INFO L226 Difference]: Without dead ends: 398 [2024-11-16 03:01:19,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=1269, Unknown=0, NotChecked=0, Total=1406 [2024-11-16 03:01:19,582 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 165 mSDsluCounter, 1911 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 2035 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:19,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 2035 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 03:01:19,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-11-16 03:01:19,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 347. [2024-11-16 03:01:19,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 278 states have (on average 1.2661870503597121) internal successors, (352), 289 states have internal predecessors, (352), 44 states have call successors, (44), 12 states have call predecessors, (44), 24 states have return successors, (86), 45 states have call predecessors, (86), 43 states have call successors, (86) [2024-11-16 03:01:19,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 482 transitions. [2024-11-16 03:01:19,598 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 482 transitions. Word has length 59 [2024-11-16 03:01:19,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:19,598 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 482 transitions. [2024-11-16 03:01:19,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 21 states have internal predecessors, (58), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-16 03:01:19,599 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 482 transitions. [2024-11-16 03:01:19,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-16 03:01:19,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:19,600 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:19,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-16 03:01:19,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:01:19,804 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:19,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:19,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1394028433, now seen corresponding path program 2 times [2024-11-16 03:01:19,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:01:19,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925687121] [2024-11-16 03:01:19,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:19,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:01:19,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:19,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:01:19,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:19,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:01:19,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:19,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 03:01:19,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:19,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-16 03:01:19,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:19,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-16 03:01:19,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:19,960 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-16 03:01:19,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:01:19,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925687121] [2024-11-16 03:01:19,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925687121] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 03:01:19,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703807554] [2024-11-16 03:01:19,960 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 03:01:19,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:01:19,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:01:19,962 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 03:01:19,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-16 03:01:20,024 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 03:01:20,024 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 03:01:20,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-16 03:01:20,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:20,124 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-16 03:01:20,124 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 03:01:20,527 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-16 03:01:20,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703807554] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 03:01:20,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 03:01:20,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 29 [2024-11-16 03:01:20,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847222181] [2024-11-16 03:01:20,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 03:01:20,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-16 03:01:20,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:01:20,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-16 03:01:20,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=739, Unknown=0, NotChecked=0, Total=812 [2024-11-16 03:01:20,530 INFO L87 Difference]: Start difference. First operand 347 states and 482 transitions. Second operand has 29 states, 27 states have (on average 2.2962962962962963) internal successors, (62), 24 states have internal predecessors, (62), 4 states have call successors, (7), 2 states have call predecessors, (7), 6 states have return successors, (8), 6 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-16 03:01:21,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:21,082 INFO L93 Difference]: Finished difference Result 417 states and 591 transitions. [2024-11-16 03:01:21,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-16 03:01:21,082 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 2.2962962962962963) internal successors, (62), 24 states have internal predecessors, (62), 4 states have call successors, (7), 2 states have call predecessors, (7), 6 states have return successors, (8), 6 states have call predecessors, (8), 3 states have call successors, (8) Word has length 59 [2024-11-16 03:01:21,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:21,085 INFO L225 Difference]: With dead ends: 417 [2024-11-16 03:01:21,085 INFO L226 Difference]: Without dead ends: 386 [2024-11-16 03:01:21,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=1279, Unknown=0, NotChecked=0, Total=1406 [2024-11-16 03:01:21,086 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 162 mSDsluCounter, 2263 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 2387 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:21,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 2387 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 870 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 03:01:21,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2024-11-16 03:01:21,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 339. [2024-11-16 03:01:21,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 271 states have (on average 1.2730627306273063) internal successors, (345), 284 states have internal predecessors, (345), 43 states have call successors, (43), 10 states have call predecessors, (43), 24 states have return successors, (85), 44 states have call predecessors, (85), 42 states have call successors, (85) [2024-11-16 03:01:21,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 473 transitions. [2024-11-16 03:01:21,107 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 473 transitions. Word has length 59 [2024-11-16 03:01:21,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:21,107 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 473 transitions. [2024-11-16 03:01:21,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 2.2962962962962963) internal successors, (62), 24 states have internal predecessors, (62), 4 states have call successors, (7), 2 states have call predecessors, (7), 6 states have return successors, (8), 6 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-16 03:01:21,107 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 473 transitions. [2024-11-16 03:01:21,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-16 03:01:21,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:21,108 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:21,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-16 03:01:21,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:01:21,310 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:21,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:21,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1502764983, now seen corresponding path program 1 times [2024-11-16 03:01:21,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:01:21,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304609432] [2024-11-16 03:01:21,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:21,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:01:21,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:21,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:01:21,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:21,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:01:21,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:21,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 03:01:21,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:21,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 03:01:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:21,428 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-16 03:01:21,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:01:21,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304609432] [2024-11-16 03:01:21,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304609432] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 03:01:21,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705862211] [2024-11-16 03:01:21,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:21,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:01:21,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:01:21,430 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 03:01:21,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-16 03:01:21,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:21,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-16 03:01:21,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:21,515 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-16 03:01:21,515 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 03:01:21,616 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-16 03:01:21,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705862211] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 03:01:21,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 03:01:21,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-11-16 03:01:21,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538388351] [2024-11-16 03:01:21,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 03:01:21,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-16 03:01:21,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:01:21,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-16 03:01:21,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-11-16 03:01:21,618 INFO L87 Difference]: Start difference. First operand 339 states and 473 transitions. Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 12 states have internal predecessors, (52), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-16 03:01:21,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:21,800 INFO L93 Difference]: Finished difference Result 592 states and 817 transitions. [2024-11-16 03:01:21,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 03:01:21,800 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 12 states have internal predecessors, (52), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) Word has length 60 [2024-11-16 03:01:21,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:21,802 INFO L225 Difference]: With dead ends: 592 [2024-11-16 03:01:21,802 INFO L226 Difference]: Without dead ends: 427 [2024-11-16 03:01:21,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2024-11-16 03:01:21,803 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 165 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:21,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 924 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 03:01:21,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2024-11-16 03:01:21,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 375. [2024-11-16 03:01:21,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 302 states have (on average 1.2748344370860927) internal successors, (385), 317 states have internal predecessors, (385), 45 states have call successors, (45), 11 states have call predecessors, (45), 27 states have return successors, (85), 46 states have call predecessors, (85), 44 states have call successors, (85) [2024-11-16 03:01:21,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 515 transitions. [2024-11-16 03:01:21,826 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 515 transitions. Word has length 60 [2024-11-16 03:01:21,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:21,827 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 515 transitions. [2024-11-16 03:01:21,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 12 states have internal predecessors, (52), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-16 03:01:21,827 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 515 transitions. [2024-11-16 03:01:21,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-16 03:01:21,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:21,828 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:21,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-16 03:01:22,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 03:01:22,030 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:22,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:22,030 INFO L85 PathProgramCache]: Analyzing trace with hash 653433855, now seen corresponding path program 2 times [2024-11-16 03:01:22,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:01:22,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376019462] [2024-11-16 03:01:22,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:22,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:01:22,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:22,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:01:22,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:22,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:01:22,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:22,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 03:01:22,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:22,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 03:01:22,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:22,154 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-16 03:01:22,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:01:22,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376019462] [2024-11-16 03:01:22,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376019462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:22,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:22,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 03:01:22,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012204942] [2024-11-16 03:01:22,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:22,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 03:01:22,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:01:22,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 03:01:22,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-16 03:01:22,156 INFO L87 Difference]: Start difference. First operand 375 states and 515 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 03:01:22,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:22,273 INFO L93 Difference]: Finished difference Result 547 states and 740 transitions. [2024-11-16 03:01:22,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 03:01:22,273 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 60 [2024-11-16 03:01:22,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:22,275 INFO L225 Difference]: With dead ends: 547 [2024-11-16 03:01:22,275 INFO L226 Difference]: Without dead ends: 382 [2024-11-16 03:01:22,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-16 03:01:22,276 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 60 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:22,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 780 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 03:01:22,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2024-11-16 03:01:22,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 375. [2024-11-16 03:01:22,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 302 states have (on average 1.2682119205298013) internal successors, (383), 317 states have internal predecessors, (383), 45 states have call successors, (45), 11 states have call predecessors, (45), 27 states have return successors, (85), 46 states have call predecessors, (85), 44 states have call successors, (85) [2024-11-16 03:01:22,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 513 transitions. [2024-11-16 03:01:22,296 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 513 transitions. Word has length 60 [2024-11-16 03:01:22,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:22,296 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 513 transitions. [2024-11-16 03:01:22,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 03:01:22,296 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 513 transitions. [2024-11-16 03:01:22,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-16 03:01:22,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:22,298 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:22,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-16 03:01:22,300 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:22,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:22,300 INFO L85 PathProgramCache]: Analyzing trace with hash -699875842, now seen corresponding path program 1 times [2024-11-16 03:01:22,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:01:22,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513566808] [2024-11-16 03:01:22,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:22,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:01:22,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:22,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 03:01:22,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:22,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-16 03:01:22,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:22,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 03:01:22,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:22,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 03:01:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:22,428 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-16 03:01:22,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 03:01:22,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513566808] [2024-11-16 03:01:22,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513566808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:22,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:22,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 03:01:22,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984452893] [2024-11-16 03:01:22,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:22,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 03:01:22,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 03:01:22,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 03:01:22,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-16 03:01:22,429 INFO L87 Difference]: Start difference. First operand 375 states and 513 transitions. Second operand has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 03:01:22,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:22,611 INFO L93 Difference]: Finished difference Result 493 states and 668 transitions. [2024-11-16 03:01:22,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 03:01:22,611 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 60 [2024-11-16 03:01:22,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:22,613 INFO L225 Difference]: With dead ends: 493 [2024-11-16 03:01:22,613 INFO L226 Difference]: Without dead ends: 399 [2024-11-16 03:01:22,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-16 03:01:22,614 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 95 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:22,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 1079 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 03:01:22,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-11-16 03:01:22,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 375. [2024-11-16 03:01:22,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 302 states have (on average 1.2649006622516556) internal successors, (382), 317 states have internal predecessors, (382), 45 states have call successors, (45), 11 states have call predecessors, (45), 27 states have return successors, (85), 46 states have call predecessors, (85), 44 states have call successors, (85) [2024-11-16 03:01:22,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 512 transitions. [2024-11-16 03:01:22,636 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 512 transitions. Word has length 60 [2024-11-16 03:01:22,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:22,636 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 512 transitions. [2024-11-16 03:01:22,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 03:01:22,636 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 512 transitions. [2024-11-16 03:01:22,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-16 03:01:22,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:22,637 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:22,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-16 03:01:22,638 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:22,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:22,638 INFO L85 PathProgramCache]: Analyzing trace with hash 2097682084, now seen corresponding path program 1 times [2024-11-16 03:01:22,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 03:01:22,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814627390] [2024-11-16 03:01:22,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:22,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 03:01:22,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 03:01:22,655 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 03:01:22,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 03:01:22,700 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 03:01:22,700 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 03:01:22,701 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 03:01:22,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-16 03:01:22,705 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:22,731 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 03:01:22,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 03:01:22 BoogieIcfgContainer [2024-11-16 03:01:22,735 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 03:01:22,736 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 03:01:22,736 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 03:01:22,736 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 03:01:22,736 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:01:05" (3/4) ... [2024-11-16 03:01:22,738 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 03:01:22,739 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 03:01:22,739 INFO L158 Benchmark]: Toolchain (without parser) took 17583.85ms. Allocated memory was 148.9MB in the beginning and 371.2MB in the end (delta: 222.3MB). Free memory was 90.5MB in the beginning and 333.7MB in the end (delta: -243.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 03:01:22,739 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 90.2MB. Free memory was 44.3MB in the beginning and 44.1MB in the end (delta: 157.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 03:01:22,741 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.65ms. Allocated memory is still 148.9MB. Free memory was 90.5MB in the beginning and 113.0MB in the end (delta: -22.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-16 03:01:22,741 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.82ms. Allocated memory is still 148.9MB. Free memory was 113.0MB in the beginning and 111.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 03:01:22,741 INFO L158 Benchmark]: Boogie Preprocessor took 42.50ms. Allocated memory is still 148.9MB. Free memory was 111.5MB in the beginning and 109.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 03:01:22,742 INFO L158 Benchmark]: IcfgBuilder took 423.50ms. Allocated memory is still 148.9MB. Free memory was 109.4MB in the beginning and 88.3MB in the end (delta: 21.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-16 03:01:22,742 INFO L158 Benchmark]: TraceAbstraction took 16760.60ms. Allocated memory was 148.9MB in the beginning and 371.2MB in the end (delta: 222.3MB). Free memory was 87.7MB in the beginning and 333.7MB in the end (delta: -246.1MB). Peak memory consumption was 192.7MB. Max. memory is 16.1GB. [2024-11-16 03:01:22,742 INFO L158 Benchmark]: Witness Printer took 3.00ms. Allocated memory is still 371.2MB. Free memory is still 333.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 03:01:22,742 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.13ms. Allocated memory is still 90.2MB. Free memory was 44.3MB in the beginning and 44.1MB in the end (delta: 157.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 323.65ms. Allocated memory is still 148.9MB. Free memory was 90.5MB in the beginning and 113.0MB in the end (delta: -22.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.82ms. Allocated memory is still 148.9MB. Free memory was 113.0MB in the beginning and 111.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.50ms. Allocated memory is still 148.9MB. Free memory was 111.5MB in the beginning and 109.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 423.50ms. Allocated memory is still 148.9MB. Free memory was 109.4MB in the beginning and 88.3MB in the end (delta: 21.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 16760.60ms. Allocated memory was 148.9MB in the beginning and 371.2MB in the end (delta: 222.3MB). Free memory was 87.7MB in the beginning and 333.7MB in the end (delta: -246.1MB). Peak memory consumption was 192.7MB. Max. memory is 16.1GB. * Witness Printer took 3.00ms. Allocated memory is still 371.2MB. Free memory is still 333.7MB. 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: 17]: 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 bitwiseOr at line 110, overapproximation of bitwiseAnd at line 76. Possible FailurePath: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_add1 ; [L233] unsigned int r_add2 ; [L234] unsigned int zero ; [L235] int tmp ; [L236] int tmp___0 ; [L237] int __retres14 ; VAL [ea=127, eb=-127] [L241] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, e=0] [L241] RET, EXPR base2flt(0, 0) VAL [ea=127, eb=-127] [L241] zero = base2flt(0, 0) [L242] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=127, \old(m)=33554432] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L29] COND FALSE !(! m) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L57] COND TRUE 1 VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L59] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L64] COND TRUE e >= 127 [L65] __retres4 = 4294967295U VAL [\old(e)=127, \old(m)=33554432, __retres4=4294967295, m=33554432] [L80] return (__retres4); VAL [\old(e)=127, \old(m)=33554432, \result=4294967295, m=33554432] [L242] RET, EXPR base2flt(ma, ea) VAL [ea=127, eb=-127, ma=33554432] [L242] a = base2flt(ma, ea) [L243] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=-127, \old(m)=4311744512] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=-127, \old(m)=4311744512, e=-127, m=4311744512] [L29] COND FALSE !(! m) VAL [\old(e)=-127, \old(m)=4311744512, e=-127, m=4311744512] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-127, \old(m)=4311744512, e=-127, m=4311744512] [L57] COND TRUE 1 VAL [\old(e)=-127, \old(m)=4311744512, e=-127, m=4311744512] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-127, \old(m)=4311744512, e=-127, m=4311744512] [L76] EXPR m & ~ (1U << 24U) VAL [\old(e)=-127, \old(m)=4311744512, e=-127] [L76] m = m & ~ (1U << 24U) [L77] EXPR m | ((unsigned int )(e + 128) << 24U) VAL [\old(e)=-127, \old(m)=4311744512] [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=-127, \old(m)=4311744512, __retres4=16777216] [L80] return (__retres4); VAL [\old(e)=-127, \old(m)=4311744512, \result=16777216] [L243] RET, EXPR base2flt(mb, eb) VAL [a=4294967295, ea=127, eb=-127, ma=33554432, mb=4311744512] [L243] b = base2flt(mb, eb) [L244] CALL addflt(a, b) VAL [\old(a)=4294967295, \old(b)=16777216] [L84] unsigned int res ; [L85] unsigned int ma ; [L86] unsigned int mb ; [L87] unsigned int delta ; [L88] int ea ; [L89] int eb ; [L90] unsigned int tmp ; [L91] unsigned int __retres10 ; VAL [\old(a)=4294967295, \old(b)=16777216, a=4294967295, b=16777216] [L94] COND FALSE !(a < b) VAL [\old(a)=4294967295, \old(b)=16777216, a=4294967295, b=16777216] [L101] COND FALSE !(! b) [L108] ma = a & ((1U << 24U) - 1U) [L109] ea = (int )(a >> 24U) - 128 VAL [\old(a)=4294967295, \old(b)=16777216, a=4294967295, b=16777216, ea=127, ma=16777215] [L110] EXPR ma | (1U << 24U) VAL [\old(a)=4294967295, \old(b)=16777216, a=4294967295, b=16777216, ea=127] [L110] ma = ma | (1U << 24U) [L111] mb = b & ((1U << 24U) - 1U) [L112] eb = (int )(b >> 24U) - 128 VAL [\old(a)=4294967295, \old(b)=16777216, a=4294967295, ea=127, eb=-127, ma=16777216, mb=0] [L113] EXPR mb | (1U << 24U) VAL [\old(a)=4294967295, \old(b)=16777216, a=4294967295, ea=127, eb=-127, ma=16777216] [L113] mb = mb | (1U << 24U) [L114] CALL __VERIFIER_assert(ea >= eb) VAL [\old(cond)=1] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L114] RET __VERIFIER_assert(ea >= eb) VAL [\old(a)=4294967295, \old(b)=16777216, a=4294967295, ea=127, eb=-127, ma=16777216, mb=16777216] [L115] delta = ea - eb VAL [\old(a)=4294967295, \old(b)=16777216, a=4294967295, delta=254, ea=127, ma=16777216, mb=16777216] [L116] CALL __VERIFIER_assert(delta < sizeof(mb) * 8) VAL [\old(cond)=0] [L16] COND TRUE !(cond) VAL [\old(cond)=0] [L17] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.7s, OverallIterations: 23, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2376 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2209 mSDsluCounter, 30721 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27981 mSDsCounter, 316 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9179 IncrementalHoareTripleChecker+Invalid, 9495 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 316 mSolverCounterUnsat, 2740 mSDtfsCounter, 9179 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1457 GetRequests, 1030 SyntacticMatches, 3 SemanticMatches, 424 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2089 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=411occurred in iteration=12, InterpolantAutomatonStates: 342, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 22 MinimizatonAttempts, 1019 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 1700 NumberOfCodeBlocks, 1700 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2030 ConstructedInterpolants, 0 QuantifiedInterpolants, 4207 SizeOfPredicates, 18 NumberOfNonLiveVariables, 1425 ConjunctsInSsa, 243 ConjunctsInUnsatCore, 39 InterpolantComputations, 14 PerfectInterpolantSequences, 692/797 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-11-16 03:01:22,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 03:01:24,640 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 03:01:24,704 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 03:01:24,710 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 03:01:24,710 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 03:01:24,734 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 03:01:24,737 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 03:01:24,737 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 03:01:24,737 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 03:01:24,737 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 03:01:24,738 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 03:01:24,738 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 03:01:24,738 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 03:01:24,738 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 03:01:24,739 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 03:01:24,739 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 03:01:24,739 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 03:01:24,739 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 03:01:24,740 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 03:01:24,740 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 03:01:24,744 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 03:01:24,744 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 03:01:24,745 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 03:01:24,745 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 03:01:24,745 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 03:01:24,746 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 03:01:24,746 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 03:01:24,746 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 03:01:24,746 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 03:01:24,746 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 03:01:24,747 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 03:01:24,747 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 03:01:24,747 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 03:01:24,747 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 03:01:24,747 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 03:01:24,747 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 03:01:24,747 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 03:01:24,748 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 03:01:24,748 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 03:01:24,748 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 03:01:24,749 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 03:01:24,749 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 03:01:24,749 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 03:01:24,749 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 03:01:24,750 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 -> c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a [2024-11-16 03:01:25,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 03:01:25,024 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 03:01:25,026 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 03:01:25,028 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 03:01:25,029 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 03:01:25,030 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2024-11-16 03:01:26,283 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 03:01:26,445 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 03:01:26,445 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2024-11-16 03:01:26,454 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07f64576f/58deae6b65614679a84fe37ac74eb51b/FLAG703349033 [2024-11-16 03:01:26,837 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07f64576f/58deae6b65614679a84fe37ac74eb51b [2024-11-16 03:01:26,839 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 03:01:26,840 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 03:01:26,842 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 03:01:26,842 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 03:01:26,845 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 03:01:26,846 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:01:26" (1/1) ... [2024-11-16 03:01:26,847 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58b48eab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:01:26, skipping insertion in model container [2024-11-16 03:01:26,847 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:01:26" (1/1) ... [2024-11-16 03:01:26,873 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 03:01:27,018 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c[730,743] [2024-11-16 03:01:27,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 03:01:27,092 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 03:01:27,101 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c[730,743] [2024-11-16 03:01:27,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 03:01:27,150 INFO L204 MainTranslator]: Completed translation [2024-11-16 03:01:27,151 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:01:27 WrapperNode [2024-11-16 03:01:27,151 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 03:01:27,152 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 03:01:27,152 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 03:01:27,152 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 03:01:27,158 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:01:27" (1/1) ... [2024-11-16 03:01:27,168 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:01:27" (1/1) ... [2024-11-16 03:01:27,184 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2024-11-16 03:01:27,185 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 03:01:27,186 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 03:01:27,186 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 03:01:27,186 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 03:01:27,194 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:01:27" (1/1) ... [2024-11-16 03:01:27,194 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:01:27" (1/1) ... [2024-11-16 03:01:27,203 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:01:27" (1/1) ... [2024-11-16 03:01:27,213 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 03:01:27,216 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:01:27" (1/1) ... [2024-11-16 03:01:27,216 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:01:27" (1/1) ... [2024-11-16 03:01:27,220 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:01:27" (1/1) ... [2024-11-16 03:01:27,222 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:01:27" (1/1) ... [2024-11-16 03:01:27,226 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:01:27" (1/1) ... [2024-11-16 03:01:27,226 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:01:27" (1/1) ... [2024-11-16 03:01:27,231 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 03:01:27,232 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 03:01:27,232 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 03:01:27,232 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 03:01:27,232 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:01:27" (1/1) ... [2024-11-16 03:01:27,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 03:01:27,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 03:01:27,256 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 03:01:27,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 03:01:27,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 03:01:27,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 03:01:27,290 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-16 03:01:27,290 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-16 03:01:27,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 03:01:27,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 03:01:27,290 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2024-11-16 03:01:27,291 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2024-11-16 03:01:27,291 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-16 03:01:27,291 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-16 03:01:27,373 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 03:01:27,375 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 03:01:27,587 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-11-16 03:01:27,587 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 03:01:27,601 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 03:01:27,601 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 03:01:27,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:01:27 BoogieIcfgContainer [2024-11-16 03:01:27,601 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 03:01:27,603 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 03:01:27,603 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 03:01:27,606 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 03:01:27,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:01:26" (1/3) ... [2024-11-16 03:01:27,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@387b969d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:01:27, skipping insertion in model container [2024-11-16 03:01:27,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:01:27" (2/3) ... [2024-11-16 03:01:27,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@387b969d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:01:27, skipping insertion in model container [2024-11-16 03:01:27,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:01:27" (3/3) ... [2024-11-16 03:01:27,610 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_4-3a.c.cil.c [2024-11-16 03:01:27,624 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 03:01:27,624 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 03:01:27,677 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 03:01:27,696 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;@5573ac85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 03:01:27,696 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 03:01:27,699 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 49 states have internal predecessors, (67), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-16 03:01:27,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-16 03:01:27,708 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:27,709 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:27,710 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:27,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:27,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1703905114, now seen corresponding path program 1 times [2024-11-16 03:01:27,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 03:01:27,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [60733362] [2024-11-16 03:01:27,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:27,731 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 03:01:27,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 03:01:27,736 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 03:01:27,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 03:01:27,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:27,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 03:01:27,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:27,958 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-16 03:01:27,959 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:01:27,959 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 03:01:27,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [60733362] [2024-11-16 03:01:27,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [60733362] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:27,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:27,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 03:01:27,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481311031] [2024-11-16 03:01:27,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:27,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 03:01:27,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 03:01:27,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 03:01:27,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 03:01:27,988 INFO L87 Difference]: Start difference. First operand has 62 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 49 states have internal predecessors, (67), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:28,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:28,101 INFO L93 Difference]: Finished difference Result 140 states and 205 transitions. [2024-11-16 03:01:28,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 03:01:28,103 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2024-11-16 03:01:28,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:28,110 INFO L225 Difference]: With dead ends: 140 [2024-11-16 03:01:28,110 INFO L226 Difference]: Without dead ends: 75 [2024-11-16 03:01:28,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-16 03:01:28,115 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 14 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:28,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 501 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 03:01:28,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-16 03:01:28,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 68. [2024-11-16 03:01:28,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 54 states have internal predecessors, (66), 10 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-16 03:01:28,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 88 transitions. [2024-11-16 03:01:28,149 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 88 transitions. Word has length 32 [2024-11-16 03:01:28,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:28,149 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 88 transitions. [2024-11-16 03:01:28,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:28,149 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 88 transitions. [2024-11-16 03:01:28,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-16 03:01:28,151 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:28,151 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:28,154 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-11-16 03:01:28,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 03:01:28,353 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:28,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:28,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1302829070, now seen corresponding path program 1 times [2024-11-16 03:01:28,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 03:01:28,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [758787605] [2024-11-16 03:01:28,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:28,355 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 03:01:28,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 03:01:28,357 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 03:01:28,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 03:01:28,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:28,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-16 03:01:28,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:28,517 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-16 03:01:28,519 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 03:01:28,583 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-16 03:01:28,584 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 03:01:28,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [758787605] [2024-11-16 03:01:28,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [758787605] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 03:01:28,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 03:01:28,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-11-16 03:01:28,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450589496] [2024-11-16 03:01:28,585 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 03:01:28,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 03:01:28,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 03:01:28,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 03:01:28,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-16 03:01:28,587 INFO L87 Difference]: Start difference. First operand 68 states and 88 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 03:01:28,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:28,689 INFO L93 Difference]: Finished difference Result 123 states and 161 transitions. [2024-11-16 03:01:28,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 03:01:28,690 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2024-11-16 03:01:28,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:28,691 INFO L225 Difference]: With dead ends: 123 [2024-11-16 03:01:28,691 INFO L226 Difference]: Without dead ends: 94 [2024-11-16 03:01:28,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-16 03:01:28,693 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 15 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:28,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 541 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 03:01:28,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-16 03:01:28,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 78. [2024-11-16 03:01:28,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 61 states have internal predecessors, (74), 12 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2024-11-16 03:01:28,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 101 transitions. [2024-11-16 03:01:28,705 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 101 transitions. Word has length 38 [2024-11-16 03:01:28,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:28,706 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 101 transitions. [2024-11-16 03:01:28,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 03:01:28,706 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 101 transitions. [2024-11-16 03:01:28,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-16 03:01:28,708 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:28,708 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:28,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-16 03:01:28,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 03:01:28,912 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:28,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:28,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1363081967, now seen corresponding path program 1 times [2024-11-16 03:01:28,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 03:01:28,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [617302850] [2024-11-16 03:01:28,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:28,913 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 03:01:28,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 03:01:28,914 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 03:01:28,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 03:01:28,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:28,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 03:01:28,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:29,026 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-16 03:01:29,026 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 03:01:29,074 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-16 03:01:29,076 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 03:01:29,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [617302850] [2024-11-16 03:01:29,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [617302850] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 03:01:29,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 03:01:29,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-11-16 03:01:29,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554815966] [2024-11-16 03:01:29,077 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 03:01:29,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 03:01:29,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 03:01:29,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 03:01:29,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 03:01:29,082 INFO L87 Difference]: Start difference. First operand 78 states and 101 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 03:01:29,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:29,155 INFO L93 Difference]: Finished difference Result 118 states and 154 transitions. [2024-11-16 03:01:29,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 03:01:29,156 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2024-11-16 03:01:29,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:29,157 INFO L225 Difference]: With dead ends: 118 [2024-11-16 03:01:29,158 INFO L226 Difference]: Without dead ends: 93 [2024-11-16 03:01:29,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-16 03:01:29,159 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 12 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:29,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 502 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 03:01:29,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-16 03:01:29,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2024-11-16 03:01:29,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 66 states have (on average 1.2272727272727273) internal successors, (81), 68 states have internal predecessors, (81), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2024-11-16 03:01:29,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 112 transitions. [2024-11-16 03:01:29,169 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 112 transitions. Word has length 40 [2024-11-16 03:01:29,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:29,169 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 112 transitions. [2024-11-16 03:01:29,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 03:01:29,170 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 112 transitions. [2024-11-16 03:01:29,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-16 03:01:29,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:29,171 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:29,176 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 (4)] Forceful destruction successful, exit code 0 [2024-11-16 03:01:29,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 03:01:29,372 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:29,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:29,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1659532204, now seen corresponding path program 1 times [2024-11-16 03:01:29,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 03:01:29,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1436601246] [2024-11-16 03:01:29,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:29,374 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 03:01:29,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 03:01:29,376 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 03:01:29,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-16 03:01:29,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:29,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-16 03:01:29,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:29,549 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-16 03:01:29,549 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:01:29,549 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 03:01:29,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1436601246] [2024-11-16 03:01:29,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1436601246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:29,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:29,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 03:01:29,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426714065] [2024-11-16 03:01:29,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:29,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 03:01:29,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 03:01:29,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 03:01:29,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-16 03:01:29,552 INFO L87 Difference]: Start difference. First operand 88 states and 112 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 9 states have internal predecessors, (29), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 03:01:29,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:29,719 INFO L93 Difference]: Finished difference Result 128 states and 168 transitions. [2024-11-16 03:01:29,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 03:01:29,720 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 9 states have internal predecessors, (29), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 45 [2024-11-16 03:01:29,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:29,721 INFO L225 Difference]: With dead ends: 128 [2024-11-16 03:01:29,723 INFO L226 Difference]: Without dead ends: 120 [2024-11-16 03:01:29,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-16 03:01:29,724 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 22 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:29,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 677 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 03:01:29,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-16 03:01:29,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 103. [2024-11-16 03:01:29,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 76 states have (on average 1.2236842105263157) internal successors, (93), 78 states have internal predecessors, (93), 18 states have call successors, (18), 6 states have call predecessors, (18), 8 states have return successors, (24), 18 states have call predecessors, (24), 17 states have call successors, (24) [2024-11-16 03:01:29,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 135 transitions. [2024-11-16 03:01:29,744 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 135 transitions. Word has length 45 [2024-11-16 03:01:29,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:29,744 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 135 transitions. [2024-11-16 03:01:29,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 9 states have internal predecessors, (29), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 03:01:29,744 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 135 transitions. [2024-11-16 03:01:29,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-16 03:01:29,745 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:29,746 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:29,750 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 (5)] Ended with exit code 0 [2024-11-16 03:01:29,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 03:01:29,946 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:29,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:29,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1102722790, now seen corresponding path program 2 times [2024-11-16 03:01:29,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 03:01:29,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [853867033] [2024-11-16 03:01:29,947 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 03:01:29,947 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 03:01:29,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 03:01:29,951 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 03:01:29,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-16 03:01:29,992 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-16 03:01:29,992 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 03:01:29,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-16 03:01:29,996 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:30,143 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 03:01:30,144 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:01:30,144 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 03:01:30,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [853867033] [2024-11-16 03:01:30,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [853867033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:30,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:30,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-16 03:01:30,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907023804] [2024-11-16 03:01:30,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:30,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 03:01:30,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 03:01:30,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 03:01:30,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-16 03:01:30,147 INFO L87 Difference]: Start difference. First operand 103 states and 135 transitions. Second operand has 12 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:30,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:30,346 INFO L93 Difference]: Finished difference Result 206 states and 273 transitions. [2024-11-16 03:01:30,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-16 03:01:30,347 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2024-11-16 03:01:30,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:30,348 INFO L225 Difference]: With dead ends: 206 [2024-11-16 03:01:30,348 INFO L226 Difference]: Without dead ends: 156 [2024-11-16 03:01:30,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2024-11-16 03:01:30,350 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 38 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:30,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 953 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 03:01:30,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-16 03:01:30,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 136. [2024-11-16 03:01:30,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 100 states have (on average 1.22) internal successors, (122), 103 states have internal predecessors, (122), 23 states have call successors, (23), 9 states have call predecessors, (23), 12 states have return successors, (33), 23 states have call predecessors, (33), 22 states have call successors, (33) [2024-11-16 03:01:30,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 178 transitions. [2024-11-16 03:01:30,363 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 178 transitions. Word has length 44 [2024-11-16 03:01:30,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:30,364 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 178 transitions. [2024-11-16 03:01:30,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:30,364 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 178 transitions. [2024-11-16 03:01:30,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-16 03:01:30,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:30,368 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:30,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-16 03:01:30,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 03:01:30,569 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:30,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:30,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1960492089, now seen corresponding path program 1 times [2024-11-16 03:01:30,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 03:01:30,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [599743786] [2024-11-16 03:01:30,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:30,570 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 03:01:30,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 03:01:30,573 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 03:01:30,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-16 03:01:30,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:30,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-16 03:01:30,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:30,688 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-16 03:01:30,688 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:01:30,688 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 03:01:30,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [599743786] [2024-11-16 03:01:30,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [599743786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:30,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:30,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 03:01:30,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683494611] [2024-11-16 03:01:30,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:30,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 03:01:30,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 03:01:30,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 03:01:30,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-16 03:01:30,691 INFO L87 Difference]: Start difference. First operand 136 states and 178 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 03:01:30,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:30,771 INFO L93 Difference]: Finished difference Result 191 states and 245 transitions. [2024-11-16 03:01:30,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 03:01:30,771 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2024-11-16 03:01:30,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:30,773 INFO L225 Difference]: With dead ends: 191 [2024-11-16 03:01:30,773 INFO L226 Difference]: Without dead ends: 157 [2024-11-16 03:01:30,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-16 03:01:30,774 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 14 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:30,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 577 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 03:01:30,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-16 03:01:30,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 143. [2024-11-16 03:01:30,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 107 states have (on average 1.1962616822429906) internal successors, (128), 110 states have internal predecessors, (128), 21 states have call successors, (21), 11 states have call predecessors, (21), 14 states have return successors, (29), 21 states have call predecessors, (29), 20 states have call successors, (29) [2024-11-16 03:01:30,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 178 transitions. [2024-11-16 03:01:30,786 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 178 transitions. Word has length 46 [2024-11-16 03:01:30,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:30,787 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 178 transitions. [2024-11-16 03:01:30,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 03:01:30,787 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 178 transitions. [2024-11-16 03:01:30,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-16 03:01:30,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:30,788 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:30,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-16 03:01:30,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 03:01:30,989 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:30,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:30,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1853957301, now seen corresponding path program 1 times [2024-11-16 03:01:30,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 03:01:30,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [163096956] [2024-11-16 03:01:30,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:30,990 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 03:01:30,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 03:01:30,991 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 03:01:30,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-16 03:01:31,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:31,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-16 03:01:31,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:31,077 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-16 03:01:31,077 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 03:01:31,164 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-16 03:01:31,165 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 03:01:31,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [163096956] [2024-11-16 03:01:31,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [163096956] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 03:01:31,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 03:01:31,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2024-11-16 03:01:31,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953195508] [2024-11-16 03:01:31,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:31,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 03:01:31,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 03:01:31,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 03:01:31,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-16 03:01:31,166 INFO L87 Difference]: Start difference. First operand 143 states and 178 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:31,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:31,222 INFO L93 Difference]: Finished difference Result 150 states and 184 transitions. [2024-11-16 03:01:31,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 03:01:31,222 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2024-11-16 03:01:31,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:31,224 INFO L225 Difference]: With dead ends: 150 [2024-11-16 03:01:31,225 INFO L226 Difference]: Without dead ends: 147 [2024-11-16 03:01:31,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-16 03:01:31,226 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 3 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:31,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 343 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 03:01:31,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-16 03:01:31,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-11-16 03:01:31,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 110 states have (on average 1.190909090909091) internal successors, (131), 113 states have internal predecessors, (131), 21 states have call successors, (21), 12 states have call predecessors, (21), 15 states have return successors, (29), 21 states have call predecessors, (29), 20 states have call successors, (29) [2024-11-16 03:01:31,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 181 transitions. [2024-11-16 03:01:31,237 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 181 transitions. Word has length 45 [2024-11-16 03:01:31,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:31,238 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 181 transitions. [2024-11-16 03:01:31,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-16 03:01:31,238 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 181 transitions. [2024-11-16 03:01:31,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-16 03:01:31,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:31,239 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:31,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 (8)] Ended with exit code 0 [2024-11-16 03:01:31,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 03:01:31,441 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:31,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:31,442 INFO L85 PathProgramCache]: Analyzing trace with hash 936843217, now seen corresponding path program 1 times [2024-11-16 03:01:31,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 03:01:31,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [723601148] [2024-11-16 03:01:31,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:31,443 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 03:01:31,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 03:01:31,445 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 03:01:31,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-16 03:01:31,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:31,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-16 03:01:31,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:31,567 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-16 03:01:31,567 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 03:01:31,665 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-16 03:01:31,666 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 03:01:31,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [723601148] [2024-11-16 03:01:31,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [723601148] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 03:01:31,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 03:01:31,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2024-11-16 03:01:31,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405426292] [2024-11-16 03:01:31,666 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 03:01:31,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-16 03:01:31,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 03:01:31,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-16 03:01:31,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-11-16 03:01:31,667 INFO L87 Difference]: Start difference. First operand 147 states and 181 transitions. Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-16 03:01:31,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:31,841 INFO L93 Difference]: Finished difference Result 203 states and 256 transitions. [2024-11-16 03:01:31,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 03:01:31,842 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 47 [2024-11-16 03:01:31,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:31,843 INFO L225 Difference]: With dead ends: 203 [2024-11-16 03:01:31,843 INFO L226 Difference]: Without dead ends: 194 [2024-11-16 03:01:31,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-11-16 03:01:31,844 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 22 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:31,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 799 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 03:01:31,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-16 03:01:31,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 158. [2024-11-16 03:01:31,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 119 states have (on average 1.184873949579832) internal successors, (141), 121 states have internal predecessors, (141), 22 states have call successors, (22), 12 states have call predecessors, (22), 16 states have return successors, (31), 24 states have call predecessors, (31), 21 states have call successors, (31) [2024-11-16 03:01:31,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 194 transitions. [2024-11-16 03:01:31,857 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 194 transitions. Word has length 47 [2024-11-16 03:01:31,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:31,857 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 194 transitions. [2024-11-16 03:01:31,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-16 03:01:31,857 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 194 transitions. [2024-11-16 03:01:31,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-16 03:01:31,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:31,858 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:31,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-16 03:01:32,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 03:01:32,059 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:32,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:32,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1824346898, now seen corresponding path program 1 times [2024-11-16 03:01:32,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 03:01:32,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [705211757] [2024-11-16 03:01:32,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:32,060 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 03:01:32,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 03:01:32,061 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 03:01:32,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-16 03:01:32,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:32,093 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 03:01:32,095 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:32,119 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-16 03:01:32,119 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:01:32,119 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 03:01:32,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [705211757] [2024-11-16 03:01:32,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [705211757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:32,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:32,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 03:01:32,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194138350] [2024-11-16 03:01:32,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:32,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 03:01:32,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 03:01:32,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 03:01:32,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 03:01:32,120 INFO L87 Difference]: Start difference. First operand 158 states and 194 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-16 03:01:32,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:32,151 INFO L93 Difference]: Finished difference Result 167 states and 202 transitions. [2024-11-16 03:01:32,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 03:01:32,151 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 47 [2024-11-16 03:01:32,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:32,152 INFO L225 Difference]: With dead ends: 167 [2024-11-16 03:01:32,152 INFO L226 Difference]: Without dead ends: 145 [2024-11-16 03:01:32,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-16 03:01:32,153 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 3 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:32,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 351 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 03:01:32,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-16 03:01:32,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-11-16 03:01:32,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 109 states have (on average 1.18348623853211) internal successors, (129), 112 states have internal predecessors, (129), 20 states have call successors, (20), 11 states have call predecessors, (20), 15 states have return successors, (28), 21 states have call predecessors, (28), 19 states have call successors, (28) [2024-11-16 03:01:32,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 177 transitions. [2024-11-16 03:01:32,168 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 177 transitions. Word has length 47 [2024-11-16 03:01:32,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:32,169 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 177 transitions. [2024-11-16 03:01:32,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-16 03:01:32,169 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 177 transitions. [2024-11-16 03:01:32,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-16 03:01:32,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:32,170 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:32,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-16 03:01:32,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 03:01:32,370 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:32,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:32,371 INFO L85 PathProgramCache]: Analyzing trace with hash 568811576, now seen corresponding path program 1 times [2024-11-16 03:01:32,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 03:01:32,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1430987483] [2024-11-16 03:01:32,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:32,371 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 03:01:32,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 03:01:32,387 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 03:01:32,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-16 03:01:32,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:32,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-16 03:01:32,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:32,521 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-16 03:01:32,522 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:01:32,522 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 03:01:32,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1430987483] [2024-11-16 03:01:32,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1430987483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:32,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:32,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 03:01:32,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239018120] [2024-11-16 03:01:32,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:32,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 03:01:32,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 03:01:32,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 03:01:32,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-16 03:01:32,524 INFO L87 Difference]: Start difference. First operand 145 states and 177 transitions. Second operand has 10 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-16 03:01:32,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:32,628 INFO L93 Difference]: Finished difference Result 251 states and 322 transitions. [2024-11-16 03:01:32,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 03:01:32,628 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 50 [2024-11-16 03:01:32,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:32,630 INFO L225 Difference]: With dead ends: 251 [2024-11-16 03:01:32,630 INFO L226 Difference]: Without dead ends: 201 [2024-11-16 03:01:32,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-16 03:01:32,631 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 28 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:32,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 771 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 03:01:32,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-16 03:01:32,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 181. [2024-11-16 03:01:32,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 134 states have (on average 1.1940298507462686) internal successors, (160), 137 states have internal predecessors, (160), 29 states have call successors, (29), 13 states have call predecessors, (29), 17 states have return successors, (39), 30 states have call predecessors, (39), 28 states have call successors, (39) [2024-11-16 03:01:32,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 228 transitions. [2024-11-16 03:01:32,651 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 228 transitions. Word has length 50 [2024-11-16 03:01:32,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:32,651 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 228 transitions. [2024-11-16 03:01:32,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 4 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-16 03:01:32,652 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 228 transitions. [2024-11-16 03:01:32,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-16 03:01:32,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:32,652 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:32,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-16 03:01:32,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 03:01:32,853 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:32,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:32,854 INFO L85 PathProgramCache]: Analyzing trace with hash 275408569, now seen corresponding path program 1 times [2024-11-16 03:01:32,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 03:01:32,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1624746820] [2024-11-16 03:01:32,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:32,854 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 03:01:32,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 03:01:32,857 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 03:01:32,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-16 03:01:32,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:32,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-16 03:01:32,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:33,046 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 03:01:33,046 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 03:01:33,046 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 03:01:33,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1624746820] [2024-11-16 03:01:33,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1624746820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 03:01:33,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 03:01:33,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-16 03:01:33,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877921140] [2024-11-16 03:01:33,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 03:01:33,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-16 03:01:33,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 03:01:33,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-16 03:01:33,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2024-11-16 03:01:33,048 INFO L87 Difference]: Start difference. First operand 181 states and 228 transitions. Second operand has 14 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-16 03:01:33,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:33,246 INFO L93 Difference]: Finished difference Result 216 states and 267 transitions. [2024-11-16 03:01:33,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-16 03:01:33,247 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 50 [2024-11-16 03:01:33,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:33,248 INFO L225 Difference]: With dead ends: 216 [2024-11-16 03:01:33,248 INFO L226 Difference]: Without dead ends: 213 [2024-11-16 03:01:33,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2024-11-16 03:01:33,249 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 30 mSDsluCounter, 1112 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:33,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1211 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 03:01:33,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-16 03:01:33,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 193. [2024-11-16 03:01:33,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 143 states have (on average 1.1818181818181819) internal successors, (169), 146 states have internal predecessors, (169), 29 states have call successors, (29), 16 states have call predecessors, (29), 20 states have return successors, (39), 30 states have call predecessors, (39), 28 states have call successors, (39) [2024-11-16 03:01:33,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 237 transitions. [2024-11-16 03:01:33,264 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 237 transitions. Word has length 50 [2024-11-16 03:01:33,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:33,265 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 237 transitions. [2024-11-16 03:01:33,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-16 03:01:33,265 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 237 transitions. [2024-11-16 03:01:33,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-16 03:01:33,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:33,267 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:33,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-16 03:01:33,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 03:01:33,469 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:33,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:33,470 INFO L85 PathProgramCache]: Analyzing trace with hash -786374771, now seen corresponding path program 1 times [2024-11-16 03:01:33,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 03:01:33,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [610895059] [2024-11-16 03:01:33,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:33,470 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 03:01:33,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 03:01:33,471 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 03:01:33,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-16 03:01:33,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 03:01:33,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-16 03:01:33,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:33,698 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-16 03:01:33,698 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 03:01:34,030 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-16 03:01:34,030 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 03:01:34,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [610895059] [2024-11-16 03:01:34,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [610895059] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 03:01:34,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 03:01:34,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 28 [2024-11-16 03:01:34,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100371069] [2024-11-16 03:01:34,031 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 03:01:34,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-16 03:01:34,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 03:01:34,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-16 03:01:34,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=684, Unknown=0, NotChecked=0, Total=756 [2024-11-16 03:01:34,032 INFO L87 Difference]: Start difference. First operand 193 states and 237 transitions. Second operand has 28 states, 25 states have (on average 2.0) internal successors, (50), 23 states have internal predecessors, (50), 5 states have call successors, (8), 2 states have call predecessors, (8), 6 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-16 03:01:35,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:35,382 INFO L93 Difference]: Finished difference Result 325 states and 432 transitions. [2024-11-16 03:01:35,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-11-16 03:01:35,383 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 2.0) internal successors, (50), 23 states have internal predecessors, (50), 5 states have call successors, (8), 2 states have call predecessors, (8), 6 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) Word has length 51 [2024-11-16 03:01:35,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:35,385 INFO L225 Difference]: With dead ends: 325 [2024-11-16 03:01:35,386 INFO L226 Difference]: Without dead ends: 291 [2024-11-16 03:01:35,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=264, Invalid=2598, Unknown=0, NotChecked=0, Total=2862 [2024-11-16 03:01:35,388 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 105 mSDsluCounter, 1872 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1983 SdHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:35,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1983 Invalid, 1001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 952 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 03:01:35,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-16 03:01:35,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 204. [2024-11-16 03:01:35,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 148 states have (on average 1.1824324324324325) internal successors, (175), 156 states have internal predecessors, (175), 32 states have call successors, (32), 15 states have call predecessors, (32), 23 states have return successors, (50), 32 states have call predecessors, (50), 31 states have call successors, (50) [2024-11-16 03:01:35,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 257 transitions. [2024-11-16 03:01:35,415 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 257 transitions. Word has length 51 [2024-11-16 03:01:35,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:35,416 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 257 transitions. [2024-11-16 03:01:35,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 2.0) internal successors, (50), 23 states have internal predecessors, (50), 5 states have call successors, (8), 2 states have call predecessors, (8), 6 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-16 03:01:35,416 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 257 transitions. [2024-11-16 03:01:35,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-16 03:01:35,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:35,417 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:35,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-16 03:01:35,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 03:01:35,620 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:35,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:35,621 INFO L85 PathProgramCache]: Analyzing trace with hash -389978851, now seen corresponding path program 2 times [2024-11-16 03:01:35,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 03:01:35,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1597024621] [2024-11-16 03:01:35,621 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 03:01:35,621 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 03:01:35,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 03:01:35,626 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 03:01:35,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-16 03:01:35,661 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 03:01:35,661 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 03:01:35,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-16 03:01:35,667 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 03:01:35,824 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-16 03:01:35,824 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 03:01:36,078 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-16 03:01:36,078 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 03:01:36,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1597024621] [2024-11-16 03:01:36,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1597024621] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 03:01:36,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 03:01:36,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 28 [2024-11-16 03:01:36,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103545969] [2024-11-16 03:01:36,078 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 03:01:36,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-16 03:01:36,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 03:01:36,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-16 03:01:36,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=684, Unknown=0, NotChecked=0, Total=756 [2024-11-16 03:01:36,080 INFO L87 Difference]: Start difference. First operand 204 states and 257 transitions. Second operand has 28 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 23 states have internal predecessors, (51), 5 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-16 03:01:37,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 03:01:37,282 INFO L93 Difference]: Finished difference Result 318 states and 431 transitions. [2024-11-16 03:01:37,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-16 03:01:37,282 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 23 states have internal predecessors, (51), 5 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) Word has length 51 [2024-11-16 03:01:37,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 03:01:37,284 INFO L225 Difference]: With dead ends: 318 [2024-11-16 03:01:37,284 INFO L226 Difference]: Without dead ends: 304 [2024-11-16 03:01:37,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=239, Invalid=2413, Unknown=0, NotChecked=0, Total=2652 [2024-11-16 03:01:37,285 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 96 mSDsluCounter, 2193 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 2305 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 03:01:37,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 2305 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 03:01:37,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-11-16 03:01:37,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 217. [2024-11-16 03:01:37,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 156 states have (on average 1.1730769230769231) internal successors, (183), 164 states have internal predecessors, (183), 36 states have call successors, (36), 16 states have call predecessors, (36), 24 states have return successors, (63), 36 states have call predecessors, (63), 35 states have call successors, (63) [2024-11-16 03:01:37,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 282 transitions. [2024-11-16 03:01:37,301 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 282 transitions. Word has length 51 [2024-11-16 03:01:37,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 03:01:37,301 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 282 transitions. [2024-11-16 03:01:37,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 23 states have internal predecessors, (51), 5 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-16 03:01:37,302 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 282 transitions. [2024-11-16 03:01:37,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-16 03:01:37,302 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 03:01:37,303 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:37,306 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 (14)] Forceful destruction successful, exit code 0 [2024-11-16 03:01:37,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 03:01:37,503 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 03:01:37,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 03:01:37,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1352098780, now seen corresponding path program 1 times [2024-11-16 03:01:37,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 03:01:37,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1801580231] [2024-11-16 03:01:37,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 03:01:37,504 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 03:01:37,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 03:01:37,506 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 03:01:37,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-16 03:01:37,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 03:01:37,538 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 03:01:37,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 03:01:37,582 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-16 03:01:37,583 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 03:01:37,583 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 03:01:37,588 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 (15)] Forceful destruction successful, exit code 0 [2024-11-16 03:01:37,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 03:01:37,788 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 03:01:37,808 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 03:01:37,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 03:01:37 BoogieIcfgContainer [2024-11-16 03:01:37,812 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 03:01:37,813 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 03:01:37,813 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 03:01:37,813 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 03:01:37,813 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:01:27" (3/4) ... [2024-11-16 03:01:37,814 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 03:01:37,862 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 03:01:37,863 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 03:01:37,863 INFO L158 Benchmark]: Toolchain (without parser) took 11022.91ms. Allocated memory was 81.8MB in the beginning and 119.5MB in the end (delta: 37.7MB). Free memory was 49.1MB in the beginning and 57.1MB in the end (delta: -8.0MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. [2024-11-16 03:01:37,863 INFO L158 Benchmark]: CDTParser took 0.70ms. Allocated memory is still 56.6MB. Free memory was 35.0MB in the beginning and 34.9MB in the end (delta: 64.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 03:01:37,863 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.89ms. Allocated memory is still 81.8MB. Free memory was 48.9MB in the beginning and 57.6MB in the end (delta: -8.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 03:01:37,863 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.12ms. Allocated memory is still 81.8MB. Free memory was 57.6MB in the beginning and 56.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 03:01:37,864 INFO L158 Benchmark]: Boogie Preprocessor took 45.52ms. Allocated memory is still 81.8MB. Free memory was 55.9MB in the beginning and 54.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 03:01:37,864 INFO L158 Benchmark]: IcfgBuilder took 369.93ms. Allocated memory is still 81.8MB. Free memory was 54.2MB in the beginning and 37.8MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 03:01:37,864 INFO L158 Benchmark]: TraceAbstraction took 10209.47ms. Allocated memory was 81.8MB in the beginning and 119.5MB in the end (delta: 37.7MB). Free memory was 37.0MB in the beginning and 60.3MB in the end (delta: -23.3MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2024-11-16 03:01:37,864 INFO L158 Benchmark]: Witness Printer took 49.96ms. Allocated memory is still 119.5MB. Free memory was 60.3MB in the beginning and 57.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 03:01:37,865 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.70ms. Allocated memory is still 56.6MB. Free memory was 35.0MB in the beginning and 34.9MB in the end (delta: 64.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 309.89ms. Allocated memory is still 81.8MB. Free memory was 48.9MB in the beginning and 57.6MB in the end (delta: -8.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.12ms. Allocated memory is still 81.8MB. Free memory was 57.6MB in the beginning and 56.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.52ms. Allocated memory is still 81.8MB. Free memory was 55.9MB in the beginning and 54.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 369.93ms. Allocated memory is still 81.8MB. Free memory was 54.2MB in the beginning and 37.8MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10209.47ms. Allocated memory was 81.8MB in the beginning and 119.5MB in the end (delta: 37.7MB). Free memory was 37.0MB in the beginning and 60.3MB in the end (delta: -23.3MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. * Witness Printer took 49.96ms. Allocated memory is still 119.5MB. Free memory was 60.3MB in the beginning and 57.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. 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 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_add1 ; [L233] unsigned int r_add2 ; [L234] unsigned int zero ; [L235] int tmp ; [L236] int tmp___0 ; [L237] int __retres14 ; [L241] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, e=0] [L241] RET, EXPR base2flt(0, 0) [L241] zero = base2flt(0, 0) [L242] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=0, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L57] COND TRUE 1 VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L76] m = m & ~ (1U << 24U) [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=0, \old(m)=16777216, __retres4=-2147483648] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=16777216, \result=-2147483648] [L242] RET, EXPR base2flt(ma, ea) VAL [ea=0, ma=16777216] [L242] a = base2flt(ma, ea) [L243] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=64, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L57] COND TRUE 1 VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L76] m = m & ~ (1U << 24U) [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=64, \old(m)=16777216, __retres4=-1073741824] [L80] return (__retres4); VAL [\old(e)=64, \old(m)=16777216, \result=-1073741824] [L243] RET, EXPR base2flt(mb, eb) VAL [a=-2147483648, ea=0, eb=64, ma=16777216, mb=16777216] [L243] b = base2flt(mb, eb) [L244] CALL addflt(a, b) VAL [\old(a)=-2147483648, \old(b)=-1073741824] [L84] unsigned int res ; [L85] unsigned int ma ; [L86] unsigned int mb ; [L87] unsigned int delta ; [L88] int ea ; [L89] int eb ; [L90] unsigned int tmp ; [L91] unsigned int __retres10 ; VAL [\old(a)=-2147483648, \old(b)=-1073741824, a=-2147483648, b=-1073741824] [L94] COND TRUE a < b [L95] tmp = a [L96] a = b [L97] b = tmp VAL [\old(a)=-2147483648, \old(b)=-1073741824, a=-1073741824, b=-2147483648] [L101] COND FALSE !(! b) [L108] ma = a & ((1U << 24U) - 1U) [L109] ea = (int )(a >> 24U) - 128 [L110] ma = ma | (1U << 24U) [L111] mb = b & ((1U << 24U) - 1U) [L112] eb = (int )(b >> 24U) - 128 [L113] mb = mb | (1U << 24U) VAL [\old(a)=-2147483648, \old(b)=-1073741824, a=-1073741824, ea=64, eb=0, ma=16777216, mb=16777216] [L114] CALL __VERIFIER_assert(ea >= eb) VAL [\old(cond)=1] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L114] RET __VERIFIER_assert(ea >= eb) VAL [\old(a)=-2147483648, \old(b)=-1073741824, a=-1073741824, ea=64, eb=0, ma=16777216, mb=16777216] [L115] delta = ea - eb VAL [\old(a)=-2147483648, \old(b)=-1073741824, a=-1073741824, delta=64, ea=64, ma=16777216, mb=16777216] [L116] CALL __VERIFIER_assert(delta < sizeof(mb) * 8) VAL [\old(cond)=0] [L16] COND TRUE !(cond) VAL [\old(cond)=0] [L17] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 62 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.1s, OverallIterations: 14, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 488 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 402 mSDsluCounter, 11514 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10422 mSDsCounter, 131 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3162 IncrementalHoareTripleChecker+Invalid, 3293 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 131 mSolverCounterUnsat, 1092 mSDtfsCounter, 3162 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 915 GetRequests, 698 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 897 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217occurred in iteration=13, InterpolantAutomatonStates: 185, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 329 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 638 NumberOfCodeBlocks, 618 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 839 ConstructedInterpolants, 1 QuantifiedInterpolants, 1601 SizeOfPredicates, 23 NumberOfNonLiveVariables, 1081 ConjunctsInSsa, 153 ConjunctsInUnsatCore, 19 InterpolantComputations, 8 PerfectInterpolantSequences, 320/374 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 proved your program to be incorrect! [2024-11-16 03:01:37,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE