./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-31.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-31.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 06db6f319d52eb323239c55a3f8926e2d1f65f125a385def75e49857a30f4ad4 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:39:54,491 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:39:54,555 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 07:39:54,558 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:39:54,558 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:39:54,592 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:39:54,593 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:39:54,593 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:39:54,593 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:39:54,596 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:39:54,596 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:39:54,596 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:39:54,597 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:39:54,597 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:39:54,598 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:39:54,598 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:39:54,598 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:39:54,598 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:39:54,598 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 07:39:54,599 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:39:54,599 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:39:54,599 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:39:54,599 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:39:54,599 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:39:54,600 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:39:54,600 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:39:54,600 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:39:54,600 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:39:54,600 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:39:54,600 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:39:54,601 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:39:54,601 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:39:54,601 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:39:54,601 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:39:54,602 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:39:54,602 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:39:54,602 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 07:39:54,603 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 07:39:54,603 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:39:54,603 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:39:54,603 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:39:54,603 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:39:54,603 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 -> 06db6f319d52eb323239c55a3f8926e2d1f65f125a385def75e49857a30f4ad4 [2024-11-12 07:39:54,791 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:39:54,809 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:39:54,811 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:39:54,812 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:39:54,812 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:39:54,813 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-31.i [2024-11-12 07:39:55,997 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:39:56,191 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:39:56,192 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-31.i [2024-11-12 07:39:56,201 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8da3640d7/5bccecc93f2445b69c3286c896946a27/FLAGf65f0cb12 [2024-11-12 07:39:56,215 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8da3640d7/5bccecc93f2445b69c3286c896946a27 [2024-11-12 07:39:56,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:39:56,219 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:39:56,220 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:39:56,221 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:39:56,235 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:39:56,235 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:39:56" (1/1) ... [2024-11-12 07:39:56,236 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@228971db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:56, skipping insertion in model container [2024-11-12 07:39:56,236 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:39:56" (1/1) ... [2024-11-12 07:39:56,259 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:39:56,407 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/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-31.i[916,929] [2024-11-12 07:39:56,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:39:56,460 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:39:56,470 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/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-31.i[916,929] [2024-11-12 07:39:56,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:39:56,516 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:39:56,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:56 WrapperNode [2024-11-12 07:39:56,517 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:39:56,518 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:39:56,518 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:39:56,518 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:39:56,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:56" (1/1) ... [2024-11-12 07:39:56,537 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:56" (1/1) ... [2024-11-12 07:39:56,572 INFO L138 Inliner]: procedures = 30, calls = 133, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 411 [2024-11-12 07:39:56,573 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:39:56,574 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:39:56,574 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:39:56,574 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:39:56,583 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:56" (1/1) ... [2024-11-12 07:39:56,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:56" (1/1) ... [2024-11-12 07:39:56,587 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:56" (1/1) ... [2024-11-12 07:39:56,592 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-12 07:39:56,593 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:56" (1/1) ... [2024-11-12 07:39:56,593 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:56" (1/1) ... [2024-11-12 07:39:56,609 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:56" (1/1) ... [2024-11-12 07:39:56,613 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:56" (1/1) ... [2024-11-12 07:39:56,619 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:56" (1/1) ... [2024-11-12 07:39:56,620 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:56" (1/1) ... [2024-11-12 07:39:56,627 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:39:56,630 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:39:56,630 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:39:56,630 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:39:56,631 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:56" (1/1) ... [2024-11-12 07:39:56,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:39:56,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:39:56,667 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-12 07:39:56,669 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-12 07:39:56,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:39:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-12 07:39:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-12 07:39:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-12 07:39:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-12 07:39:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-12 07:39:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-12 07:39:56,712 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:39:56,712 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:39:56,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-12 07:39:56,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:39:56,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:39:56,820 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:39:56,823 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:39:57,249 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2024-11-12 07:39:57,249 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:39:57,262 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:39:57,262 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:39:57,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:39:57 BoogieIcfgContainer [2024-11-12 07:39:57,263 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:39:57,265 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:39:57,265 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:39:57,267 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:39:57,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:39:56" (1/3) ... [2024-11-12 07:39:57,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d2127cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:39:57, skipping insertion in model container [2024-11-12 07:39:57,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:39:56" (2/3) ... [2024-11-12 07:39:57,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d2127cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:39:57, skipping insertion in model container [2024-11-12 07:39:57,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:39:57" (3/3) ... [2024-11-12 07:39:57,273 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-31.i [2024-11-12 07:39:57,287 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:39:57,287 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:39:57,340 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:39:57,351 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;@c9cf9f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:39:57,351 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:39:57,358 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 73 states have (on average 1.452054794520548) internal successors, (106), 74 states have internal predecessors, (106), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-12 07:39:57,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-12 07:39:57,367 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:57,368 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:39:57,369 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:57,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:57,374 INFO L85 PathProgramCache]: Analyzing trace with hash -686948204, now seen corresponding path program 1 times [2024-11-12 07:39:57,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:39:57,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108299779] [2024-11-12 07:39:57,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:57,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:39:57,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:57,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:39:57,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:57,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:39:57,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:57,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:39:57,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:57,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:39:57,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:57,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:39:57,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:57,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:39:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:57,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:39:57,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:57,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:39:57,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:57,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:39:57,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:57,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:39:57,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:57,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:39:57,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:57,746 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 07:39:57,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:39:57,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108299779] [2024-11-12 07:39:57,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108299779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:57,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:57,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:39:57,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339436612] [2024-11-12 07:39:57,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:57,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:39:57,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:39:57,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:39:57,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:39:57,772 INFO L87 Difference]: Start difference. First operand has 87 states, 73 states have (on average 1.452054794520548) internal successors, (106), 74 states have internal predecessors, (106), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-12 07:39:57,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:57,791 INFO L93 Difference]: Finished difference Result 167 states and 261 transitions. [2024-11-12 07:39:57,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:39:57,793 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 94 [2024-11-12 07:39:57,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:57,799 INFO L225 Difference]: With dead ends: 167 [2024-11-12 07:39:57,799 INFO L226 Difference]: Without dead ends: 83 [2024-11-12 07:39:57,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:39:57,804 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:57,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:39:57,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-12 07:39:57,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-12 07:39:57,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 70 states have (on average 1.4142857142857144) internal successors, (99), 70 states have internal predecessors, (99), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-12 07:39:57,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 121 transitions. [2024-11-12 07:39:57,835 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 121 transitions. Word has length 94 [2024-11-12 07:39:57,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:57,835 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 121 transitions. [2024-11-12 07:39:57,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-12 07:39:57,835 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 121 transitions. [2024-11-12 07:39:57,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-12 07:39:57,838 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:57,838 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:39:57,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 07:39:57,838 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:57,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:57,839 INFO L85 PathProgramCache]: Analyzing trace with hash 862036710, now seen corresponding path program 1 times [2024-11-12 07:39:57,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:39:57,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192516303] [2024-11-12 07:39:57,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:57,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:39:57,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:58,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:39:58,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:58,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:39:58,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:58,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:39:58,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:58,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:39:58,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:58,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:39:58,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:58,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:39:58,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:58,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:39:58,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:58,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:39:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:58,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:39:58,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:58,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:39:58,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:58,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:39:58,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:58,211 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 07:39:58,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:39:58,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192516303] [2024-11-12 07:39:58,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192516303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:58,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:58,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:39:58,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791060411] [2024-11-12 07:39:58,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:58,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:39:58,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:39:58,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:39:58,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:39:58,217 INFO L87 Difference]: Start difference. First operand 83 states and 121 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:39:58,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:39:58,237 INFO L93 Difference]: Finished difference Result 163 states and 239 transitions. [2024-11-12 07:39:58,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:39:58,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2024-11-12 07:39:58,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:39:58,239 INFO L225 Difference]: With dead ends: 163 [2024-11-12 07:39:58,239 INFO L226 Difference]: Without dead ends: 83 [2024-11-12 07:39:58,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:39:58,241 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:39:58,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 235 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:39:58,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-12 07:39:58,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-12 07:39:58,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 70 states have (on average 1.4) internal successors, (98), 70 states have internal predecessors, (98), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-12 07:39:58,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 120 transitions. [2024-11-12 07:39:58,251 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 120 transitions. Word has length 94 [2024-11-12 07:39:58,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:39:58,252 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 120 transitions. [2024-11-12 07:39:58,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:39:58,252 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 120 transitions. [2024-11-12 07:39:58,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-12 07:39:58,253 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:39:58,253 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:39:58,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 07:39:58,254 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:39:58,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:39:58,254 INFO L85 PathProgramCache]: Analyzing trace with hash -726311192, now seen corresponding path program 1 times [2024-11-12 07:39:58,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:39:58,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366974848] [2024-11-12 07:39:58,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:39:58,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:39:58,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:59,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:39:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:59,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:39:59,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:59,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:39:59,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:59,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:39:59,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:59,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:39:59,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:59,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:39:59,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:59,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:39:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:59,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:39:59,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:59,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:39:59,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:59,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:39:59,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:59,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:39:59,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:39:59,883 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 07:39:59,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:39:59,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366974848] [2024-11-12 07:39:59,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366974848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:39:59,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:39:59,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:39:59,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791697648] [2024-11-12 07:39:59,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:39:59,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:39:59,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:39:59,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:39:59,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:39:59,885 INFO L87 Difference]: Start difference. First operand 83 states and 120 transitions. Second operand has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-12 07:40:00,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:40:00,157 INFO L93 Difference]: Finished difference Result 207 states and 297 transitions. [2024-11-12 07:40:00,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:40:00,158 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 94 [2024-11-12 07:40:00,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:40:00,159 INFO L225 Difference]: With dead ends: 207 [2024-11-12 07:40:00,159 INFO L226 Difference]: Without dead ends: 127 [2024-11-12 07:40:00,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:40:00,163 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 56 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:40:00,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 438 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:40:00,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-12 07:40:00,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2024-11-12 07:40:00,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 108 states have (on average 1.3981481481481481) internal successors, (151), 109 states have internal predecessors, (151), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 07:40:00,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 177 transitions. [2024-11-12 07:40:00,186 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 177 transitions. Word has length 94 [2024-11-12 07:40:00,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:40:00,186 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 177 transitions. [2024-11-12 07:40:00,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-12 07:40:00,186 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 177 transitions. [2024-11-12 07:40:00,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-12 07:40:00,188 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:00,188 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:40:00,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 07:40:00,188 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:00,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:00,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1593160989, now seen corresponding path program 1 times [2024-11-12 07:40:00,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:40:00,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282894639] [2024-11-12 07:40:00,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:00,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:40:00,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:00,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:40:00,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:00,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:40:00,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:00,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:40:00,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:00,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:40:00,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:00,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:40:00,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:00,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:40:00,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:00,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:40:00,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:00,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:40:00,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:00,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:40:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:00,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:40:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:00,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:40:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:00,339 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 07:40:00,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:40:00,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282894639] [2024-11-12 07:40:00,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282894639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:40:00,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:40:00,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:40:00,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087124829] [2024-11-12 07:40:00,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:40:00,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:40:00,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:40:00,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:40:00,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:40:00,341 INFO L87 Difference]: Start difference. First operand 124 states and 177 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:40:00,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:40:00,351 INFO L93 Difference]: Finished difference Result 245 states and 351 transitions. [2024-11-12 07:40:00,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:40:00,352 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 96 [2024-11-12 07:40:00,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:40:00,354 INFO L225 Difference]: With dead ends: 245 [2024-11-12 07:40:00,354 INFO L226 Difference]: Without dead ends: 124 [2024-11-12 07:40:00,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 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-12 07:40:00,355 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:40:00,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 232 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:40:00,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-12 07:40:00,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-12 07:40:00,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 108 states have (on average 1.3796296296296295) internal successors, (149), 109 states have internal predecessors, (149), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 07:40:00,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 175 transitions. [2024-11-12 07:40:00,368 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 175 transitions. Word has length 96 [2024-11-12 07:40:00,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:40:00,369 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 175 transitions. [2024-11-12 07:40:00,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:40:00,369 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 175 transitions. [2024-11-12 07:40:00,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-12 07:40:00,370 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:00,373 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:40:00,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 07:40:00,373 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:00,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:00,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1986187999, now seen corresponding path program 1 times [2024-11-12 07:40:00,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:40:00,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618062386] [2024-11-12 07:40:00,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:00,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:40:00,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:01,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:40:01,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:01,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:40:01,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:01,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:40:01,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:01,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:40:01,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:01,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:40:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:01,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:40:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:01,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:40:01,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:01,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:40:01,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:01,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:40:01,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:01,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:40:01,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:01,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:40:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:01,375 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 07:40:01,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:40:01,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618062386] [2024-11-12 07:40:01,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618062386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:40:01,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:40:01,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 07:40:01,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400996013] [2024-11-12 07:40:01,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:40:01,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 07:40:01,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:40:01,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 07:40:01,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:40:01,377 INFO L87 Difference]: Start difference. First operand 124 states and 175 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-12 07:40:01,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:40:01,705 INFO L93 Difference]: Finished difference Result 259 states and 364 transitions. [2024-11-12 07:40:01,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 07:40:01,706 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 96 [2024-11-12 07:40:01,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:40:01,708 INFO L225 Difference]: With dead ends: 259 [2024-11-12 07:40:01,708 INFO L226 Difference]: Without dead ends: 138 [2024-11-12 07:40:01,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-12 07:40:01,712 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 60 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:40:01,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 511 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 07:40:01,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-12 07:40:01,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 98. [2024-11-12 07:40:01,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 82 states have (on average 1.3414634146341464) internal successors, (110), 83 states have internal predecessors, (110), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 07:40:01,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 136 transitions. [2024-11-12 07:40:01,720 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 136 transitions. Word has length 96 [2024-11-12 07:40:01,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:40:01,720 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 136 transitions. [2024-11-12 07:40:01,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-12 07:40:01,721 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 136 transitions. [2024-11-12 07:40:01,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-12 07:40:01,722 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:01,722 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:40:01,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 07:40:01,722 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:01,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:01,722 INFO L85 PathProgramCache]: Analyzing trace with hash 798189168, now seen corresponding path program 1 times [2024-11-12 07:40:01,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:40:01,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900569369] [2024-11-12 07:40:01,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:01,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:40:01,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:02,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:40:02,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:02,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:40:02,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:02,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:40:02,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:02,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:40:02,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:02,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:40:02,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:02,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:40:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:02,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:40:02,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:02,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:40:02,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:02,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:40:02,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:02,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:40:02,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:02,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:40:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:02,254 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 07:40:02,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:40:02,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900569369] [2024-11-12 07:40:02,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900569369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:40:02,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:40:02,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:40:02,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515455724] [2024-11-12 07:40:02,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:40:02,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:40:02,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:40:02,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:40:02,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:40:02,259 INFO L87 Difference]: Start difference. First operand 98 states and 136 transitions. Second operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-12 07:40:02,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:40:02,430 INFO L93 Difference]: Finished difference Result 222 states and 308 transitions. [2024-11-12 07:40:02,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:40:02,431 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 96 [2024-11-12 07:40:02,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:40:02,432 INFO L225 Difference]: With dead ends: 222 [2024-11-12 07:40:02,432 INFO L226 Difference]: Without dead ends: 132 [2024-11-12 07:40:02,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:40:02,433 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 98 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:40:02,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 417 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:40:02,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-12 07:40:02,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 98. [2024-11-12 07:40:02,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 82 states have (on average 1.329268292682927) internal successors, (109), 83 states have internal predecessors, (109), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 07:40:02,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 135 transitions. [2024-11-12 07:40:02,442 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 135 transitions. Word has length 96 [2024-11-12 07:40:02,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:40:02,443 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 135 transitions. [2024-11-12 07:40:02,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-12 07:40:02,443 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 135 transitions. [2024-11-12 07:40:02,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-12 07:40:02,448 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:02,448 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:40:02,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 07:40:02,449 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:02,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:02,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1477097076, now seen corresponding path program 1 times [2024-11-12 07:40:02,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:40:02,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328890368] [2024-11-12 07:40:02,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:02,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:40:02,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:02,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:40:02,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:02,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:40:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:02,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:40:02,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:02,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:40:02,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:02,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:40:02,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:02,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:40:02,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:02,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:40:02,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:02,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:40:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:02,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:40:02,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:02,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:40:02,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:02,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:40:02,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:02,593 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 07:40:02,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:40:02,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328890368] [2024-11-12 07:40:02,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328890368] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:40:02,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:40:02,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:40:02,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133833674] [2024-11-12 07:40:02,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:40:02,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:40:02,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:40:02,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:40:02,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:40:02,595 INFO L87 Difference]: Start difference. First operand 98 states and 135 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:40:02,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:40:02,623 INFO L93 Difference]: Finished difference Result 191 states and 264 transitions. [2024-11-12 07:40:02,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:40:02,624 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 97 [2024-11-12 07:40:02,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:40:02,625 INFO L225 Difference]: With dead ends: 191 [2024-11-12 07:40:02,625 INFO L226 Difference]: Without dead ends: 101 [2024-11-12 07:40:02,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:40:02,626 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:40:02,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 454 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:40:02,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-12 07:40:02,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2024-11-12 07:40:02,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 83 states have (on average 1.3253012048192772) internal successors, (110), 84 states have internal predecessors, (110), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 07:40:02,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 136 transitions. [2024-11-12 07:40:02,634 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 136 transitions. Word has length 97 [2024-11-12 07:40:02,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:40:02,635 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 136 transitions. [2024-11-12 07:40:02,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:40:02,635 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 136 transitions. [2024-11-12 07:40:02,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-12 07:40:02,636 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:02,636 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:40:02,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 07:40:02,636 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:02,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:02,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1218931638, now seen corresponding path program 1 times [2024-11-12 07:40:02,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:40:02,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103013837] [2024-11-12 07:40:02,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:02,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:40:02,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:40:03,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:40:03,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:40:03,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:40:03,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:40:03,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:40:03,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:40:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:40:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:40:03,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:40:03,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:40:03,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,147 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 07:40:03,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:40:03,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103013837] [2024-11-12 07:40:03,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103013837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:40:03,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:40:03,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:40:03,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393401305] [2024-11-12 07:40:03,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:40:03,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:40:03,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:40:03,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:40:03,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:40:03,149 INFO L87 Difference]: Start difference. First operand 99 states and 136 transitions. Second operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-12 07:40:03,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:40:03,361 INFO L93 Difference]: Finished difference Result 219 states and 299 transitions. [2024-11-12 07:40:03,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:40:03,361 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 97 [2024-11-12 07:40:03,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:40:03,362 INFO L225 Difference]: With dead ends: 219 [2024-11-12 07:40:03,362 INFO L226 Difference]: Without dead ends: 128 [2024-11-12 07:40:03,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 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-12 07:40:03,363 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 38 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:40:03,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 386 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:40:03,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-12 07:40:03,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 99. [2024-11-12 07:40:03,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 84 states have internal predecessors, (109), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 07:40:03,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 135 transitions. [2024-11-12 07:40:03,377 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 135 transitions. Word has length 97 [2024-11-12 07:40:03,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:40:03,377 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 135 transitions. [2024-11-12 07:40:03,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-12 07:40:03,377 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 135 transitions. [2024-11-12 07:40:03,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-12 07:40:03,378 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:03,378 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:40:03,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 07:40:03,378 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:03,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:03,379 INFO L85 PathProgramCache]: Analyzing trace with hash 721006156, now seen corresponding path program 1 times [2024-11-12 07:40:03,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:40:03,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767448262] [2024-11-12 07:40:03,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:03,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:40:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:40:03,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:40:03,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:40:03,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:40:03,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:40:03,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:40:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:40:03,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:40:03,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:40:03,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:40:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:40:03,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:03,852 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 07:40:03,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:40:03,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767448262] [2024-11-12 07:40:03,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767448262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:40:03,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:40:03,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 07:40:03,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904907507] [2024-11-12 07:40:03,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:40:03,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 07:40:03,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:40:03,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 07:40:03,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:40:03,854 INFO L87 Difference]: Start difference. First operand 99 states and 135 transitions. Second operand has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-12 07:40:04,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:40:04,136 INFO L93 Difference]: Finished difference Result 269 states and 365 transitions. [2024-11-12 07:40:04,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:40:04,136 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2024-11-12 07:40:04,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:40:04,137 INFO L225 Difference]: With dead ends: 269 [2024-11-12 07:40:04,137 INFO L226 Difference]: Without dead ends: 178 [2024-11-12 07:40:04,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-12 07:40:04,138 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 72 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:40:04,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 520 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 07:40:04,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-12 07:40:04,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 175. [2024-11-12 07:40:04,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 149 states have (on average 1.308724832214765) internal successors, (195), 151 states have internal predecessors, (195), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-12 07:40:04,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 237 transitions. [2024-11-12 07:40:04,148 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 237 transitions. Word has length 98 [2024-11-12 07:40:04,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:40:04,148 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 237 transitions. [2024-11-12 07:40:04,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-12 07:40:04,148 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 237 transitions. [2024-11-12 07:40:04,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-12 07:40:04,149 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:04,149 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:40:04,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 07:40:04,149 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:04,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:04,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1669998802, now seen corresponding path program 1 times [2024-11-12 07:40:04,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:40:04,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141305091] [2024-11-12 07:40:04,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:04,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:40:04,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:40:04,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:40:04,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:40:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:40:04,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:40:04,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:40:04,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:40:04,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:40:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:40:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:40:04,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:40:04,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,386 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 07:40:04,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:40:04,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141305091] [2024-11-12 07:40:04,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141305091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:40:04,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:40:04,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:40:04,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695896206] [2024-11-12 07:40:04,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:40:04,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:40:04,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:40:04,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:40:04,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:40:04,388 INFO L87 Difference]: Start difference. First operand 175 states and 237 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:40:04,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:40:04,546 INFO L93 Difference]: Finished difference Result 437 states and 584 transitions. [2024-11-12 07:40:04,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 07:40:04,546 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-11-12 07:40:04,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:40:04,548 INFO L225 Difference]: With dead ends: 437 [2024-11-12 07:40:04,548 INFO L226 Difference]: Without dead ends: 270 [2024-11-12 07:40:04,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:40:04,549 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 48 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:40:04,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 607 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:40:04,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-11-12 07:40:04,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 183. [2024-11-12 07:40:04,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 157 states have (on average 1.3184713375796178) internal successors, (207), 159 states have internal predecessors, (207), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-12 07:40:04,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 249 transitions. [2024-11-12 07:40:04,558 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 249 transitions. Word has length 99 [2024-11-12 07:40:04,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:40:04,559 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 249 transitions. [2024-11-12 07:40:04,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:40:04,559 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 249 transitions. [2024-11-12 07:40:04,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-12 07:40:04,560 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:04,560 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:40:04,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 07:40:04,560 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:04,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:04,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1603900140, now seen corresponding path program 1 times [2024-11-12 07:40:04,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:40:04,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178673481] [2024-11-12 07:40:04,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:04,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:40:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:40:04,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:40:04,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:40:04,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:40:04,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:40:04,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:40:04,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:40:04,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:40:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:40:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:40:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:40:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:04,724 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 07:40:04,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:40:04,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178673481] [2024-11-12 07:40:04,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178673481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:40:04,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:40:04,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:40:04,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501502619] [2024-11-12 07:40:04,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:40:04,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:40:04,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:40:04,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:40:04,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:40:04,726 INFO L87 Difference]: Start difference. First operand 183 states and 249 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:40:04,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:40:04,851 INFO L93 Difference]: Finished difference Result 453 states and 611 transitions. [2024-11-12 07:40:04,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:40:04,851 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-11-12 07:40:04,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:40:04,853 INFO L225 Difference]: With dead ends: 453 [2024-11-12 07:40:04,853 INFO L226 Difference]: Without dead ends: 278 [2024-11-12 07:40:04,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:40:04,854 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 96 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:40:04,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 322 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:40:04,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-11-12 07:40:04,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 188. [2024-11-12 07:40:04,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 164 states have (on average 1.329268292682927) internal successors, (218), 165 states have internal predecessors, (218), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 07:40:04,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 256 transitions. [2024-11-12 07:40:04,863 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 256 transitions. Word has length 99 [2024-11-12 07:40:04,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:40:04,864 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 256 transitions. [2024-11-12 07:40:04,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:40:04,864 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 256 transitions. [2024-11-12 07:40:04,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-12 07:40:04,865 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:04,865 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:40:04,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 07:40:04,865 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:04,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:04,865 INFO L85 PathProgramCache]: Analyzing trace with hash 15552238, now seen corresponding path program 1 times [2024-11-12 07:40:04,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:40:04,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372250640] [2024-11-12 07:40:04,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:04,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:40:04,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:05,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:40:05,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:05,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:40:05,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:05,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:40:05,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:05,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:40:05,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:05,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:40:05,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:05,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:40:05,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:05,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:40:05,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:05,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:40:05,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:05,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:40:05,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:05,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:40:05,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:05,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:40:05,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:05,028 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 07:40:05,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:40:05,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372250640] [2024-11-12 07:40:05,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372250640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:40:05,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:40:05,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:40:05,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142873210] [2024-11-12 07:40:05,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:40:05,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:40:05,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:40:05,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:40:05,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:40:05,030 INFO L87 Difference]: Start difference. First operand 188 states and 256 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:40:05,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:40:05,181 INFO L93 Difference]: Finished difference Result 464 states and 617 transitions. [2024-11-12 07:40:05,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:40:05,182 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-11-12 07:40:05,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:40:05,183 INFO L225 Difference]: With dead ends: 464 [2024-11-12 07:40:05,183 INFO L226 Difference]: Without dead ends: 279 [2024-11-12 07:40:05,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:40:05,184 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 55 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:40:05,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 373 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:40:05,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-11-12 07:40:05,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 267. [2024-11-12 07:40:05,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 231 states have (on average 1.277056277056277) internal successors, (295), 234 states have internal predecessors, (295), 27 states have call successors, (27), 8 states have call predecessors, (27), 8 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 07:40:05,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 349 transitions. [2024-11-12 07:40:05,204 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 349 transitions. Word has length 99 [2024-11-12 07:40:05,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:40:05,204 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 349 transitions. [2024-11-12 07:40:05,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:40:05,205 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 349 transitions. [2024-11-12 07:40:05,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-12 07:40:05,206 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:05,206 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:40:05,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 07:40:05,206 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:05,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:05,206 INFO L85 PathProgramCache]: Analyzing trace with hash -949172821, now seen corresponding path program 1 times [2024-11-12 07:40:05,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:40:05,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412521266] [2024-11-12 07:40:05,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:05,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:40:05,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 07:40:05,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [591861602] [2024-11-12 07:40:05,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:05,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:40:05,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:40:05,273 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-12 07:40:05,274 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-12 07:40:05,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:05,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-12 07:40:05,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:40:05,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 54 [2024-11-12 07:40:05,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 72 [2024-11-12 07:40:05,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-12 07:40:05,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-12 07:40:05,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-12 07:40:05,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-12 07:40:05,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-12 07:40:05,834 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:40:05,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 24 [2024-11-12 07:40:05,854 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:40:05,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 24 [2024-11-12 07:40:05,867 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:40:05,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-12 07:40:05,900 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:40:05,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 12 [2024-11-12 07:40:05,919 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 07:40:05,919 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:40:05,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:40:05,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412521266] [2024-11-12 07:40:05,920 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 07:40:05,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591861602] [2024-11-12 07:40:05,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591861602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:40:05,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:40:05,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:40:05,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396151682] [2024-11-12 07:40:05,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:40:05,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 07:40:05,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:40:05,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 07:40:05,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:40:05,922 INFO L87 Difference]: Start difference. First operand 267 states and 349 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:40:07,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:40:07,294 INFO L93 Difference]: Finished difference Result 826 states and 1089 transitions. [2024-11-12 07:40:07,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:40:07,294 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-11-12 07:40:07,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:40:07,296 INFO L225 Difference]: With dead ends: 826 [2024-11-12 07:40:07,296 INFO L226 Difference]: Without dead ends: 562 [2024-11-12 07:40:07,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:40:07,297 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 128 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:40:07,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 531 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-12 07:40:07,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2024-11-12 07:40:07,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 396. [2024-11-12 07:40:07,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 346 states have (on average 1.2658959537572254) internal successors, (438), 349 states have internal predecessors, (438), 38 states have call successors, (38), 11 states have call predecessors, (38), 11 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-12 07:40:07,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 514 transitions. [2024-11-12 07:40:07,317 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 514 transitions. Word has length 99 [2024-11-12 07:40:07,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:40:07,317 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 514 transitions. [2024-11-12 07:40:07,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:40:07,317 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 514 transitions. [2024-11-12 07:40:07,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-12 07:40:07,318 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:07,318 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:40:07,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 07:40:07,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-12 07:40:07,523 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:07,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:07,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1418951654, now seen corresponding path program 1 times [2024-11-12 07:40:07,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:40:07,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211367723] [2024-11-12 07:40:07,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:07,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:40:07,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:07,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:40:07,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:07,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:40:07,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:07,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:40:07,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:07,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:40:07,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:07,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:40:07,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:07,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:40:07,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:07,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:40:07,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:07,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:40:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:07,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:40:07,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:07,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:40:07,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:07,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 07:40:07,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:07,639 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 07:40:07,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:40:07,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211367723] [2024-11-12 07:40:07,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211367723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:40:07,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:40:07,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:40:07,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840435969] [2024-11-12 07:40:07,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:40:07,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:40:07,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:40:07,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:40:07,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:40:07,640 INFO L87 Difference]: Start difference. First operand 396 states and 514 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:40:07,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:40:07,676 INFO L93 Difference]: Finished difference Result 676 states and 880 transitions. [2024-11-12 07:40:07,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:40:07,677 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 100 [2024-11-12 07:40:07,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:40:07,678 INFO L225 Difference]: With dead ends: 676 [2024-11-12 07:40:07,678 INFO L226 Difference]: Without dead ends: 412 [2024-11-12 07:40:07,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:40:07,679 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:40:07,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 556 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:40:07,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-11-12 07:40:07,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 406. [2024-11-12 07:40:07,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 356 states have (on average 1.2584269662921348) internal successors, (448), 359 states have internal predecessors, (448), 38 states have call successors, (38), 11 states have call predecessors, (38), 11 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-12 07:40:07,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 524 transitions. [2024-11-12 07:40:07,700 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 524 transitions. Word has length 100 [2024-11-12 07:40:07,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:40:07,701 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 524 transitions. [2024-11-12 07:40:07,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:40:07,701 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 524 transitions. [2024-11-12 07:40:07,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-12 07:40:07,702 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:07,702 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:40:07,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 07:40:07,702 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:07,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:07,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1251915825, now seen corresponding path program 1 times [2024-11-12 07:40:07,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:40:07,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692584683] [2024-11-12 07:40:07,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:07,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:40:07,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 07:40:07,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [161564037] [2024-11-12 07:40:07,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:07,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:40:07,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:40:07,747 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-12 07:40:07,748 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-12 07:40:07,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 07:40:07,994 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 07:40:08,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 07:40:08,171 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 07:40:08,172 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 07:40:08,174 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 07:40:08,192 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-12 07:40:08,376 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,SelfDestructingSolverStorable14 [2024-11-12 07:40:08,379 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:40:08,422 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 07:40:08,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 07:40:08 BoogieIcfgContainer [2024-11-12 07:40:08,426 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 07:40:08,426 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 07:40:08,427 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 07:40:08,427 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 07:40:08,427 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:39:57" (3/4) ... [2024-11-12 07:40:08,429 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 07:40:08,430 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 07:40:08,430 INFO L158 Benchmark]: Toolchain (without parser) took 12211.65ms. Allocated memory was 190.8MB in the beginning and 419.4MB in the end (delta: 228.6MB). Free memory was 159.8MB in the beginning and 200.8MB in the end (delta: -41.0MB). Peak memory consumption was 187.2MB. Max. memory is 16.1GB. [2024-11-12 07:40:08,430 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 132.1MB. Free memory is still 96.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 07:40:08,431 INFO L158 Benchmark]: CACSL2BoogieTranslator took 297.68ms. Allocated memory is still 190.8MB. Free memory was 159.6MB in the beginning and 147.1MB in the end (delta: 12.5MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2024-11-12 07:40:08,431 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.54ms. Allocated memory is still 190.8MB. Free memory was 147.1MB in the beginning and 142.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 07:40:08,431 INFO L158 Benchmark]: Boogie Preprocessor took 53.67ms. Allocated memory is still 190.8MB. Free memory was 142.9MB in the beginning and 139.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 07:40:08,432 INFO L158 Benchmark]: RCFGBuilder took 632.96ms. Allocated memory is still 190.8MB. Free memory was 139.6MB in the beginning and 110.1MB in the end (delta: 29.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-12 07:40:08,432 INFO L158 Benchmark]: TraceAbstraction took 11161.22ms. Allocated memory was 190.8MB in the beginning and 419.4MB in the end (delta: 228.6MB). Free memory was 109.3MB in the beginning and 200.8MB in the end (delta: -91.5MB). Peak memory consumption was 136.7MB. Max. memory is 16.1GB. [2024-11-12 07:40:08,432 INFO L158 Benchmark]: Witness Printer took 3.67ms. Allocated memory is still 419.4MB. Free memory is still 200.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 07:40:08,433 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.14ms. Allocated memory is still 132.1MB. Free memory is still 96.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 297.68ms. Allocated memory is still 190.8MB. Free memory was 159.6MB in the beginning and 147.1MB in the end (delta: 12.5MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.54ms. Allocated memory is still 190.8MB. Free memory was 147.1MB in the beginning and 142.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.67ms. Allocated memory is still 190.8MB. Free memory was 142.9MB in the beginning and 139.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 632.96ms. Allocated memory is still 190.8MB. Free memory was 139.6MB in the beginning and 110.1MB in the end (delta: 29.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 11161.22ms. Allocated memory was 190.8MB in the beginning and 419.4MB in the end (delta: 228.6MB). Free memory was 109.3MB in the beginning and 200.8MB in the end (delta: -91.5MB). Peak memory consumption was 136.7MB. Max. memory is 16.1GB. * Witness Printer took 3.67ms. Allocated memory is still 419.4MB. Free memory is still 200.8MB. 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: 19]: 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 someBinaryDOUBLEComparisonOperation at line 111. Possible FailurePath: [L34] unsigned char isInitial = 0; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 200, 0, 1107940323, 0, 4, -32, 64, 4, 0.97, 32.6 }; [L47] signed long int last_1_WrapperStruct00_var_1_7 = 4; [L48] double last_1_WrapperStruct00_var_1_13 = 0.97; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L115] isInitial = 1 [L116] FCALL initially() [L117] COND TRUE 1 [L118] CALL updateLastVariables() [L107] EXPR WrapperStruct00.var_1_7 [L107] last_1_WrapperStruct00_var_1_7 = WrapperStruct00.var_1_7 [L108] EXPR WrapperStruct00.var_1_13 [L108] last_1_WrapperStruct00_var_1_13 = WrapperStruct00.var_1_13 [L118] RET updateLastVariables() [L119] CALL updateVariables() [L88] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L89] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L90] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L91] WrapperStruct00.var_1_3 = __VERIFIER_nondet_long() [L92] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 1073741822) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 1073741822) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L93] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 2147483646) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 2147483646) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L94] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L95] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L96] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L97] WrapperStruct00.var_1_8 = __VERIFIER_nondet_long() [L98] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= -1073741823) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= -1073741823) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L99] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 1073741823) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 1073741823) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L100] WrapperStruct00.var_1_12 = __VERIFIER_nondet_uchar() [L101] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L102] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L103] WrapperStruct00.var_1_14 = __VERIFIER_nondet_double() [L104] EXPR WrapperStruct00.var_1_14 [L104] EXPR WrapperStruct00.var_1_14 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F [L104] EXPR WrapperStruct00.var_1_14 [L104] EXPR WrapperStruct00.var_1_14 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L104] EXPR (WrapperStruct00.var_1_14 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L104] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L104] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L119] RET updateVariables() [L120] CALL step() [L52] EXPR WrapperStruct00.var_1_3 [L52] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L52] COND FALSE !(! (WrapperStruct00.var_1_3 < (WrapperStruct00.var_1_8 * last_1_WrapperStruct00_var_1_7))) [L59] EXPR WrapperStruct00.var_1_12 [L59] WrapperStruct00.var_1_9 = WrapperStruct00.var_1_12 [L61] EXPR WrapperStruct00.var_1_9 [L61] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L61] COND FALSE !(WrapperStruct00.var_1_9 < WrapperStruct00.var_1_9) [L64] EXPR WrapperStruct00.var_1_9 [L64] EXPR WrapperStruct00.var_1_3 [L64] WrapperStruct00.var_1_7 = (WrapperStruct00.var_1_9 - WrapperStruct00.var_1_3) [L66] EXPR WrapperStruct00.var_1_9 [L66] EXPR WrapperStruct00.var_1_3 [L66] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L66] COND FALSE !((WrapperStruct00.var_1_9 + WrapperStruct00.var_1_3) < WrapperStruct00.var_1_9) [L77] EXPR WrapperStruct00.var_1_14 [L77] WrapperStruct00.var_1_13 = WrapperStruct00.var_1_14 [L79] WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L79] COND TRUE WrapperStruct00.var_1_2 [L80] EXPR WrapperStruct00.var_1_3 [L80] EXPR WrapperStruct00.var_1_9 [L80] EXPR WrapperStruct00.var_1_9 [L80] WrapperStruct00.var_1_1 = ((WrapperStruct00.var_1_3 - WrapperStruct00.var_1_9) - WrapperStruct00.var_1_9) [L120] RET step() [L121] CALL, EXPR property() [L111] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L111] EXPR WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((signed long int) ((WrapperStruct00.var_1_3 - WrapperStruct00.var_1_9) - WrapperStruct00.var_1_9))) : ((WrapperStruct00.var_1_6 && (WrapperStruct00.var_1_3 < WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_3)) : 1) [L111] EXPR WrapperStruct00.var_1_1 [L111] EXPR WrapperStruct00.var_1_3 [L111] EXPR WrapperStruct00.var_1_9 [L111] EXPR WrapperStruct00.var_1_9 [L111] EXPR WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((signed long int) ((WrapperStruct00.var_1_3 - WrapperStruct00.var_1_9) - WrapperStruct00.var_1_9))) : ((WrapperStruct00.var_1_6 && (WrapperStruct00.var_1_3 < WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_3)) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L111] EXPR (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((signed long int) ((WrapperStruct00.var_1_3 - WrapperStruct00.var_1_9) - WrapperStruct00.var_1_9))) : ((WrapperStruct00.var_1_6 && (WrapperStruct00.var_1_3 < WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_3)) : 1)) && ((WrapperStruct00.var_1_9 < WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_7 == ((signed long int) (WrapperStruct00.var_1_9 + WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_7 == ((signed long int) (WrapperStruct00.var_1_9 - WrapperStruct00.var_1_3)))) [L111] EXPR WrapperStruct00.var_1_9 [L111] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L111] EXPR (WrapperStruct00.var_1_9 < WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_7 == ((signed long int) (WrapperStruct00.var_1_9 + WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_7 == ((signed long int) (WrapperStruct00.var_1_9 - WrapperStruct00.var_1_3))) [L111] EXPR WrapperStruct00.var_1_7 [L111] EXPR WrapperStruct00.var_1_9 [L111] EXPR WrapperStruct00.var_1_3 [L111] EXPR (WrapperStruct00.var_1_9 < WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_7 == ((signed long int) (WrapperStruct00.var_1_9 + WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_7 == ((signed long int) (WrapperStruct00.var_1_9 - WrapperStruct00.var_1_3))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L111] EXPR (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((signed long int) ((WrapperStruct00.var_1_3 - WrapperStruct00.var_1_9) - WrapperStruct00.var_1_9))) : ((WrapperStruct00.var_1_6 && (WrapperStruct00.var_1_3 < WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_3)) : 1)) && ((WrapperStruct00.var_1_9 < WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_7 == ((signed long int) (WrapperStruct00.var_1_9 + WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_7 == ((signed long int) (WrapperStruct00.var_1_9 - WrapperStruct00.var_1_3)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L111] EXPR ((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((signed long int) ((WrapperStruct00.var_1_3 - WrapperStruct00.var_1_9) - WrapperStruct00.var_1_9))) : ((WrapperStruct00.var_1_6 && (WrapperStruct00.var_1_3 < WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_3)) : 1)) && ((WrapperStruct00.var_1_9 < WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_7 == ((signed long int) (WrapperStruct00.var_1_9 + WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_7 == ((signed long int) (WrapperStruct00.var_1_9 - WrapperStruct00.var_1_3))))) && ((! (WrapperStruct00.var_1_3 < (WrapperStruct00.var_1_8 * last_1_WrapperStruct00_var_1_7))) ? ((((((last_1_WrapperStruct00_var_1_13) < 0 ) ? -(last_1_WrapperStruct00_var_1_13) : (last_1_WrapperStruct00_var_1_13))) < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_9 == ((unsigned char) WrapperStruct00.var_1_12)) : 1) : 1) : (WrapperStruct00.var_1_9 == ((unsigned char) WrapperStruct00.var_1_12))) [L111] EXPR WrapperStruct00.var_1_3 [L111] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L111] EXPR (! (WrapperStruct00.var_1_3 < (WrapperStruct00.var_1_8 * last_1_WrapperStruct00_var_1_7))) ? ((((((last_1_WrapperStruct00_var_1_13) < 0 ) ? -(last_1_WrapperStruct00_var_1_13) : (last_1_WrapperStruct00_var_1_13))) < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_9 == ((unsigned char) WrapperStruct00.var_1_12)) : 1) : 1) : (WrapperStruct00.var_1_9 == ((unsigned char) WrapperStruct00.var_1_12)) [L111] EXPR WrapperStruct00.var_1_9 [L111] EXPR WrapperStruct00.var_1_12 [L111] EXPR (! (WrapperStruct00.var_1_3 < (WrapperStruct00.var_1_8 * last_1_WrapperStruct00_var_1_7))) ? ((((((last_1_WrapperStruct00_var_1_13) < 0 ) ? -(last_1_WrapperStruct00_var_1_13) : (last_1_WrapperStruct00_var_1_13))) < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_9 == ((unsigned char) WrapperStruct00.var_1_12)) : 1) : 1) : (WrapperStruct00.var_1_9 == ((unsigned char) WrapperStruct00.var_1_12)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L111] EXPR ((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((signed long int) ((WrapperStruct00.var_1_3 - WrapperStruct00.var_1_9) - WrapperStruct00.var_1_9))) : ((WrapperStruct00.var_1_6 && (WrapperStruct00.var_1_3 < WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_3)) : 1)) && ((WrapperStruct00.var_1_9 < WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_7 == ((signed long int) (WrapperStruct00.var_1_9 + WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_7 == ((signed long int) (WrapperStruct00.var_1_9 - WrapperStruct00.var_1_3))))) && ((! (WrapperStruct00.var_1_3 < (WrapperStruct00.var_1_8 * last_1_WrapperStruct00_var_1_7))) ? ((((((last_1_WrapperStruct00_var_1_13) < 0 ) ? -(last_1_WrapperStruct00_var_1_13) : (last_1_WrapperStruct00_var_1_13))) < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_9 == ((unsigned char) WrapperStruct00.var_1_12)) : 1) : 1) : (WrapperStruct00.var_1_9 == ((unsigned char) WrapperStruct00.var_1_12))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L111] EXPR (((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((signed long int) ((WrapperStruct00.var_1_3 - WrapperStruct00.var_1_9) - WrapperStruct00.var_1_9))) : ((WrapperStruct00.var_1_6 && (WrapperStruct00.var_1_3 < WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_3)) : 1)) && ((WrapperStruct00.var_1_9 < WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_7 == ((signed long int) (WrapperStruct00.var_1_9 + WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_7 == ((signed long int) (WrapperStruct00.var_1_9 - WrapperStruct00.var_1_3))))) && ((! (WrapperStruct00.var_1_3 < (WrapperStruct00.var_1_8 * last_1_WrapperStruct00_var_1_7))) ? ((((((last_1_WrapperStruct00_var_1_13) < 0 ) ? -(last_1_WrapperStruct00_var_1_13) : (last_1_WrapperStruct00_var_1_13))) < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_9 == ((unsigned char) WrapperStruct00.var_1_12)) : 1) : 1) : (WrapperStruct00.var_1_9 == ((unsigned char) WrapperStruct00.var_1_12)))) && (((WrapperStruct00.var_1_9 + WrapperStruct00.var_1_3) < WrapperStruct00.var_1_9) ? ((WrapperStruct00.var_1_2 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_13 == ((double) 0.8)) : (WrapperStruct00.var_1_13 == ((double) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_13 == ((double) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_13 == ((double) WrapperStruct00.var_1_14))) [L111] EXPR WrapperStruct00.var_1_9 [L111] EXPR WrapperStruct00.var_1_3 [L111] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L111] EXPR ((WrapperStruct00.var_1_9 + WrapperStruct00.var_1_3) < WrapperStruct00.var_1_9) ? ((WrapperStruct00.var_1_2 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_13 == ((double) 0.8)) : (WrapperStruct00.var_1_13 == ((double) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_13 == ((double) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_13 == ((double) WrapperStruct00.var_1_14)) [L111] EXPR WrapperStruct00.var_1_13 [L111] EXPR WrapperStruct00.var_1_14 [L111] EXPR ((WrapperStruct00.var_1_9 + WrapperStruct00.var_1_3) < WrapperStruct00.var_1_9) ? ((WrapperStruct00.var_1_2 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_13 == ((double) 0.8)) : (WrapperStruct00.var_1_13 == ((double) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_13 == ((double) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_13 == ((double) WrapperStruct00.var_1_14)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L111] EXPR (((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((signed long int) ((WrapperStruct00.var_1_3 - WrapperStruct00.var_1_9) - WrapperStruct00.var_1_9))) : ((WrapperStruct00.var_1_6 && (WrapperStruct00.var_1_3 < WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_3)) : 1)) && ((WrapperStruct00.var_1_9 < WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_7 == ((signed long int) (WrapperStruct00.var_1_9 + WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_7 == ((signed long int) (WrapperStruct00.var_1_9 - WrapperStruct00.var_1_3))))) && ((! (WrapperStruct00.var_1_3 < (WrapperStruct00.var_1_8 * last_1_WrapperStruct00_var_1_7))) ? ((((((last_1_WrapperStruct00_var_1_13) < 0 ) ? -(last_1_WrapperStruct00_var_1_13) : (last_1_WrapperStruct00_var_1_13))) < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_9 == ((unsigned char) WrapperStruct00.var_1_12)) : 1) : 1) : (WrapperStruct00.var_1_9 == ((unsigned char) WrapperStruct00.var_1_12)))) && (((WrapperStruct00.var_1_9 + WrapperStruct00.var_1_3) < WrapperStruct00.var_1_9) ? ((WrapperStruct00.var_1_2 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_13 == ((double) 0.8)) : (WrapperStruct00.var_1_13 == ((double) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_13 == ((double) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_13 == ((double) WrapperStruct00.var_1_14))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L111-L112] return (((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((signed long int) ((WrapperStruct00.var_1_3 - WrapperStruct00.var_1_9) - WrapperStruct00.var_1_9))) : ((WrapperStruct00.var_1_6 && (WrapperStruct00.var_1_3 < WrapperStruct00.var_1_9)) ? (WrapperStruct00.var_1_1 == ((signed long int) WrapperStruct00.var_1_3)) : 1)) && ((WrapperStruct00.var_1_9 < WrapperStruct00.var_1_9) ? (WrapperStruct00.var_1_7 == ((signed long int) (WrapperStruct00.var_1_9 + WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_7 == ((signed long int) (WrapperStruct00.var_1_9 - WrapperStruct00.var_1_3))))) && ((! (WrapperStruct00.var_1_3 < (WrapperStruct00.var_1_8 * last_1_WrapperStruct00_var_1_7))) ? ((((((last_1_WrapperStruct00_var_1_13) < 0 ) ? -(last_1_WrapperStruct00_var_1_13) : (last_1_WrapperStruct00_var_1_13))) < last_1_WrapperStruct00_var_1_13) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_9 == ((unsigned char) WrapperStruct00.var_1_12)) : 1) : 1) : (WrapperStruct00.var_1_9 == ((unsigned char) WrapperStruct00.var_1_12)))) && (((WrapperStruct00.var_1_9 + WrapperStruct00.var_1_3) < WrapperStruct00.var_1_9) ? ((WrapperStruct00.var_1_2 && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_13 == ((double) 0.8)) : (WrapperStruct00.var_1_13 == ((double) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_13 == ((double) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_13 == ((double) WrapperStruct00.var_1_14))) ; [L121] RET, EXPR property() [L121] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 87 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.1s, OverallIterations: 15, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 656 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 651 mSDsluCounter, 5703 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4033 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2190 IncrementalHoareTripleChecker+Invalid, 2242 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 1670 mSDtfsCounter, 2190 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 529 GetRequests, 465 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=406occurred in iteration=14, InterpolantAutomatonStates: 80, 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, 14 MinimizatonAttempts, 472 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 1657 NumberOfCodeBlocks, 1657 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1344 ConstructedInterpolants, 0 QuantifiedInterpolants, 3243 SizeOfPredicates, 4 NumberOfNonLiveVariables, 386 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 3080/3080 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-12 07:40:08,492 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/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-31.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 06db6f319d52eb323239c55a3f8926e2d1f65f125a385def75e49857a30f4ad4 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:40:10,247 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:40:10,310 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 07:40:10,319 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:40:10,320 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:40:10,347 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:40:10,350 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:40:10,350 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:40:10,351 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:40:10,351 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:40:10,351 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:40:10,351 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:40:10,352 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:40:10,352 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:40:10,352 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:40:10,353 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:40:10,353 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:40:10,355 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:40:10,355 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:40:10,356 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:40:10,356 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:40:10,359 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:40:10,359 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:40:10,359 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 07:40:10,359 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 07:40:10,360 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:40:10,360 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 07:40:10,360 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:40:10,360 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:40:10,361 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:40:10,361 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:40:10,361 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:40:10,361 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:40:10,361 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:40:10,362 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:40:10,362 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:40:10,362 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:40:10,362 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:40:10,362 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 07:40:10,363 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 07:40:10,363 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:40:10,364 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:40:10,364 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:40:10,364 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:40:10,365 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 -> 06db6f319d52eb323239c55a3f8926e2d1f65f125a385def75e49857a30f4ad4 [2024-11-12 07:40:10,626 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:40:10,642 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:40:10,644 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:40:10,645 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:40:10,645 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:40:10,646 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-31.i [2024-11-12 07:40:11,921 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:40:12,105 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:40:12,105 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-31.i [2024-11-12 07:40:12,114 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aff88ad0a/28402190c59d481abcc76c7500fd6068/FLAG754bc227e [2024-11-12 07:40:12,487 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aff88ad0a/28402190c59d481abcc76c7500fd6068 [2024-11-12 07:40:12,489 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:40:12,490 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:40:12,493 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:40:12,493 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:40:12,497 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:40:12,498 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:40:12" (1/1) ... [2024-11-12 07:40:12,498 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44493505 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:40:12, skipping insertion in model container [2024-11-12 07:40:12,499 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:40:12" (1/1) ... [2024-11-12 07:40:12,519 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:40:12,662 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/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-31.i[916,929] [2024-11-12 07:40:12,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:40:12,729 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:40:12,740 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/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-31.i[916,929] [2024-11-12 07:40:12,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:40:12,799 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:40:12,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:40:12 WrapperNode [2024-11-12 07:40:12,800 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:40:12,801 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:40:12,801 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:40:12,801 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:40:12,806 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:40:12" (1/1) ... [2024-11-12 07:40:12,822 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:40:12" (1/1) ... [2024-11-12 07:40:12,860 INFO L138 Inliner]: procedures = 34, calls = 133, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 408 [2024-11-12 07:40:12,863 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:40:12,863 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:40:12,863 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:40:12,863 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:40:12,872 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:40:12" (1/1) ... [2024-11-12 07:40:12,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:40:12" (1/1) ... [2024-11-12 07:40:12,882 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:40:12" (1/1) ... [2024-11-12 07:40:12,911 INFO L175 MemorySlicer]: Split 111 memory accesses to 2 slices as follows [2, 109]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 27 writes are split as follows [0, 27]. [2024-11-12 07:40:12,911 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:40:12" (1/1) ... [2024-11-12 07:40:12,911 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:40:12" (1/1) ... [2024-11-12 07:40:12,938 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:40:12" (1/1) ... [2024-11-12 07:40:12,945 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:40:12" (1/1) ... [2024-11-12 07:40:12,950 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:40:12" (1/1) ... [2024-11-12 07:40:12,951 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:40:12" (1/1) ... [2024-11-12 07:40:12,958 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:40:12,963 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:40:12,963 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:40:12,963 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:40:12,963 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:40:12" (1/1) ... [2024-11-12 07:40:12,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:40:12,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:40:12,993 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-12 07:40:12,995 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-12 07:40:13,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:40:13,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-12 07:40:13,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-12 07:40:13,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-12 07:40:13,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-12 07:40:13,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-12 07:40:13,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-12 07:40:13,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-12 07:40:13,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-12 07:40:13,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 07:40:13,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-12 07:40:13,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-12 07:40:13,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-12 07:40:13,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-12 07:40:13,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-12 07:40:13,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-12 07:40:13,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-12 07:40:13,031 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:40:13,032 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:40:13,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:40:13,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:40:13,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-12 07:40:13,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-12 07:40:13,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-12 07:40:13,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-12 07:40:13,120 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:40:13,122 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:40:13,631 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2024-11-12 07:40:13,632 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:40:13,644 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:40:13,644 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:40:13,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:40:13 BoogieIcfgContainer [2024-11-12 07:40:13,645 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:40:13,646 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:40:13,647 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:40:13,650 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:40:13,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:40:12" (1/3) ... [2024-11-12 07:40:13,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ecb85ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:40:13, skipping insertion in model container [2024-11-12 07:40:13,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:40:12" (2/3) ... [2024-11-12 07:40:13,652 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ecb85ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:40:13, skipping insertion in model container [2024-11-12 07:40:13,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:40:13" (3/3) ... [2024-11-12 07:40:13,655 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-31.i [2024-11-12 07:40:13,671 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:40:13,671 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:40:13,728 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:40:13,733 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;@55d85c70, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:40:13,733 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:40:13,737 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 73 states have (on average 1.452054794520548) internal successors, (106), 74 states have internal predecessors, (106), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-12 07:40:13,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-12 07:40:13,745 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:13,746 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:40:13,747 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:13,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:13,764 INFO L85 PathProgramCache]: Analyzing trace with hash -2081525877, now seen corresponding path program 1 times [2024-11-12 07:40:13,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:40:13,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1131862060] [2024-11-12 07:40:13,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:13,779 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-12 07:40:13,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:40:13,782 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-12 07:40:13,783 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-12 07:40:13,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:13,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 07:40:13,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:40:14,027 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2024-11-12 07:40:14,030 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:40:14,030 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:40:14,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1131862060] [2024-11-12 07:40:14,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1131862060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:40:14,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:40:14,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:40:14,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524998328] [2024-11-12 07:40:14,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:40:14,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:40:14,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:40:14,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:40:14,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:40:14,056 INFO L87 Difference]: Start difference. First operand has 87 states, 73 states have (on average 1.452054794520548) internal successors, (106), 74 states have internal predecessors, (106), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-12 07:40:14,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:40:14,079 INFO L93 Difference]: Finished difference Result 164 states and 256 transitions. [2024-11-12 07:40:14,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:40:14,080 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 94 [2024-11-12 07:40:14,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:40:14,085 INFO L225 Difference]: With dead ends: 164 [2024-11-12 07:40:14,086 INFO L226 Difference]: Without dead ends: 80 [2024-11-12 07:40:14,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:40:14,090 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:40:14,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:40:14,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-12 07:40:14,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-12 07:40:14,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 67 states have (on average 1.373134328358209) internal successors, (92), 67 states have internal predecessors, (92), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-12 07:40:14,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 114 transitions. [2024-11-12 07:40:14,119 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 114 transitions. Word has length 94 [2024-11-12 07:40:14,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:40:14,119 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 114 transitions. [2024-11-12 07:40:14,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-12 07:40:14,125 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 114 transitions. [2024-11-12 07:40:14,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-12 07:40:14,127 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:14,127 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:40:14,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-12 07:40:14,328 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-12 07:40:14,328 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:14,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:14,329 INFO L85 PathProgramCache]: Analyzing trace with hash -532540963, now seen corresponding path program 1 times [2024-11-12 07:40:14,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:40:14,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1005846186] [2024-11-12 07:40:14,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:14,330 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-12 07:40:14,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:40:14,332 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-12 07:40:14,333 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-12 07:40:14,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:14,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 07:40:14,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:40:14,542 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-12 07:40:14,542 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:40:14,542 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:40:14,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1005846186] [2024-11-12 07:40:14,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1005846186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:40:14,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:40:14,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:40:14,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768991359] [2024-11-12 07:40:14,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:40:14,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:40:14,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:40:14,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:40:14,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:40:14,550 INFO L87 Difference]: Start difference. First operand 80 states and 114 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-12 07:40:14,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:40:14,603 INFO L93 Difference]: Finished difference Result 159 states and 228 transitions. [2024-11-12 07:40:14,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:40:14,605 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 94 [2024-11-12 07:40:14,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:40:14,606 INFO L225 Difference]: With dead ends: 159 [2024-11-12 07:40:14,606 INFO L226 Difference]: Without dead ends: 82 [2024-11-12 07:40:14,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:40:14,608 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:40:14,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 325 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:40:14,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-12 07:40:14,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-12 07:40:14,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 69 states have (on average 1.3623188405797102) internal successors, (94), 69 states have internal predecessors, (94), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-12 07:40:14,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 116 transitions. [2024-11-12 07:40:14,618 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 116 transitions. Word has length 94 [2024-11-12 07:40:14,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:40:14,619 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 116 transitions. [2024-11-12 07:40:14,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-12 07:40:14,619 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 116 transitions. [2024-11-12 07:40:14,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-12 07:40:14,620 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:14,621 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:40:14,628 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-12 07:40:14,821 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-12 07:40:14,821 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:14,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:14,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1918744357, now seen corresponding path program 1 times [2024-11-12 07:40:14,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:40:14,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [728629583] [2024-11-12 07:40:14,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:14,823 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-12 07:40:14,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:40:14,825 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-12 07:40:14,826 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-12 07:40:15,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:15,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 07:40:15,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:40:15,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-12 07:40:15,136 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 07:40:15,136 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:40:15,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:40:15,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [728629583] [2024-11-12 07:40:15,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [728629583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:40:15,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:40:15,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:40:15,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804261911] [2024-11-12 07:40:15,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:40:15,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:40:15,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:40:15,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:40:15,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:40:15,138 INFO L87 Difference]: Start difference. First operand 82 states and 116 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:40:15,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:40:15,174 INFO L93 Difference]: Finished difference Result 161 states and 229 transitions. [2024-11-12 07:40:15,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:40:15,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2024-11-12 07:40:15,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:40:15,179 INFO L225 Difference]: With dead ends: 161 [2024-11-12 07:40:15,179 INFO L226 Difference]: Without dead ends: 82 [2024-11-12 07:40:15,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 92 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-12 07:40:15,183 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:40:15,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 221 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:40:15,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-12 07:40:15,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-12 07:40:15,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 69 states have (on average 1.3478260869565217) internal successors, (93), 69 states have internal predecessors, (93), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-12 07:40:15,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 115 transitions. [2024-11-12 07:40:15,192 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 115 transitions. Word has length 94 [2024-11-12 07:40:15,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:40:15,193 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 115 transitions. [2024-11-12 07:40:15,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:40:15,193 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 115 transitions. [2024-11-12 07:40:15,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-12 07:40:15,194 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:15,194 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:40:15,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-12 07:40:15,394 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-12 07:40:15,395 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:15,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:15,396 INFO L85 PathProgramCache]: Analyzing trace with hash 787875037, now seen corresponding path program 1 times [2024-11-12 07:40:15,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:40:15,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [225463238] [2024-11-12 07:40:15,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:15,398 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-12 07:40:15,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:40:15,400 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-12 07:40:15,400 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-12 07:40:15,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:15,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 07:40:15,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:40:15,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-12 07:40:15,692 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:40:15,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2024-11-12 07:40:15,769 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 07:40:15,770 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:40:15,770 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:40:15,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [225463238] [2024-11-12 07:40:15,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [225463238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:40:15,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:40:15,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:40:15,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840791758] [2024-11-12 07:40:15,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:40:15,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:40:15,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:40:15,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:40:15,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:40:15,772 INFO L87 Difference]: Start difference. First operand 82 states and 115 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:40:16,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:40:16,242 INFO L93 Difference]: Finished difference Result 203 states and 283 transitions. [2024-11-12 07:40:16,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:40:16,243 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2024-11-12 07:40:16,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:40:16,246 INFO L225 Difference]: With dead ends: 203 [2024-11-12 07:40:16,246 INFO L226 Difference]: Without dead ends: 124 [2024-11-12 07:40:16,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:40:16,247 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 52 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 07:40:16,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 359 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 07:40:16,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-12 07:40:16,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 121. [2024-11-12 07:40:16,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 105 states have (on average 1.3523809523809525) internal successors, (142), 106 states have internal predecessors, (142), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 07:40:16,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 168 transitions. [2024-11-12 07:40:16,257 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 168 transitions. Word has length 94 [2024-11-12 07:40:16,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:40:16,257 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 168 transitions. [2024-11-12 07:40:16,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:40:16,257 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 168 transitions. [2024-11-12 07:40:16,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-12 07:40:16,258 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:16,258 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:40:16,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-12 07:40:16,462 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-12 07:40:16,463 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:16,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:16,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1840859288, now seen corresponding path program 1 times [2024-11-12 07:40:16,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:40:16,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1632712197] [2024-11-12 07:40:16,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:16,464 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-12 07:40:16,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:40:16,466 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-12 07:40:16,467 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-12 07:40:16,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:16,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 07:40:16,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:40:16,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-12 07:40:16,689 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 07:40:16,689 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:40:16,689 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:40:16,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1632712197] [2024-11-12 07:40:16,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1632712197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:40:16,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:40:16,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:40:16,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507566197] [2024-11-12 07:40:16,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:40:16,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:40:16,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:40:16,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:40:16,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:40:16,691 INFO L87 Difference]: Start difference. First operand 121 states and 168 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:40:16,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:40:16,709 INFO L93 Difference]: Finished difference Result 239 states and 333 transitions. [2024-11-12 07:40:16,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:40:16,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 96 [2024-11-12 07:40:16,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:40:16,713 INFO L225 Difference]: With dead ends: 239 [2024-11-12 07:40:16,713 INFO L226 Difference]: Without dead ends: 121 [2024-11-12 07:40:16,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 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-12 07:40:16,714 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:40:16,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 218 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:40:16,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-12 07:40:16,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-12 07:40:16,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 105 states have (on average 1.3333333333333333) internal successors, (140), 106 states have internal predecessors, (140), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 07:40:16,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 166 transitions. [2024-11-12 07:40:16,726 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 166 transitions. Word has length 96 [2024-11-12 07:40:16,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:40:16,726 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 166 transitions. [2024-11-12 07:40:16,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:40:16,726 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 166 transitions. [2024-11-12 07:40:16,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-12 07:40:16,727 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:16,727 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:40:16,735 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-12 07:40:16,928 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-12 07:40:16,928 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:16,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:16,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1447832278, now seen corresponding path program 1 times [2024-11-12 07:40:16,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:40:16,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1529701900] [2024-11-12 07:40:16,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:16,929 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-12 07:40:16,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:40:16,932 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-12 07:40:16,933 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-12 07:40:17,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:17,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-12 07:40:17,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:40:17,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-12 07:40:17,174 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:40:17,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2024-11-12 07:40:17,210 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:40:17,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 36 [2024-11-12 07:40:17,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:40:17,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 50 [2024-11-12 07:40:17,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:40:17,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 126 treesize of output 52 [2024-11-12 07:40:17,439 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 07:40:17,439 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:40:17,439 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:40:17,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1529701900] [2024-11-12 07:40:17,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1529701900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:40:17,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:40:17,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 07:40:17,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048611067] [2024-11-12 07:40:17,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:40:17,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 07:40:17,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:40:17,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 07:40:17,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:40:17,441 INFO L87 Difference]: Start difference. First operand 121 states and 166 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:40:18,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:40:18,656 INFO L93 Difference]: Finished difference Result 256 states and 348 transitions. [2024-11-12 07:40:18,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 07:40:18,656 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 96 [2024-11-12 07:40:18,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:40:18,657 INFO L225 Difference]: With dead ends: 256 [2024-11-12 07:40:18,657 INFO L226 Difference]: Without dead ends: 138 [2024-11-12 07:40:18,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-12 07:40:18,658 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 121 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-12 07:40:18,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 476 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-12 07:40:18,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-12 07:40:18,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 97. [2024-11-12 07:40:18,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 81 states have (on average 1.2962962962962963) internal successors, (105), 82 states have internal predecessors, (105), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 07:40:18,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 131 transitions. [2024-11-12 07:40:18,666 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 131 transitions. Word has length 96 [2024-11-12 07:40:18,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:40:18,666 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 131 transitions. [2024-11-12 07:40:18,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:40:18,667 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 131 transitions. [2024-11-12 07:40:18,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-12 07:40:18,668 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:18,668 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:40:18,676 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-12 07:40:18,868 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-12 07:40:18,869 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:18,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:18,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1073875101, now seen corresponding path program 1 times [2024-11-12 07:40:18,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:40:18,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1679663617] [2024-11-12 07:40:18,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:18,870 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-12 07:40:18,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:40:18,871 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-12 07:40:18,871 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-12 07:40:19,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:19,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 07:40:19,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:40:19,024 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 07:40:19,024 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:40:19,024 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:40:19,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1679663617] [2024-11-12 07:40:19,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1679663617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:40:19,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:40:19,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:40:19,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015098502] [2024-11-12 07:40:19,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:40:19,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:40:19,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:40:19,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:40:19,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:40:19,026 INFO L87 Difference]: Start difference. First operand 97 states and 131 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:40:19,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:40:19,039 INFO L93 Difference]: Finished difference Result 187 states and 254 transitions. [2024-11-12 07:40:19,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:40:19,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 96 [2024-11-12 07:40:19,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:40:19,041 INFO L225 Difference]: With dead ends: 187 [2024-11-12 07:40:19,041 INFO L226 Difference]: Without dead ends: 98 [2024-11-12 07:40:19,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 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-12 07:40:19,042 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:40:19,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 216 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:40:19,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-12 07:40:19,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-12 07:40:19,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 82 states have (on average 1.2926829268292683) internal successors, (106), 83 states have internal predecessors, (106), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 07:40:19,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 132 transitions. [2024-11-12 07:40:19,054 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 132 transitions. Word has length 96 [2024-11-12 07:40:19,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:40:19,054 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 132 transitions. [2024-11-12 07:40:19,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:40:19,055 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 132 transitions. [2024-11-12 07:40:19,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-12 07:40:19,055 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:19,056 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:40:19,065 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-12 07:40:19,256 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-12 07:40:19,257 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:19,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:19,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1660681115, now seen corresponding path program 1 times [2024-11-12 07:40:19,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:40:19,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1433442799] [2024-11-12 07:40:19,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:19,257 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-12 07:40:19,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:40:19,259 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-12 07:40:19,259 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-12 07:40:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:19,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 07:40:19,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:40:19,432 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 07:40:19,432 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:40:19,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:40:19,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1433442799] [2024-11-12 07:40:19,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1433442799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:40:19,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:40:19,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:40:19,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361759497] [2024-11-12 07:40:19,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:40:19,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:40:19,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:40:19,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:40:19,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:40:19,433 INFO L87 Difference]: Start difference. First operand 98 states and 132 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:40:19,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:40:19,697 INFO L93 Difference]: Finished difference Result 220 states and 296 transitions. [2024-11-12 07:40:19,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:40:19,698 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 96 [2024-11-12 07:40:19,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:40:19,699 INFO L225 Difference]: With dead ends: 220 [2024-11-12 07:40:19,699 INFO L226 Difference]: Without dead ends: 130 [2024-11-12 07:40:19,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:40:19,700 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 44 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:40:19,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 397 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:40:19,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-12 07:40:19,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 98. [2024-11-12 07:40:19,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 82 states have (on average 1.2804878048780488) internal successors, (105), 83 states have internal predecessors, (105), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 07:40:19,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 131 transitions. [2024-11-12 07:40:19,714 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 131 transitions. Word has length 96 [2024-11-12 07:40:19,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:40:19,716 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 131 transitions. [2024-11-12 07:40:19,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:40:19,716 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 131 transitions. [2024-11-12 07:40:19,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-12 07:40:19,717 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:19,717 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:40:19,727 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-12 07:40:19,917 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-12 07:40:19,918 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:19,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:19,919 INFO L85 PathProgramCache]: Analyzing trace with hash 299377833, now seen corresponding path program 1 times [2024-11-12 07:40:19,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:40:19,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [516835316] [2024-11-12 07:40:19,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:19,919 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-12 07:40:19,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:40:19,922 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-12 07:40:19,923 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-12 07:40:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:20,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-12 07:40:20,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:40:20,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-12 07:40:20,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-12 07:40:20,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-12 07:40:20,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-12 07:40:20,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2024-11-12 07:40:20,363 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:40:20,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 28 [2024-11-12 07:40:20,425 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:40:20,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 39 [2024-11-12 07:40:20,482 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:40:20,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 66 [2024-11-12 07:40:20,576 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:40:20,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 90 treesize of output 69 [2024-11-12 07:40:20,716 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:40:20,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 101 treesize of output 88 [2024-11-12 07:40:20,848 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:40:20,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 101 treesize of output 49 [2024-11-12 07:40:20,876 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 120 proven. 27 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-12 07:40:20,876 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:40:21,012 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 07:40:21,012 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:40:21,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [516835316] [2024-11-12 07:40:21,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [516835316] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-12 07:40:21,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 07:40:21,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-11-12 07:40:21,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507706071] [2024-11-12 07:40:21,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:40:21,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:40:21,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:40:21,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:40:21,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-12 07:40:21,014 INFO L87 Difference]: Start difference. First operand 98 states and 131 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:40:21,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:40:21,260 INFO L93 Difference]: Finished difference Result 213 states and 283 transitions. [2024-11-12 07:40:21,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:40:21,261 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 97 [2024-11-12 07:40:21,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:40:21,262 INFO L225 Difference]: With dead ends: 213 [2024-11-12 07:40:21,262 INFO L226 Difference]: Without dead ends: 123 [2024-11-12 07:40:21,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 178 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-11-12 07:40:21,263 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 34 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:40:21,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 313 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:40:21,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-12 07:40:21,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 98. [2024-11-12 07:40:21,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 82 states have (on average 1.2682926829268293) internal successors, (104), 83 states have internal predecessors, (104), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 07:40:21,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 130 transitions. [2024-11-12 07:40:21,269 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 130 transitions. Word has length 97 [2024-11-12 07:40:21,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:40:21,269 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 130 transitions. [2024-11-12 07:40:21,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:40:21,269 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 130 transitions. [2024-11-12 07:40:21,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-12 07:40:21,270 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:21,270 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:40:21,280 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-12 07:40:21,471 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-12 07:40:21,471 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:21,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:21,471 INFO L85 PathProgramCache]: Analyzing trace with hash -2015358015, now seen corresponding path program 1 times [2024-11-12 07:40:21,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:40:21,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1306996486] [2024-11-12 07:40:21,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:21,472 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-12 07:40:21,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:40:21,474 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-12 07:40:21,475 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-12 07:40:21,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:21,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-12 07:40:21,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:40:21,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-12 07:40:21,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2024-11-12 07:40:21,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:40:21,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 47 [2024-11-12 07:40:21,779 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:40:21,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 70 [2024-11-12 07:40:24,279 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:40:24,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 96 treesize of output 92 [2024-11-12 07:40:24,605 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:40:24,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 142 treesize of output 60 [2024-11-12 07:40:24,641 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 07:40:24,641 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:40:24,642 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:40:24,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1306996486] [2024-11-12 07:40:24,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1306996486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:40:24,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:40:24,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 07:40:24,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139058992] [2024-11-12 07:40:24,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:40:24,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 07:40:24,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:40:24,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 07:40:24,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=50, Unknown=1, NotChecked=0, Total=72 [2024-11-12 07:40:24,643 INFO L87 Difference]: Start difference. First operand 98 states and 130 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:40:27,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 07:40:30,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 07:40:31,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 07:40:34,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 07:40:36,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 07:40:39,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 07:40:40,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:40:40,862 INFO L93 Difference]: Finished difference Result 301 states and 395 transitions. [2024-11-12 07:40:40,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 07:40:40,865 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2024-11-12 07:40:40,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:40:40,867 INFO L225 Difference]: With dead ends: 301 [2024-11-12 07:40:40,867 INFO L226 Difference]: Without dead ends: 211 [2024-11-12 07:40:40,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=63, Invalid=146, Unknown=1, NotChecked=0, Total=210 [2024-11-12 07:40:40,867 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 236 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 28 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.9s IncrementalHoareTripleChecker+Time [2024-11-12 07:40:40,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 520 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 343 Invalid, 6 Unknown, 0 Unchecked, 15.9s Time] [2024-11-12 07:40:40,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-12 07:40:40,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 172. [2024-11-12 07:40:40,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 146 states have (on average 1.273972602739726) internal successors, (186), 148 states have internal predecessors, (186), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-12 07:40:40,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 228 transitions. [2024-11-12 07:40:40,877 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 228 transitions. Word has length 98 [2024-11-12 07:40:40,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:40:40,877 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 228 transitions. [2024-11-12 07:40:40,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:40:40,877 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 228 transitions. [2024-11-12 07:40:40,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-12 07:40:40,878 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:40,878 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:40:40,887 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 (11)] Forceful destruction successful, exit code 0 [2024-11-12 07:40:41,078 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-12 07:40:41,079 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:41,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:41,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1087608865, now seen corresponding path program 1 times [2024-11-12 07:40:41,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:40:41,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [761964562] [2024-11-12 07:40:41,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:41,080 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-12 07:40:41,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:40:41,081 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-12 07:40:41,082 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-12 07:40:41,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:41,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 07:40:41,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:40:41,262 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 07:40:41,263 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:40:41,263 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:40:41,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [761964562] [2024-11-12 07:40:41,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [761964562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:40:41,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:40:41,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:40:41,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218261358] [2024-11-12 07:40:41,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:40:41,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:40:41,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:40:41,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:40:41,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:40:41,264 INFO L87 Difference]: Start difference. First operand 172 states and 228 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:40:41,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:40:41,537 INFO L93 Difference]: Finished difference Result 439 states and 576 transitions. [2024-11-12 07:40:41,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:40:41,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-11-12 07:40:41,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:40:41,541 INFO L225 Difference]: With dead ends: 439 [2024-11-12 07:40:41,541 INFO L226 Difference]: Without dead ends: 275 [2024-11-12 07:40:41,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:40:41,542 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 55 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:40:41,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 340 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:40:41,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-12 07:40:41,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 271. [2024-11-12 07:40:41,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 233 states have (on average 1.2489270386266094) internal successors, (291), 237 states have internal predecessors, (291), 29 states have call successors, (29), 8 states have call predecessors, (29), 8 states have return successors, (29), 25 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-12 07:40:41,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 349 transitions. [2024-11-12 07:40:41,557 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 349 transitions. Word has length 99 [2024-11-12 07:40:41,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:40:41,558 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 349 transitions. [2024-11-12 07:40:41,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:40:41,558 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 349 transitions. [2024-11-12 07:40:41,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-12 07:40:41,558 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:41,559 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:40:41,566 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 (12)] Ended with exit code 0 [2024-11-12 07:40:41,759 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-12 07:40:41,759 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:41,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:41,760 INFO L85 PathProgramCache]: Analyzing trace with hash 758968289, now seen corresponding path program 1 times [2024-11-12 07:40:41,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:40:41,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1785575644] [2024-11-12 07:40:41,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:41,760 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-12 07:40:41,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:40:41,761 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-12 07:40:41,762 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-12 07:40:41,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:41,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 07:40:41,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:40:41,925 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 07:40:41,925 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:40:41,926 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:40:41,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1785575644] [2024-11-12 07:40:41,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1785575644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:40:41,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:40:41,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:40:41,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525011237] [2024-11-12 07:40:41,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:40:41,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:40:41,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:40:41,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:40:41,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:40:41,927 INFO L87 Difference]: Start difference. First operand 271 states and 349 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:40:41,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:40:41,961 INFO L93 Difference]: Finished difference Result 536 states and 690 transitions. [2024-11-12 07:40:41,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:40:41,962 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-11-12 07:40:41,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:40:41,963 INFO L225 Difference]: With dead ends: 536 [2024-11-12 07:40:41,963 INFO L226 Difference]: Without dead ends: 273 [2024-11-12 07:40:41,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:40:41,964 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:40:41,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 426 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:40:41,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-11-12 07:40:41,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 269. [2024-11-12 07:40:41,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 231 states have (on average 1.2337662337662338) internal successors, (285), 235 states have internal predecessors, (285), 29 states have call successors, (29), 8 states have call predecessors, (29), 8 states have return successors, (29), 25 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-12 07:40:41,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 343 transitions. [2024-11-12 07:40:41,979 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 343 transitions. Word has length 99 [2024-11-12 07:40:41,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:40:41,980 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 343 transitions. [2024-11-12 07:40:41,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:40:41,980 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 343 transitions. [2024-11-12 07:40:41,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-12 07:40:41,981 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:41,981 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:40:41,988 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-12 07:40:42,181 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-12 07:40:42,181 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:42,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:42,182 INFO L85 PathProgramCache]: Analyzing trace with hash -597942175, now seen corresponding path program 1 times [2024-11-12 07:40:42,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:40:42,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2076364582] [2024-11-12 07:40:42,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:42,182 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-12 07:40:42,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:40:42,185 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-12 07:40:42,186 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-12 07:40:42,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:42,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 07:40:42,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:40:42,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-12 07:40:42,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2024-11-12 07:40:42,435 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 07:40:42,435 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:40:42,435 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:40:42,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2076364582] [2024-11-12 07:40:42,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2076364582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:40:42,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:40:42,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:40:42,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188000123] [2024-11-12 07:40:42,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:40:42,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:40:42,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:40:42,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:40:42,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:40:42,437 INFO L87 Difference]: Start difference. First operand 269 states and 343 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:40:42,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:40:42,693 INFO L93 Difference]: Finished difference Result 623 states and 790 transitions. [2024-11-12 07:40:42,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 07:40:42,694 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-11-12 07:40:42,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:40:42,695 INFO L225 Difference]: With dead ends: 623 [2024-11-12 07:40:42,695 INFO L226 Difference]: Without dead ends: 362 [2024-11-12 07:40:42,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:40:42,696 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 44 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:40:42,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 579 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:40:42,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-11-12 07:40:42,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 277. [2024-11-12 07:40:42,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 239 states have (on average 1.2426778242677825) internal successors, (297), 243 states have internal predecessors, (297), 29 states have call successors, (29), 8 states have call predecessors, (29), 8 states have return successors, (29), 25 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-12 07:40:42,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 355 transitions. [2024-11-12 07:40:42,718 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 355 transitions. Word has length 99 [2024-11-12 07:40:42,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:40:42,719 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 355 transitions. [2024-11-12 07:40:42,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:40:42,719 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 355 transitions. [2024-11-12 07:40:42,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-12 07:40:42,720 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:42,720 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:40:42,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-12 07:40:42,920 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-12 07:40:42,920 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:42,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:42,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1619010529, now seen corresponding path program 1 times [2024-11-12 07:40:42,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:40:42,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [762203569] [2024-11-12 07:40:42,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:42,921 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-12 07:40:42,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:40:42,923 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-12 07:40:42,924 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-12 07:40:43,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:43,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 07:40:43,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:40:43,145 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 07:40:43,145 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:40:43,145 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:40:43,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [762203569] [2024-11-12 07:40:43,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [762203569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:40:43,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:40:43,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:40:43,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528418494] [2024-11-12 07:40:43,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:40:43,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:40:43,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:40:43,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:40:43,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:40:43,146 INFO L87 Difference]: Start difference. First operand 277 states and 355 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:40:43,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:40:43,429 INFO L93 Difference]: Finished difference Result 616 states and 780 transitions. [2024-11-12 07:40:43,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:40:43,429 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-11-12 07:40:43,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:40:43,431 INFO L225 Difference]: With dead ends: 616 [2024-11-12 07:40:43,431 INFO L226 Difference]: Without dead ends: 347 [2024-11-12 07:40:43,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:40:43,432 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 46 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:40:43,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 371 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 07:40:43,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-11-12 07:40:43,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 260. [2024-11-12 07:40:43,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 224 states have (on average 1.2321428571428572) internal successors, (276), 227 states have internal predecessors, (276), 27 states have call successors, (27), 8 states have call predecessors, (27), 8 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 07:40:43,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 330 transitions. [2024-11-12 07:40:43,455 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 330 transitions. Word has length 99 [2024-11-12 07:40:43,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:40:43,455 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 330 transitions. [2024-11-12 07:40:43,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:40:43,456 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 330 transitions. [2024-11-12 07:40:43,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-12 07:40:43,456 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:40:43,456 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:40:43,464 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 (15)] Ended with exit code 0 [2024-11-12 07:40:43,657 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-12 07:40:43,657 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:40:43,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:40:43,658 INFO L85 PathProgramCache]: Analyzing trace with hash 122883806, now seen corresponding path program 1 times [2024-11-12 07:40:43,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:40:43,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [156938534] [2024-11-12 07:40:43,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:40:43,658 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-12 07:40:43,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:40:43,660 INFO L229 MonitoredProcess]: Starting monitored process 16 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-12 07:40:43,661 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 (16)] Waiting until timeout for monitored process [2024-11-12 07:40:43,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:40:43,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-12 07:40:43,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:40:43,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 68 [2024-11-12 07:40:44,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 100 [2024-11-12 07:40:44,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-12 07:40:44,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-12 07:40:44,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-12 07:40:44,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-12 07:40:44,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2024-11-12 07:40:46,403 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:40:46,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 64 [2024-11-12 07:40:46,539 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:40:46,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 89 treesize of output 77 [2024-11-12 07:40:48,662 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:40:48,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 104 treesize of output 94 [2024-11-12 07:40:49,155 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:40:49,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 118 treesize of output 42 [2024-11-12 07:40:49,214 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 106 proven. 24 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-12 07:40:49,214 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:40:49,948 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 07:40:49,949 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:40:49,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [156938534] [2024-11-12 07:40:49,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [156938534] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-12 07:40:49,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 07:40:49,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 18 [2024-11-12 07:40:49,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573527726] [2024-11-12 07:40:49,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:40:49,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:40:49,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:40:49,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:40:49,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=232, Unknown=2, NotChecked=0, Total=306 [2024-11-12 07:40:49,951 INFO L87 Difference]: Start difference. First operand 260 states and 330 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:40:54,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 07:40:58,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 07:41:02,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 07:41:06,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 07:41:10,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 07:41:14,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 07:41:18,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 07:41:22,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 07:41:23,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:41:23,699 INFO L93 Difference]: Finished difference Result 584 states and 741 transitions. [2024-11-12 07:41:23,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:41:23,702 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-11-12 07:41:23,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:41:23,703 INFO L225 Difference]: With dead ends: 584 [2024-11-12 07:41:23,703 INFO L226 Difference]: Without dead ends: 327 [2024-11-12 07:41:23,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=77, Invalid=263, Unknown=2, NotChecked=0, Total=342 [2024-11-12 07:41:23,704 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 80 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.6s IncrementalHoareTripleChecker+Time [2024-11-12 07:41:23,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 308 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 8 Unknown, 0 Unchecked, 33.6s Time] [2024-11-12 07:41:23,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-11-12 07:41:23,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 291. [2024-11-12 07:41:23,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 255 states have (on average 1.219607843137255) internal successors, (311), 258 states have internal predecessors, (311), 27 states have call successors, (27), 8 states have call predecessors, (27), 8 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 07:41:23,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 365 transitions. [2024-11-12 07:41:23,718 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 365 transitions. Word has length 99 [2024-11-12 07:41:23,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:41:23,719 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 365 transitions. [2024-11-12 07:41:23,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:41:23,719 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 365 transitions. [2024-11-12 07:41:23,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-12 07:41:23,719 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:41:23,719 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:41:23,728 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 (16)] Forceful destruction successful, exit code 0 [2024-11-12 07:41:23,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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-12 07:41:23,920 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:41:23,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:41:23,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1750032719, now seen corresponding path program 1 times [2024-11-12 07:41:23,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:41:23,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1136664714] [2024-11-12 07:41:23,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:41:23,921 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-12 07:41:23,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:41:23,922 INFO L229 MonitoredProcess]: Starting monitored process 17 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-12 07:41:23,923 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 (17)] Waiting until timeout for monitored process [2024-11-12 07:41:24,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:24,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 07:41:24,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:41:24,128 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-12 07:41:24,128 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:41:24,128 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:41:24,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1136664714] [2024-11-12 07:41:24,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1136664714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:41:24,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:41:24,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:41:24,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485569565] [2024-11-12 07:41:24,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:41:24,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:41:24,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:41:24,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:41:24,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:41:24,130 INFO L87 Difference]: Start difference. First operand 291 states and 365 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:41:24,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:41:24,185 INFO L93 Difference]: Finished difference Result 585 states and 735 transitions. [2024-11-12 07:41:24,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:41:24,186 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 100 [2024-11-12 07:41:24,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:41:24,187 INFO L225 Difference]: With dead ends: 585 [2024-11-12 07:41:24,187 INFO L226 Difference]: Without dead ends: 297 [2024-11-12 07:41:24,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:41:24,188 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:41:24,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 522 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:41:24,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-11-12 07:41:24,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 291. [2024-11-12 07:41:24,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 255 states have (on average 1.2117647058823529) internal successors, (309), 258 states have internal predecessors, (309), 27 states have call successors, (27), 8 states have call predecessors, (27), 8 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 07:41:24,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 363 transitions. [2024-11-12 07:41:24,202 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 363 transitions. Word has length 100 [2024-11-12 07:41:24,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:41:24,203 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 363 transitions. [2024-11-12 07:41:24,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-12 07:41:24,203 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 363 transitions. [2024-11-12 07:41:24,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-12 07:41:24,203 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:41:24,204 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:41:24,214 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 (17)] Ended with exit code 0 [2024-11-12 07:41:24,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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-12 07:41:24,404 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:41:24,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:41:24,405 INFO L85 PathProgramCache]: Analyzing trace with hash 125932902, now seen corresponding path program 1 times [2024-11-12 07:41:24,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:41:24,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [296133099] [2024-11-12 07:41:24,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:41:24,405 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-12 07:41:24,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:41:24,406 INFO L229 MonitoredProcess]: Starting monitored process 18 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-12 07:41:24,407 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 (18)] Waiting until timeout for monitored process [2024-11-12 07:41:24,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:24,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-12 07:41:24,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:41:24,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 1 [2024-11-12 07:41:25,056 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:41:25,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 134 treesize of output 79 [2024-11-12 07:41:25,117 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:41:25,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 160 treesize of output 105 [2024-11-12 07:41:25,211 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:41:25,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 233 treesize of output 149 [2024-11-12 07:41:25,379 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:41:25,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 263 treesize of output 169 [2024-11-12 07:41:26,246 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:41:26,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 467 treesize of output 157 [2024-11-12 07:41:26,373 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-12 07:41:26,373 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:41:26,751 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:41:26,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [296133099] [2024-11-12 07:41:26,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [296133099] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:41:26,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1099928918] [2024-11-12 07:41:26,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:41:26,752 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 07:41:26,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 07:41:26,755 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 07:41:26,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2024-11-12 07:41:27,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:41:27,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-12 07:41:27,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:41:27,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-12 07:41:28,580 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:41:28,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 122 treesize of output 79 [2024-11-12 07:41:28,729 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:41:28,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 124 treesize of output 107