./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-46.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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-46.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 53cf1c89f0977ad1ca8f0cd80861a2586d1d5ed487af656b04baa58a1567d392 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:07:24,163 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:07:24,272 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 01:07:24,278 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:07:24,282 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:07:24,304 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:07:24,305 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:07:24,305 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:07:24,306 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:07:24,307 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:07:24,308 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:07:24,308 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:07:24,308 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:07:24,309 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:07:24,309 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:07:24,309 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:07:24,310 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:07:24,310 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:07:24,310 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 01:07:24,310 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:07:24,310 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:07:24,317 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:07:24,317 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:07:24,317 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:07:24,317 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:07:24,317 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:07:24,318 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:07:24,318 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:07:24,318 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:07:24,318 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:07:24,318 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:07:24,318 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:07:24,319 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:07:24,319 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:07:24,319 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:07:24,319 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:07:24,319 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 01:07:24,320 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 01:07:24,320 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:07:24,320 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:07:24,320 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:07:24,320 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:07:24,321 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 -> 53cf1c89f0977ad1ca8f0cd80861a2586d1d5ed487af656b04baa58a1567d392 [2024-11-19 01:07:24,585 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:07:24,610 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:07:24,614 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:07:24,615 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:07:24,616 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:07:24,617 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-46.i [2024-11-19 01:07:26,057 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:07:26,241 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:07:26,242 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-46.i [2024-11-19 01:07:26,252 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/033bc92b8/185db7fc11d94fe38c6f7bacf9bc27a0/FLAGf9d05d0fb [2024-11-19 01:07:26,268 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/033bc92b8/185db7fc11d94fe38c6f7bacf9bc27a0 [2024-11-19 01:07:26,270 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:07:26,273 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:07:26,274 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:07:26,275 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:07:26,280 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:07:26,281 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:07:26" (1/1) ... [2024-11-19 01:07:26,283 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@340dbd22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:26, skipping insertion in model container [2024-11-19 01:07:26,284 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:07:26" (1/1) ... [2024-11-19 01:07:26,309 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:07:26,459 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-46.i[916,929] [2024-11-19 01:07:26,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:07:26,590 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:07:26,599 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-46.i[916,929] [2024-11-19 01:07:26,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:07:26,650 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:07:26,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:26 WrapperNode [2024-11-19 01:07:26,651 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:07:26,652 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:07:26,652 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:07:26,652 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:07:26,661 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:26" (1/1) ... [2024-11-19 01:07:26,674 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:26" (1/1) ... [2024-11-19 01:07:26,712 INFO L138 Inliner]: procedures = 30, calls = 127, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 398 [2024-11-19 01:07:26,716 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:07:26,717 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:07:26,717 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:07:26,717 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:07:26,727 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:26" (1/1) ... [2024-11-19 01:07:26,727 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:26" (1/1) ... [2024-11-19 01:07:26,733 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:26" (1/1) ... [2024-11-19 01:07:26,740 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-19 01:07:26,744 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:26" (1/1) ... [2024-11-19 01:07:26,744 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:26" (1/1) ... [2024-11-19 01:07:26,755 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:26" (1/1) ... [2024-11-19 01:07:26,758 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:26" (1/1) ... [2024-11-19 01:07:26,760 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:26" (1/1) ... [2024-11-19 01:07:26,762 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:26" (1/1) ... [2024-11-19 01:07:26,765 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:07:26,765 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:07:26,765 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:07:26,766 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:07:26,766 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:26" (1/1) ... [2024-11-19 01:07:26,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:07:26,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:07:26,796 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-19 01:07:26,798 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-19 01:07:26,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:07:26,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-19 01:07:26,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-19 01:07:26,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-19 01:07:26,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-19 01:07:26,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-19 01:07:26,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-19 01:07:26,837 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 01:07:26,838 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 01:07:26,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 01:07:26,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:07:26,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:07:26,942 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:07:26,944 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:07:27,325 INFO L? ?]: Removed 100 outVars from TransFormulas that were not future-live. [2024-11-19 01:07:27,325 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:07:27,346 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:07:27,346 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 01:07:27,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:07:27 BoogieIcfgContainer [2024-11-19 01:07:27,347 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:07:27,355 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:07:27,355 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:07:27,362 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:07:27,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:07:26" (1/3) ... [2024-11-19 01:07:27,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33d66048 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:07:27, skipping insertion in model container [2024-11-19 01:07:27,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:26" (2/3) ... [2024-11-19 01:07:27,368 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33d66048 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:07:27, skipping insertion in model container [2024-11-19 01:07:27,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:07:27" (3/3) ... [2024-11-19 01:07:27,371 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-46.i [2024-11-19 01:07:27,397 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:07:27,397 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:07:27,487 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:07:27,499 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;@296b4acb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:07:27,502 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 01:07:27,507 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 85 states have internal predecessors, (119), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 01:07:27,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-19 01:07:27,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:07:27,529 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:07:27,530 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:07:27,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:07:27,538 INFO L85 PathProgramCache]: Analyzing trace with hash 591901101, now seen corresponding path program 1 times [2024-11-19 01:07:27,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:07:27,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772058703] [2024-11-19 01:07:27,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:07:27,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:07:28,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:07:29,807 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 01:07:29,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:07:29,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772058703] [2024-11-19 01:07:29,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772058703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:07:29,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:07:29,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 01:07:29,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168026468] [2024-11-19 01:07:29,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:07:29,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 01:07:29,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:07:29,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 01:07:29,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:07:29,841 INFO L87 Difference]: Start difference. First operand has 101 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 85 states have internal predecessors, (119), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 01:07:30,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:07:30,378 INFO L93 Difference]: Finished difference Result 352 states and 552 transitions. [2024-11-19 01:07:30,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:07:30,381 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2024-11-19 01:07:30,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:07:30,390 INFO L225 Difference]: With dead ends: 352 [2024-11-19 01:07:30,390 INFO L226 Difference]: Without dead ends: 254 [2024-11-19 01:07:30,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:07:30,396 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 248 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 01:07:30,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 340 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 01:07:30,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-19 01:07:30,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 249. [2024-11-19 01:07:30,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 216 states have (on average 1.412037037037037) internal successors, (305), 217 states have internal predecessors, (305), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-19 01:07:30,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 363 transitions. [2024-11-19 01:07:30,479 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 363 transitions. Word has length 116 [2024-11-19 01:07:30,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:07:30,483 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 363 transitions. [2024-11-19 01:07:30,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 01:07:30,483 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 363 transitions. [2024-11-19 01:07:30,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-19 01:07:30,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:07:30,487 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:07:30,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 01:07:30,490 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:07:30,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:07:30,491 INFO L85 PathProgramCache]: Analyzing trace with hash 5095087, now seen corresponding path program 1 times [2024-11-19 01:07:30,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:07:30,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423257755] [2024-11-19 01:07:30,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:07:30,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:07:30,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:07:30,915 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 01:07:30,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:07:30,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423257755] [2024-11-19 01:07:30,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423257755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:07:30,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:07:30,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:07:30,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113994266] [2024-11-19 01:07:30,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:07:30,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:07:30,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:07:30,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:07:30,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:07:30,919 INFO L87 Difference]: Start difference. First operand 249 states and 363 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 01:07:31,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:07:31,145 INFO L93 Difference]: Finished difference Result 747 states and 1092 transitions. [2024-11-19 01:07:31,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:07:31,146 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2024-11-19 01:07:31,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:07:31,150 INFO L225 Difference]: With dead ends: 747 [2024-11-19 01:07:31,150 INFO L226 Difference]: Without dead ends: 501 [2024-11-19 01:07:31,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:07:31,153 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 119 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 01:07:31,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 312 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 01:07:31,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2024-11-19 01:07:31,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 285. [2024-11-19 01:07:31,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 252 states have (on average 1.4087301587301588) internal successors, (355), 253 states have internal predecessors, (355), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-19 01:07:31,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 413 transitions. [2024-11-19 01:07:31,174 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 413 transitions. Word has length 116 [2024-11-19 01:07:31,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:07:31,175 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 413 transitions. [2024-11-19 01:07:31,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 01:07:31,175 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 413 transitions. [2024-11-19 01:07:31,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-19 01:07:31,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:07:31,177 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:07:31,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 01:07:31,177 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:07:31,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:07:31,178 INFO L85 PathProgramCache]: Analyzing trace with hash -224241624, now seen corresponding path program 1 times [2024-11-19 01:07:31,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:07:31,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997089843] [2024-11-19 01:07:31,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:07:31,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:07:31,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:07:31,357 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-19 01:07:31,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:07:31,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997089843] [2024-11-19 01:07:31,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997089843] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:07:31,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813800458] [2024-11-19 01:07:31,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:07:31,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:07:31,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:07:31,364 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-19 01:07:31,369 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-19 01:07:31,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:07:31,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 01:07:31,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:07:31,617 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 01:07:31,617 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:07:31,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813800458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:07:31,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:07:31,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2024-11-19 01:07:31,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993913891] [2024-11-19 01:07:31,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:07:31,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:07:31,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:07:31,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:07:31,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:07:31,621 INFO L87 Difference]: Start difference. First operand 285 states and 413 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 01:07:31,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:07:31,654 INFO L93 Difference]: Finished difference Result 576 states and 835 transitions. [2024-11-19 01:07:31,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:07:31,654 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-11-19 01:07:31,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:07:31,656 INFO L225 Difference]: With dead ends: 576 [2024-11-19 01:07:31,656 INFO L226 Difference]: Without dead ends: 294 [2024-11-19 01:07:31,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:07:31,657 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 531 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-19 01:07:31,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 531 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:07:31,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-19 01:07:31,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2024-11-19 01:07:31,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 261 states have (on average 1.3946360153256705) internal successors, (364), 262 states have internal predecessors, (364), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-19 01:07:31,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 422 transitions. [2024-11-19 01:07:31,671 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 422 transitions. Word has length 118 [2024-11-19 01:07:31,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:07:31,672 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 422 transitions. [2024-11-19 01:07:31,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 01:07:31,672 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 422 transitions. [2024-11-19 01:07:31,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-19 01:07:31,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:07:31,674 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:07:31,691 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-19 01:07:31,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:07:31,875 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:07:31,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:07:31,876 INFO L85 PathProgramCache]: Analyzing trace with hash 168785386, now seen corresponding path program 1 times [2024-11-19 01:07:31,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:07:31,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856290318] [2024-11-19 01:07:31,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:07:31,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:07:31,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:07:31,978 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 01:07:31,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:07:31,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856290318] [2024-11-19 01:07:31,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856290318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:07:31,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:07:31,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:07:31,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958304011] [2024-11-19 01:07:31,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:07:31,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:07:31,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:07:31,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:07:31,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:07:31,981 INFO L87 Difference]: Start difference. First operand 294 states and 422 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 01:07:32,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:07:32,189 INFO L93 Difference]: Finished difference Result 690 states and 985 transitions. [2024-11-19 01:07:32,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:07:32,190 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-11-19 01:07:32,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:07:32,192 INFO L225 Difference]: With dead ends: 690 [2024-11-19 01:07:32,192 INFO L226 Difference]: Without dead ends: 399 [2024-11-19 01:07:32,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-19 01:07:32,193 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 62 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 01:07:32,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 374 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 01:07:32,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-11-19 01:07:32,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 344. [2024-11-19 01:07:32,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 309 states have (on average 1.3915857605177993) internal successors, (430), 311 states have internal predecessors, (430), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-19 01:07:32,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 490 transitions. [2024-11-19 01:07:32,211 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 490 transitions. Word has length 118 [2024-11-19 01:07:32,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:07:32,212 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 490 transitions. [2024-11-19 01:07:32,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 01:07:32,213 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 490 transitions. [2024-11-19 01:07:32,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-19 01:07:32,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:07:32,215 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:07:32,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 01:07:32,215 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:07:32,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:07:32,217 INFO L85 PathProgramCache]: Analyzing trace with hash -872597158, now seen corresponding path program 1 times [2024-11-19 01:07:32,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:07:32,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595028617] [2024-11-19 01:07:32,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:07:32,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:07:32,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 01:07:32,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1861325125] [2024-11-19 01:07:32,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:07:32,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:07:32,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:07:32,324 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-19 01:07:32,326 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-19 01:07:32,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:07:32,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-19 01:07:32,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:07:32,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 48 [2024-11-19 01:07:32,687 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:32,688 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 67 treesize of output 63 [2024-11-19 01:07:32,811 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:32,811 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 67 treesize of output 63 [2024-11-19 01:07:33,008 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:33,009 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 67 treesize of output 63 [2024-11-19 01:07:33,141 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:33,141 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 67 treesize of output 54 [2024-11-19 01:07:33,247 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:33,247 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 58 treesize of output 42 [2024-11-19 01:07:33,350 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:33,351 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 49 treesize of output 30 [2024-11-19 01:07:33,405 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:33,405 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 40 treesize of output 27 [2024-11-19 01:07:33,653 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:33,654 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 77 treesize of output 73 [2024-11-19 01:07:33,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:33,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 82 treesize of output 36 [2024-11-19 01:07:33,902 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-19 01:07:33,902 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:07:34,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:07:34,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595028617] [2024-11-19 01:07:34,462 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 01:07:34,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861325125] [2024-11-19 01:07:34,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861325125] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:07:34,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:07:34,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2024-11-19 01:07:34,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484017957] [2024-11-19 01:07:34,463 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-19 01:07:34,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 01:07:34,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:07:34,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 01:07:34,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=319, Unknown=2, NotChecked=0, Total=420 [2024-11-19 01:07:34,466 INFO L87 Difference]: Start difference. First operand 344 states and 490 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 4 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-19 01:07:35,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:07:35,898 INFO L93 Difference]: Finished difference Result 1001 states and 1409 transitions. [2024-11-19 01:07:35,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 01:07:35,898 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 4 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 118 [2024-11-19 01:07:35,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:07:35,901 INFO L225 Difference]: With dead ends: 1001 [2024-11-19 01:07:35,901 INFO L226 Difference]: Without dead ends: 660 [2024-11-19 01:07:35,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=347, Unknown=2, NotChecked=0, Total=462 [2024-11-19 01:07:35,902 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 274 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 1100 mSolverCounterSat, 25 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1100 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 01:07:35,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 846 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1100 Invalid, 11 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 01:07:35,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2024-11-19 01:07:35,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 527. [2024-11-19 01:07:35,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 462 states have (on average 1.3722943722943723) internal successors, (634), 465 states have internal predecessors, (634), 54 states have call successors, (54), 10 states have call predecessors, (54), 10 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-19 01:07:35,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 742 transitions. [2024-11-19 01:07:35,927 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 742 transitions. Word has length 118 [2024-11-19 01:07:35,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:07:35,928 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 742 transitions. [2024-11-19 01:07:35,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 4 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-19 01:07:35,928 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 742 transitions. [2024-11-19 01:07:35,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-19 01:07:35,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:07:35,929 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:07:35,949 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-19 01:07:36,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:07:36,131 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:07:36,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:07:36,132 INFO L85 PathProgramCache]: Analyzing trace with hash 2142506460, now seen corresponding path program 1 times [2024-11-19 01:07:36,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:07:36,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878941979] [2024-11-19 01:07:36,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:07:36,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:07:36,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:07:36,860 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 01:07:36,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:07:36,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878941979] [2024-11-19 01:07:36,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878941979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:07:36,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:07:36,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 01:07:36,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240542161] [2024-11-19 01:07:36,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:07:36,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 01:07:36,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:07:36,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 01:07:36,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:07:36,862 INFO L87 Difference]: Start difference. First operand 527 states and 742 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 01:07:37,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:07:37,261 INFO L93 Difference]: Finished difference Result 1125 states and 1586 transitions. [2024-11-19 01:07:37,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 01:07:37,262 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-11-19 01:07:37,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:07:37,264 INFO L225 Difference]: With dead ends: 1125 [2024-11-19 01:07:37,264 INFO L226 Difference]: Without dead ends: 641 [2024-11-19 01:07:37,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-19 01:07:37,266 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 233 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 01:07:37,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 439 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 01:07:37,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2024-11-19 01:07:37,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 533. [2024-11-19 01:07:37,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 468 states have (on average 1.3653846153846154) internal successors, (639), 471 states have internal predecessors, (639), 54 states have call successors, (54), 10 states have call predecessors, (54), 10 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-19 01:07:37,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 747 transitions. [2024-11-19 01:07:37,285 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 747 transitions. Word has length 118 [2024-11-19 01:07:37,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:07:37,286 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 747 transitions. [2024-11-19 01:07:37,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 01:07:37,286 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 747 transitions. [2024-11-19 01:07:37,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-19 01:07:37,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:07:37,287 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:07:37,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 01:07:37,287 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:07:37,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:07:37,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1859048456, now seen corresponding path program 1 times [2024-11-19 01:07:37,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:07:37,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18189582] [2024-11-19 01:07:37,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:07:37,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:07:37,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 01:07:37,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1829353456] [2024-11-19 01:07:37,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:07:37,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:07:37,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:07:37,359 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:07:37,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 01:07:38,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:07:38,460 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 01:07:39,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:07:39,162 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 01:07:39,166 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 01:07:39,167 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 01:07:39,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 01:07:39,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:07:39,376 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:07:39,431 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 01:07:39,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 01:07:39 BoogieIcfgContainer [2024-11-19 01:07:39,437 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 01:07:39,438 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 01:07:39,438 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 01:07:39,438 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 01:07:39,438 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:07:27" (3/4) ... [2024-11-19 01:07:39,445 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 01:07:39,446 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 01:07:39,447 INFO L158 Benchmark]: Toolchain (without parser) took 13174.11ms. Allocated memory was 167.8MB in the beginning and 419.4MB in the end (delta: 251.7MB). Free memory was 99.1MB in the beginning and 346.7MB in the end (delta: -247.7MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2024-11-19 01:07:39,450 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 73.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:07:39,450 INFO L158 Benchmark]: CACSL2BoogieTranslator took 376.53ms. Allocated memory is still 167.8MB. Free memory was 98.9MB in the beginning and 135.7MB in the end (delta: -36.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 01:07:39,451 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.69ms. Allocated memory is still 167.8MB. Free memory was 135.7MB in the beginning and 132.1MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 01:07:39,451 INFO L158 Benchmark]: Boogie Preprocessor took 48.00ms. Allocated memory is still 167.8MB. Free memory was 132.1MB in the beginning and 128.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 01:07:39,451 INFO L158 Benchmark]: RCFGBuilder took 581.40ms. Allocated memory is still 167.8MB. Free memory was 128.9MB in the beginning and 97.9MB in the end (delta: 31.0MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-19 01:07:39,451 INFO L158 Benchmark]: TraceAbstraction took 12082.41ms. Allocated memory was 167.8MB in the beginning and 419.4MB in the end (delta: 251.7MB). Free memory was 97.5MB in the beginning and 347.8MB in the end (delta: -250.3MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. [2024-11-19 01:07:39,452 INFO L158 Benchmark]: Witness Printer took 8.45ms. Allocated memory is still 419.4MB. Free memory was 347.8MB in the beginning and 346.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:07:39,453 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.16ms. Allocated memory is still 109.1MB. Free memory is still 73.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 376.53ms. Allocated memory is still 167.8MB. Free memory was 98.9MB in the beginning and 135.7MB in the end (delta: -36.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.69ms. Allocated memory is still 167.8MB. Free memory was 135.7MB in the beginning and 132.1MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.00ms. Allocated memory is still 167.8MB. Free memory was 132.1MB in the beginning and 128.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 581.40ms. Allocated memory is still 167.8MB. Free memory was 128.9MB in the beginning and 97.9MB in the end (delta: 31.0MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 12082.41ms. Allocated memory was 167.8MB in the beginning and 419.4MB in the end (delta: 251.7MB). Free memory was 97.5MB in the beginning and 347.8MB in the end (delta: -250.3MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. * Witness Printer took 8.45ms. Allocated memory is still 419.4MB. Free memory was 347.8MB in the beginning and 346.7MB in the end (delta: 1.0MB). 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 116. Possible FailurePath: [L35] unsigned char isInitial = 0; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { 1, 31.75, -8, 0, 0, 1, 1, -4, 32, -25, 4 }; [L49] unsigned char last_1_WrapperStruct00_var_1_1 = 1; [L50] signed short int last_1_WrapperStruct00_var_1_10 = -4; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L120] isInitial = 1 [L121] FCALL initially() [L122] COND TRUE 1 [L123] CALL updateLastVariables() [L112] EXPR WrapperStruct00.var_1_1 [L112] last_1_WrapperStruct00_var_1_1 = WrapperStruct00.var_1_1 [L113] EXPR WrapperStruct00.var_1_10 [L113] last_1_WrapperStruct00_var_1_10 = WrapperStruct00.var_1_10 [L123] RET updateLastVariables() [L124] CALL updateVariables() [L89] WrapperStruct00.var_1_2 = __VERIFIER_nondet_double() [L90] EXPR WrapperStruct00.var_1_2 [L90] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F [L90] EXPR WrapperStruct00.var_1_2 [L90] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L90] EXPR (WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L90] CALL assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L90] RET assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L91] WrapperStruct00.var_1_4 = __VERIFIER_nondet_char() [L92] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= -128) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= -128) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L93] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L94] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_4 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_4 != 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L95] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L96] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L97] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L98] WrapperStruct00.var_1_7 = __VERIFIER_nondet_uchar() [L99] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L100] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L101] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L102] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L103] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L104] WrapperStruct00.var_1_12 = __VERIFIER_nondet_short() [L105] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= -1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= -1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L106] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L107] WrapperStruct00.var_1_16 = __VERIFIER_nondet_char() [L108] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L109] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L124] RET updateVariables() [L125] CALL step() [L54] EXPR WrapperStruct00.var_1_12 [L54] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L54] COND FALSE !(last_1_WrapperStruct00_var_1_10 <= (WrapperStruct00.var_1_12 / WrapperStruct00.var_1_4)) [L59] EXPR WrapperStruct00.var_1_4 [L59] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L59] EXPR ((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_13) [L59] EXPR WrapperStruct00.var_1_4 [L59] EXPR ((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_13) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L59] signed long int stepLocal_1 = (((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_13)); [L60] EXPR WrapperStruct00.var_1_13 [L60] EXPR WrapperStruct00.var_1_4 [L60] signed long int stepLocal_0 = WrapperStruct00.var_1_13 / WrapperStruct00.var_1_4; [L61] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1, stepLocal_0=0, stepLocal_1=-26] [L61] COND TRUE (- WrapperStruct00.var_1_2) >= 16.75 [L62] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1, stepLocal_0=0, stepLocal_1=-26] [L62] COND TRUE stepLocal_0 >= WrapperStruct00.var_1_13 [L63] COND TRUE stepLocal_1 > -32 [L64] WrapperStruct00.var_1_1 = 0 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L78] EXPR WrapperStruct00.var_1_13 [L78] signed char stepLocal_2 = WrapperStruct00.var_1_13; [L79] EXPR WrapperStruct00.var_1_13 [L79] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1, stepLocal_2=-25] [L79] EXPR WrapperStruct00.var_1_13 | WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1, stepLocal_2=-25] [L79] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1, stepLocal_2=-25] [L79] COND TRUE ((WrapperStruct00.var_1_13 | WrapperStruct00.var_1_13) + WrapperStruct00.var_1_4) < stepLocal_2 [L80] EXPR WrapperStruct00.var_1_12 [L80] WrapperStruct00.var_1_10 = (WrapperStruct00.var_1_12 - 256) [L84] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L84] COND FALSE !(1 == WrapperStruct00.var_1_4) [L125] RET step() [L126] CALL, EXPR property() [L116] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L116] EXPR ((- WrapperStruct00.var_1_2) >= 16.75) ? (((WrapperStruct00.var_1_13 / WrapperStruct00.var_1_4) >= WrapperStruct00.var_1_13) ? ((((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_13))) > -32) ? (WrapperStruct00.var_1_1 == ((unsigned char) 0)) : (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 || WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_1 == ((unsigned char) 1)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_1 == ((unsigned char) 1)) [L116] EXPR WrapperStruct00.var_1_1 [L116] EXPR ((- WrapperStruct00.var_1_2) >= 16.75) ? (((WrapperStruct00.var_1_13 / WrapperStruct00.var_1_4) >= WrapperStruct00.var_1_13) ? ((((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_13))) > -32) ? (WrapperStruct00.var_1_1 == ((unsigned char) 0)) : (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 || WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_1 == ((unsigned char) 1)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_1 == ((unsigned char) 1)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L116] EXPR (((- WrapperStruct00.var_1_2) >= 16.75) ? (((WrapperStruct00.var_1_13 / WrapperStruct00.var_1_4) >= WrapperStruct00.var_1_13) ? ((((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_13))) > -32) ? (WrapperStruct00.var_1_1 == ((unsigned char) 0)) : (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 || WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_1 == ((unsigned char) 1)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_1 == ((unsigned char) 1))) && ((1 == WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_9)) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L116] EXPR ((((- WrapperStruct00.var_1_2) >= 16.75) ? (((WrapperStruct00.var_1_13 / WrapperStruct00.var_1_4) >= WrapperStruct00.var_1_13) ? ((((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_13))) > -32) ? (WrapperStruct00.var_1_1 == ((unsigned char) 0)) : (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 || WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_1 == ((unsigned char) 1)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_1 == ((unsigned char) 1))) && ((1 == WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_9)) : 1)) && ((((WrapperStruct00.var_1_13 | WrapperStruct00.var_1_13) + WrapperStruct00.var_1_4) < WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_10 == ((signed short int) (WrapperStruct00.var_1_12 - 256))) : (WrapperStruct00.var_1_10 == ((signed short int) 128))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L116] EXPR (((((- WrapperStruct00.var_1_2) >= 16.75) ? (((WrapperStruct00.var_1_13 / WrapperStruct00.var_1_4) >= WrapperStruct00.var_1_13) ? ((((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_13))) > -32) ? (WrapperStruct00.var_1_1 == ((unsigned char) 0)) : (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 || WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_1 == ((unsigned char) 1)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_1 == ((unsigned char) 1))) && ((1 == WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_9)) : 1)) && ((((WrapperStruct00.var_1_13 | WrapperStruct00.var_1_13) + WrapperStruct00.var_1_4) < WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_10 == ((signed short int) (WrapperStruct00.var_1_12 - 256))) : (WrapperStruct00.var_1_10 == ((signed short int) 128)))) && ((last_1_WrapperStruct00_var_1_10 <= (WrapperStruct00.var_1_12 / WrapperStruct00.var_1_4)) ? (last_1_WrapperStruct00_var_1_1 ? (WrapperStruct00.var_1_13 == ((signed char) WrapperStruct00.var_1_16)) : 1) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L116-L117] return (((((- WrapperStruct00.var_1_2) >= 16.75) ? (((WrapperStruct00.var_1_13 / WrapperStruct00.var_1_4) >= WrapperStruct00.var_1_13) ? ((((((WrapperStruct00.var_1_4) < (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_13))) > -32) ? (WrapperStruct00.var_1_1 == ((unsigned char) 0)) : (WrapperStruct00.var_1_1 == ((unsigned char) (WrapperStruct00.var_1_6 || WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_6 ? (WrapperStruct00.var_1_1 == ((unsigned char) 1)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_7)))) : (WrapperStruct00.var_1_1 == ((unsigned char) 1))) && ((1 == WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_8 == ((unsigned char) WrapperStruct00.var_1_9)) : 1)) && ((((WrapperStruct00.var_1_13 | WrapperStruct00.var_1_13) + WrapperStruct00.var_1_4) < WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_10 == ((signed short int) (WrapperStruct00.var_1_12 - 256))) : (WrapperStruct00.var_1_10 == ((signed short int) 128)))) && ((last_1_WrapperStruct00_var_1_10 <= (WrapperStruct00.var_1_12 / WrapperStruct00.var_1_4)) ? (last_1_WrapperStruct00_var_1_1 ? (WrapperStruct00.var_1_13 == ((signed char) WrapperStruct00.var_1_16)) : 1) : 1) ; [L126] RET, EXPR property() [L126] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.9s, OverallIterations: 7, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 11 mSolverCounterUnknown, 936 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 936 mSDsluCounter, 2842 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2225 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2390 IncrementalHoareTripleChecker+Invalid, 2491 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 617 mSDtfsCounter, 2390 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 401 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=533occurred in iteration=6, InterpolantAutomatonStates: 42, 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, 6 MinimizatonAttempts, 517 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 1176 NumberOfCodeBlocks, 1176 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 815 ConstructedInterpolants, 1 QuantifiedInterpolants, 5849 SizeOfPredicates, 3 NumberOfNonLiveVariables, 833 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 7 InterpolantComputations, 5 PerfectInterpolantSequences, 2249/2548 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-19 01:07:39,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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-46.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 53cf1c89f0977ad1ca8f0cd80861a2586d1d5ed487af656b04baa58a1567d392 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:07:41,745 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:07:41,808 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 01:07:41,814 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:07:41,814 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:07:41,842 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:07:41,843 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:07:41,843 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:07:41,844 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:07:41,844 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:07:41,844 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:07:41,844 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:07:41,848 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:07:41,849 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:07:41,849 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:07:41,849 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:07:41,849 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:07:41,850 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:07:41,850 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:07:41,850 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:07:41,850 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:07:41,853 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:07:41,853 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:07:41,854 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 01:07:41,854 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 01:07:41,854 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:07:41,854 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 01:07:41,854 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:07:41,855 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:07:41,855 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:07:41,855 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:07:41,855 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:07:41,856 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:07:41,856 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:07:41,863 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:07:41,863 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:07:41,863 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:07:41,863 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:07:41,863 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 01:07:41,863 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 01:07:41,863 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:07:41,864 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:07:41,864 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:07:41,865 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:07:41,865 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 -> 53cf1c89f0977ad1ca8f0cd80861a2586d1d5ed487af656b04baa58a1567d392 [2024-11-19 01:07:42,116 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:07:42,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:07:42,149 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:07:42,150 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:07:42,153 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:07:42,154 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-46.i [2024-11-19 01:07:43,517 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:07:43,693 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:07:43,694 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-46.i [2024-11-19 01:07:43,700 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97b8c46dc/b359e97c8d264433aa7fdaeedd435d9d/FLAGe5eff84fa [2024-11-19 01:07:44,084 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97b8c46dc/b359e97c8d264433aa7fdaeedd435d9d [2024-11-19 01:07:44,087 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:07:44,088 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:07:44,093 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:07:44,093 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:07:44,097 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:07:44,101 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:07:44" (1/1) ... [2024-11-19 01:07:44,102 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@293be2f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:44, skipping insertion in model container [2024-11-19 01:07:44,102 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:07:44" (1/1) ... [2024-11-19 01:07:44,149 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:07:44,370 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-46.i[916,929] [2024-11-19 01:07:44,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:07:44,440 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:07:44,451 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-46.i[916,929] [2024-11-19 01:07:44,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:07:44,517 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:07:44,518 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:44 WrapperNode [2024-11-19 01:07:44,518 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:07:44,519 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:07:44,519 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:07:44,519 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:07:44,524 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:44" (1/1) ... [2024-11-19 01:07:44,541 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:44" (1/1) ... [2024-11-19 01:07:44,575 INFO L138 Inliner]: procedures = 34, calls = 127, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 376 [2024-11-19 01:07:44,576 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:07:44,576 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:07:44,578 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:07:44,578 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:07:44,585 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:44" (1/1) ... [2024-11-19 01:07:44,585 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:44" (1/1) ... [2024-11-19 01:07:44,593 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:44" (1/1) ... [2024-11-19 01:07:44,603 INFO L175 MemorySlicer]: Split 102 memory accesses to 2 slices as follows [2, 100]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 28 writes are split as follows [0, 28]. [2024-11-19 01:07:44,603 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:44" (1/1) ... [2024-11-19 01:07:44,603 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:44" (1/1) ... [2024-11-19 01:07:44,613 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:44" (1/1) ... [2024-11-19 01:07:44,615 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:44" (1/1) ... [2024-11-19 01:07:44,617 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:44" (1/1) ... [2024-11-19 01:07:44,618 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:44" (1/1) ... [2024-11-19 01:07:44,621 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:07:44,622 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:07:44,622 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:07:44,622 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:07:44,623 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:44" (1/1) ... [2024-11-19 01:07:44,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:07:44,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:07:44,651 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-19 01:07:44,661 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-19 01:07:44,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:07:44,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-19 01:07:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-19 01:07:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-19 01:07:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-19 01:07:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-19 01:07:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-19 01:07:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 01:07:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 01:07:44,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 01:07:44,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 01:07:44,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-19 01:07:44,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-19 01:07:44,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-19 01:07:44,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-19 01:07:44,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-19 01:07:44,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-19 01:07:44,754 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 01:07:44,754 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 01:07:44,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:07:44,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:07:44,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-19 01:07:44,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-19 01:07:44,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-19 01:07:44,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-19 01:07:44,873 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:07:44,875 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:07:45,651 INFO L? ?]: Removed 90 outVars from TransFormulas that were not future-live. [2024-11-19 01:07:45,652 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:07:45,662 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:07:45,662 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 01:07:45,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:07:45 BoogieIcfgContainer [2024-11-19 01:07:45,662 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:07:45,664 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:07:45,664 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:07:45,666 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:07:45,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:07:44" (1/3) ... [2024-11-19 01:07:45,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c6feec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:07:45, skipping insertion in model container [2024-11-19 01:07:45,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:44" (2/3) ... [2024-11-19 01:07:45,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c6feec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:07:45, skipping insertion in model container [2024-11-19 01:07:45,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:07:45" (3/3) ... [2024-11-19 01:07:45,668 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-46.i [2024-11-19 01:07:45,681 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:07:45,681 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:07:45,729 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:07:45,734 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;@64fab319, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:07:45,735 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 01:07:45,738 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 76 states have (on average 1.4078947368421053) internal successors, (107), 77 states have internal predecessors, (107), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 01:07:45,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-19 01:07:45,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:07:45,749 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:07:45,749 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:07:45,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:07:45,754 INFO L85 PathProgramCache]: Analyzing trace with hash -644425847, now seen corresponding path program 1 times [2024-11-19 01:07:45,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:07:45,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1620978032] [2024-11-19 01:07:45,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:07:45,768 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-19 01:07:45,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:07:45,774 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-19 01:07:45,775 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-19 01:07:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:07:45,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 01:07:46,006 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:07:46,031 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2024-11-19 01:07:46,031 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:07:46,031 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:07:46,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1620978032] [2024-11-19 01:07:46,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1620978032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:07:46,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:07:46,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 01:07:46,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917114111] [2024-11-19 01:07:46,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:07:46,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 01:07:46,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:07:46,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 01:07:46,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:07:46,056 INFO L87 Difference]: Start difference. First operand has 93 states, 76 states have (on average 1.4078947368421053) internal successors, (107), 77 states have internal predecessors, (107), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 01:07:46,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:07:46,082 INFO L93 Difference]: Finished difference Result 179 states and 278 transitions. [2024-11-19 01:07:46,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 01:07:46,084 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2024-11-19 01:07:46,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:07:46,089 INFO L225 Difference]: With dead ends: 179 [2024-11-19 01:07:46,089 INFO L226 Difference]: Without dead ends: 89 [2024-11-19 01:07:46,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 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-19 01:07:46,093 INFO L432 NwaCegarLoop]: 128 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, 128 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-19 01:07:46,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:07:46,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-19 01:07:46,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-19 01:07:46,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 73 states have (on average 1.36986301369863) internal successors, (100), 73 states have internal predecessors, (100), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 01:07:46,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 128 transitions. [2024-11-19 01:07:46,124 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 128 transitions. Word has length 114 [2024-11-19 01:07:46,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:07:46,125 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 128 transitions. [2024-11-19 01:07:46,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 01:07:46,125 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 128 transitions. [2024-11-19 01:07:46,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-19 01:07:46,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:07:46,127 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:07:46,136 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-19 01:07:46,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-19 01:07:46,329 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:07:46,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:07:46,333 INFO L85 PathProgramCache]: Analyzing trace with hash -658063507, now seen corresponding path program 1 times [2024-11-19 01:07:46,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:07:46,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1860751169] [2024-11-19 01:07:46,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:07:46,334 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-19 01:07:46,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:07:46,338 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-19 01:07:46,339 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-19 01:07:46,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:07:46,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-19 01:07:46,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:07:46,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:07:46,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:07:46,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:07:46,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 31 [2024-11-19 01:07:46,937 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:46,937 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 56 treesize of output 50 [2024-11-19 01:07:48,960 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:48,960 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 55 treesize of output 63 [2024-11-19 01:07:49,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:49,316 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 65 treesize of output 67 [2024-11-19 01:07:49,546 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:49,547 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 65 treesize of output 76 [2024-11-19 01:07:49,808 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:49,809 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 80 treesize of output 79 [2024-11-19 01:07:50,115 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:50,115 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 80 treesize of output 79 [2024-11-19 01:07:50,384 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:50,384 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 75 treesize of output 89 [2024-11-19 01:07:50,945 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:50,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 105 treesize of output 99 [2024-11-19 01:07:51,020 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:51,021 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 130 treesize of output 52 [2024-11-19 01:07:51,067 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 124 proven. 160 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-19 01:07:51,067 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:07:51,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:07:51,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1860751169] [2024-11-19 01:07:51,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1860751169] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:07:51,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [433298024] [2024-11-19 01:07:51,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:07:51,587 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 01:07:51,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 01:07:51,605 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 01:07:51,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-19 01:07:52,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:07:52,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-19 01:07:52,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:07:52,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:07:52,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:07:52,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:07:52,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:07:52,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:07:52,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:07:52,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:07:52,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:07:52,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:07:52,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:07:52,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 46 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 41 [2024-11-19 01:07:52,455 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:52,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 63 treesize of output 56 [2024-11-19 01:07:52,662 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:52,662 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 56 treesize of output 56 [2024-11-19 01:07:52,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:52,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 49 [2024-11-19 01:07:53,069 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:53,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 53 [2024-11-19 01:07:53,259 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:53,259 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 56 treesize of output 56 [2024-11-19 01:07:53,424 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:53,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 49 [2024-11-19 01:07:53,624 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:53,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 46 [2024-11-19 01:07:54,023 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:54,023 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 63 treesize of output 59 [2024-11-19 01:07:54,109 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:54,109 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 63 treesize of output 59 [2024-11-19 01:07:54,182 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:54,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 28 [2024-11-19 01:07:54,239 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 32 proven. 272 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-19 01:07:54,239 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:07:54,678 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 01:07:54,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [433298024] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 01:07:54,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-19 01:07:54,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 9] total 24 [2024-11-19 01:07:54,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279136120] [2024-11-19 01:07:54,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:07:54,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 01:07:54,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:07:54,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 01:07:54,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=649, Unknown=1, NotChecked=0, Total=812 [2024-11-19 01:07:54,681 INFO L87 Difference]: Start difference. First operand 89 states and 128 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 01:07:55,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:07:55,458 INFO L93 Difference]: Finished difference Result 316 states and 456 transitions. [2024-11-19 01:07:55,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:07:55,458 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2024-11-19 01:07:55,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:07:55,462 INFO L225 Difference]: With dead ends: 316 [2024-11-19 01:07:55,462 INFO L226 Difference]: Without dead ends: 230 [2024-11-19 01:07:55,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 412 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=189, Invalid=802, Unknown=1, NotChecked=0, Total=992 [2024-11-19 01:07:55,463 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 358 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 01:07:55,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 289 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 01:07:55,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-19 01:07:55,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 225. [2024-11-19 01:07:55,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 192 states have (on average 1.4010416666666667) internal successors, (269), 193 states have internal predecessors, (269), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-19 01:07:55,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 327 transitions. [2024-11-19 01:07:55,484 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 327 transitions. Word has length 114 [2024-11-19 01:07:55,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:07:55,484 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 327 transitions. [2024-11-19 01:07:55,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 01:07:55,485 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 327 transitions. [2024-11-19 01:07:55,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-19 01:07:55,486 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:07:55,486 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:07:55,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2024-11-19 01:07:55,695 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-19 01:07:55,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-19 01:07:55,888 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:07:55,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:07:55,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1244869521, now seen corresponding path program 1 times [2024-11-19 01:07:55,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:07:55,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1213793009] [2024-11-19 01:07:55,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:07:55,889 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-19 01:07:55,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:07:55,891 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-19 01:07:55,893 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-19 01:07:56,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:07:56,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 01:07:56,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:07:56,092 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 12 treesize of output 8 [2024-11-19 01:07:56,104 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 28 treesize of output 12 [2024-11-19 01:07:56,131 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 37 treesize of output 25 [2024-11-19 01:07:56,142 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 01:07:56,143 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:07:56,143 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:07:56,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1213793009] [2024-11-19 01:07:56,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1213793009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:07:56,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:07:56,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:07:56,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554786651] [2024-11-19 01:07:56,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:07:56,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:07:56,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:07:56,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:07:56,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:07:56,146 INFO L87 Difference]: Start difference. First operand 225 states and 327 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 01:07:56,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:07:56,510 INFO L93 Difference]: Finished difference Result 675 states and 984 transitions. [2024-11-19 01:07:56,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:07:56,510 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2024-11-19 01:07:56,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:07:56,514 INFO L225 Difference]: With dead ends: 675 [2024-11-19 01:07:56,514 INFO L226 Difference]: Without dead ends: 453 [2024-11-19 01:07:56,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 110 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-19 01:07:56,516 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 109 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 01:07:56,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 330 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 01:07:56,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2024-11-19 01:07:56,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 249. [2024-11-19 01:07:56,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 216 states have (on average 1.3935185185185186) internal successors, (301), 217 states have internal predecessors, (301), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-19 01:07:56,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 359 transitions. [2024-11-19 01:07:56,553 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 359 transitions. Word has length 114 [2024-11-19 01:07:56,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:07:56,554 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 359 transitions. [2024-11-19 01:07:56,554 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 01:07:56,554 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 359 transitions. [2024-11-19 01:07:56,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-19 01:07:56,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:07:56,556 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:07:56,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-19 01:07:56,756 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-19 01:07:56,757 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:07:56,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:07:56,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1121762470, now seen corresponding path program 1 times [2024-11-19 01:07:56,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:07:56,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [404631810] [2024-11-19 01:07:56,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:07:56,758 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-19 01:07:56,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:07:56,760 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-19 01:07:56,761 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-19 01:07:56,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:07:56,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-19 01:07:56,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:07:56,988 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-19 01:07:56,996 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 14 treesize of output 10 [2024-11-19 01:07:57,052 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 30 treesize of output 14 [2024-11-19 01:07:57,084 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 25 treesize of output 24 [2024-11-19 01:07:57,158 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:57,158 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 35 treesize of output 37 [2024-11-19 01:07:57,272 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:57,273 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 50 treesize of output 40 [2024-11-19 01:07:57,405 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:57,405 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 50 treesize of output 40 [2024-11-19 01:07:57,672 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:57,672 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 104 treesize of output 85 [2024-11-19 01:07:57,753 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:57,754 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 119 treesize of output 88 [2024-11-19 01:07:57,826 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:07:57,826 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 151 treesize of output 51 [2024-11-19 01:07:57,858 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-19 01:07:57,858 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:07:57,859 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:07:57,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [404631810] [2024-11-19 01:07:57,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [404631810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:07:57,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:07:57,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 01:07:57,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174981677] [2024-11-19 01:07:57,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:07:57,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 01:07:57,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:07:57,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 01:07:57,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:07:57,861 INFO L87 Difference]: Start difference. First operand 249 states and 359 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 4 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-19 01:07:59,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:07:59,768 INFO L93 Difference]: Finished difference Result 709 states and 1021 transitions. [2024-11-19 01:07:59,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 01:07:59,769 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 4 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 116 [2024-11-19 01:07:59,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:07:59,772 INFO L225 Difference]: With dead ends: 709 [2024-11-19 01:07:59,772 INFO L226 Difference]: Without dead ends: 463 [2024-11-19 01:07:59,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-19 01:07:59,778 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 248 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-19 01:07:59,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 401 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-19 01:07:59,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-11-19 01:07:59,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 249. [2024-11-19 01:07:59,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 216 states have (on average 1.3796296296296295) internal successors, (298), 217 states have internal predecessors, (298), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-19 01:07:59,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 356 transitions. [2024-11-19 01:07:59,800 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 356 transitions. Word has length 116 [2024-11-19 01:07:59,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:07:59,800 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 356 transitions. [2024-11-19 01:07:59,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 4 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-19 01:07:59,800 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 356 transitions. [2024-11-19 01:07:59,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-19 01:07:59,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:07:59,802 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:07:59,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-19 01:08:00,002 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-19 01:08:00,003 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:08:00,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:08:00,004 INFO L85 PathProgramCache]: Analyzing trace with hash 703265738, now seen corresponding path program 1 times [2024-11-19 01:08:00,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:08:00,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [577465568] [2024-11-19 01:08:00,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:08:00,005 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-19 01:08:00,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:08:00,007 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-19 01:08:00,008 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-19 01:08:00,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:08:00,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 01:08:00,161 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:08:00,184 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 23 treesize of output 11 [2024-11-19 01:08:00,273 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 01:08:00,273 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:08:00,274 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:08:00,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [577465568] [2024-11-19 01:08:00,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [577465568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:08:00,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:08:00,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:08:00,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662998414] [2024-11-19 01:08:00,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:08:00,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:08:00,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:08:00,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:08:00,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:08:00,275 INFO L87 Difference]: Start difference. First operand 249 states and 356 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 01:08:02,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:08:02,063 INFO L93 Difference]: Finished difference Result 589 states and 836 transitions. [2024-11-19 01:08:02,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:08:02,063 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2024-11-19 01:08:02,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:08:02,065 INFO L225 Difference]: With dead ends: 589 [2024-11-19 01:08:02,065 INFO L226 Difference]: Without dead ends: 343 [2024-11-19 01:08:02,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:08:02,066 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 56 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-19 01:08:02,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 332 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-19 01:08:02,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-11-19 01:08:02,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 294. [2024-11-19 01:08:02,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 259 states have (on average 1.3745173745173744) internal successors, (356), 261 states have internal predecessors, (356), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-19 01:08:02,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 416 transitions. [2024-11-19 01:08:02,082 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 416 transitions. Word has length 116 [2024-11-19 01:08:02,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:08:02,082 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 416 transitions. [2024-11-19 01:08:02,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 01:08:02,082 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 416 transitions. [2024-11-19 01:08:02,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-19 01:08:02,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:08:02,084 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:08:02,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-19 01:08:02,284 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-19 01:08:02,284 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:08:02,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:08:02,286 INFO L85 PathProgramCache]: Analyzing trace with hash 310238728, now seen corresponding path program 1 times [2024-11-19 01:08:02,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:08:02,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1497057494] [2024-11-19 01:08:02,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:08:02,286 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-19 01:08:02,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:08:02,291 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-19 01:08:02,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-19 01:08:02,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:08:02,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 01:08:02,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:08:02,511 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 01:08:02,512 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:08:02,512 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:08:02,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1497057494] [2024-11-19 01:08:02,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1497057494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:08:02,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:08:02,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:08:02,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919084633] [2024-11-19 01:08:02,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:08:02,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:08:02,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:08:02,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:08:02,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:08:02,514 INFO L87 Difference]: Start difference. First operand 294 states and 416 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 01:08:02,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:08:02,561 INFO L93 Difference]: Finished difference Result 595 states and 843 transitions. [2024-11-19 01:08:02,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:08:02,564 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2024-11-19 01:08:02,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:08:02,567 INFO L225 Difference]: With dead ends: 595 [2024-11-19 01:08:02,567 INFO L226 Difference]: Without dead ends: 304 [2024-11-19 01:08:02,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 112 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-19 01:08:02,569 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 483 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-19 01:08:02,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 483 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:08:02,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-11-19 01:08:02,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2024-11-19 01:08:02,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 269 states have (on average 1.3605947955390334) internal successors, (366), 271 states have internal predecessors, (366), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-19 01:08:02,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 426 transitions. [2024-11-19 01:08:02,589 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 426 transitions. Word has length 116 [2024-11-19 01:08:02,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:08:02,590 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 426 transitions. [2024-11-19 01:08:02,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 01:08:02,590 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 426 transitions. [2024-11-19 01:08:02,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-19 01:08:02,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:08:02,592 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:08:02,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-19 01:08:02,793 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-19 01:08:02,794 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:08:02,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:08:02,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1889136054, now seen corresponding path program 1 times [2024-11-19 01:08:02,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:08:02,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [586474953] [2024-11-19 01:08:02,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:08:02,795 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-19 01:08:02,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:08:02,797 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-19 01:08:02,798 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-19 01:08:03,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:08:03,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-19 01:08:03,038 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:08:03,044 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 14 treesize of output 10 [2024-11-19 01:08:03,204 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 52 treesize of output 24 [2024-11-19 01:08:03,272 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 47 treesize of output 34 [2024-11-19 01:08:03,460 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:03,461 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 58 treesize of output 37 [2024-11-19 01:08:03,482 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:03,482 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 62 treesize of output 37 [2024-11-19 01:08:03,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:03,502 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 64 treesize of output 48 [2024-11-19 01:08:03,616 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:03,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 81 treesize of output 39 [2024-11-19 01:08:03,669 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 220 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-19 01:08:03,669 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:08:03,779 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 01:08:03,779 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:08:03,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [586474953] [2024-11-19 01:08:03,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [586474953] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 01:08:03,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:08:03,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [16] total 18 [2024-11-19 01:08:03,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911939658] [2024-11-19 01:08:03,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:08:03,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:08:03,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:08:03,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:08:03,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2024-11-19 01:08:03,780 INFO L87 Difference]: Start difference. First operand 304 states and 426 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 01:08:04,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:08:04,190 INFO L93 Difference]: Finished difference Result 661 states and 921 transitions. [2024-11-19 01:08:04,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 01:08:04,190 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2024-11-19 01:08:04,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:08:04,192 INFO L225 Difference]: With dead ends: 661 [2024-11-19 01:08:04,192 INFO L226 Difference]: Without dead ends: 360 [2024-11-19 01:08:04,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2024-11-19 01:08:04,193 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 76 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 01:08:04,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 574 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 01:08:04,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-11-19 01:08:04,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 350. [2024-11-19 01:08:04,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 297 states have (on average 1.3367003367003367) internal successors, (397), 300 states have internal predecessors, (397), 45 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-19 01:08:04,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 487 transitions. [2024-11-19 01:08:04,231 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 487 transitions. Word has length 116 [2024-11-19 01:08:04,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:08:04,233 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 487 transitions. [2024-11-19 01:08:04,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 01:08:04,234 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 487 transitions. [2024-11-19 01:08:04,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-19 01:08:04,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:08:04,235 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:08:04,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-19 01:08:04,435 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-19 01:08:04,436 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:08:04,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:08:04,437 INFO L85 PathProgramCache]: Analyzing trace with hash 273513635, now seen corresponding path program 1 times [2024-11-19 01:08:04,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:08:04,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1102168188] [2024-11-19 01:08:04,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:08:04,438 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-19 01:08:04,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:08:04,440 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-19 01:08:04,441 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-19 01:08:04,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:08:04,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-19 01:08:04,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:08:04,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:04,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:04,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:04,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:04,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:04,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:04,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:04,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:04,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:04,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:04,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:04,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:04,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:04,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:04,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:04,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:04,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:04,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:04,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:04,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:04,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:04,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 91 [2024-11-19 01:08:04,859 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:04,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 121 treesize of output 118 [2024-11-19 01:08:05,158 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:05,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 105 treesize of output 119 [2024-11-19 01:08:05,765 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:05,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 105 treesize of output 119 [2024-11-19 01:08:06,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:06,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 105 treesize of output 119 [2024-11-19 01:08:06,559 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:06,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 110 treesize of output 109 [2024-11-19 01:08:06,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:06,967 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 100 treesize of output 96 [2024-11-19 01:08:07,250 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:07,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 90 treesize of output 83 [2024-11-19 01:08:07,683 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:07,683 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 95 treesize of output 86 [2024-11-19 01:08:07,712 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:07,713 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 120 treesize of output 48 [2024-11-19 01:08:07,753 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 332 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-19 01:08:07,753 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:08:08,296 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:08:08,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1102168188] [2024-11-19 01:08:08,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1102168188] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:08:08,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2100025221] [2024-11-19 01:08:08,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:08:08,297 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 01:08:08,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 01:08:08,299 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 01:08:08,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-11-19 01:08:08,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:08:09,002 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-19 01:08:09,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:08:09,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:09,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:09,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:09,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:09,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:09,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:09,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:09,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:09,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:09,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:09,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:09,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:09,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:09,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:09,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:09,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 51 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 57 [2024-11-19 01:08:09,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:09,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 36 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 73 treesize of output 94 [2024-11-19 01:08:12,904 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:12,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 85 treesize of output 101 [2024-11-19 01:08:15,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:15,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 88 treesize of output 100 [2024-11-19 01:08:16,280 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:16,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 85 treesize of output 101 [2024-11-19 01:08:19,487 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:19,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 88 treesize of output 93 [2024-11-19 01:08:21,889 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:21,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 77 treesize of output 97 [2024-11-19 01:08:22,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:22,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 85 treesize of output 101 [2024-11-19 01:08:23,063 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:23,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 103 treesize of output 107 [2024-11-19 01:08:23,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:23,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 120 treesize of output 60 [2024-11-19 01:08:23,134 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 16 proven. 292 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-19 01:08:23,134 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:08:23,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2100025221] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:08:23,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 01:08:23,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2024-11-19 01:08:23,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801695582] [2024-11-19 01:08:23,426 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 01:08:23,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-19 01:08:23,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:08:23,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-19 01:08:23,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=511, Unknown=4, NotChecked=0, Total=650 [2024-11-19 01:08:23,427 INFO L87 Difference]: Start difference. First operand 350 states and 487 transitions. Second operand has 21 states, 21 states have (on average 5.523809523809524) internal successors, (116), 20 states have internal predecessors, (116), 13 states have call successors, (28), 13 states have call predecessors, (28), 13 states have return successors, (28), 13 states have call predecessors, (28), 13 states have call successors, (28) [2024-11-19 01:08:28,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:08:28,111 INFO L93 Difference]: Finished difference Result 763 states and 1058 transitions. [2024-11-19 01:08:28,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 01:08:28,112 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.523809523809524) internal successors, (116), 20 states have internal predecessors, (116), 13 states have call successors, (28), 13 states have call predecessors, (28), 13 states have return successors, (28), 13 states have call predecessors, (28), 13 states have call successors, (28) Word has length 118 [2024-11-19 01:08:28,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:08:28,115 INFO L225 Difference]: With dead ends: 763 [2024-11-19 01:08:28,115 INFO L226 Difference]: Without dead ends: 428 [2024-11-19 01:08:28,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 420 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=277, Invalid=979, Unknown=4, NotChecked=0, Total=1260 [2024-11-19 01:08:28,116 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 79 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-19 01:08:28,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 904 Invalid, 1172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-19 01:08:28,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2024-11-19 01:08:28,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 417. [2024-11-19 01:08:28,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 345 states have (on average 1.3130434782608695) internal successors, (453), 347 states have internal predecessors, (453), 58 states have call successors, (58), 13 states have call predecessors, (58), 13 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-19 01:08:28,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 569 transitions. [2024-11-19 01:08:28,146 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 569 transitions. Word has length 118 [2024-11-19 01:08:28,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:08:28,146 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 569 transitions. [2024-11-19 01:08:28,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.523809523809524) internal successors, (116), 20 states have internal predecessors, (116), 13 states have call successors, (28), 13 states have call predecessors, (28), 13 states have return successors, (28), 13 states have call predecessors, (28), 13 states have call successors, (28) [2024-11-19 01:08:28,147 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 569 transitions. [2024-11-19 01:08:28,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-19 01:08:28,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:08:28,148 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:08:28,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2024-11-19 01:08:28,357 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 (10)] Forceful destruction successful, exit code 0 [2024-11-19 01:08:28,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-19 01:08:28,553 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:08:28,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:08:28,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1962457377, now seen corresponding path program 1 times [2024-11-19 01:08:28,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:08:28,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [282833748] [2024-11-19 01:08:28,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:08:28,554 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-19 01:08:28,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:08:28,556 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-19 01:08:28,557 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-19 01:08:28,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:08:28,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 01:08:28,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:08:28,795 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-19 01:08:28,832 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-19 01:08:28,864 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 27 treesize of output 15 [2024-11-19 01:08:28,870 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 37 treesize of output 30 [2024-11-19 01:08:28,970 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:28,970 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 89 treesize of output 47 [2024-11-19 01:08:29,011 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 153 proven. 9 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-11-19 01:08:29,012 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:08:29,146 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 01:08:29,146 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:08:29,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [282833748] [2024-11-19 01:08:29,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [282833748] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 01:08:29,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:08:29,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2024-11-19 01:08:29,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868020263] [2024-11-19 01:08:29,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:08:29,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:08:29,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:08:29,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:08:29,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-19 01:08:29,148 INFO L87 Difference]: Start difference. First operand 417 states and 569 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 01:08:29,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:08:29,619 INFO L93 Difference]: Finished difference Result 1040 states and 1429 transitions. [2024-11-19 01:08:29,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:08:29,620 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-11-19 01:08:29,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:08:29,631 INFO L225 Difference]: With dead ends: 1040 [2024-11-19 01:08:29,632 INFO L226 Difference]: Without dead ends: 705 [2024-11-19 01:08:29,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-19 01:08:29,634 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 76 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 01:08:29,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 600 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 01:08:29,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2024-11-19 01:08:29,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 701. [2024-11-19 01:08:29,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 587 states have (on average 1.303236797274276) internal successors, (765), 593 states have internal predecessors, (765), 94 states have call successors, (94), 19 states have call predecessors, (94), 19 states have return successors, (94), 88 states have call predecessors, (94), 94 states have call successors, (94) [2024-11-19 01:08:29,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 953 transitions. [2024-11-19 01:08:29,752 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 953 transitions. Word has length 118 [2024-11-19 01:08:29,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:08:29,752 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 953 transitions. [2024-11-19 01:08:29,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 01:08:29,752 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 953 transitions. [2024-11-19 01:08:29,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-19 01:08:29,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:08:29,754 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:08:29,770 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-19 01:08:29,958 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-19 01:08:29,959 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:08:29,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:08:29,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1153110751, now seen corresponding path program 1 times [2024-11-19 01:08:29,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:08:29,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1093407652] [2024-11-19 01:08:29,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:08:29,959 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-19 01:08:29,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:08:29,961 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-19 01:08:29,963 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-19 01:08:30,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:08:30,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-19 01:08:30,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:08:30,208 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 102 treesize of output 10 [2024-11-19 01:08:30,221 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 41 treesize of output 14 [2024-11-19 01:08:30,239 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 25 treesize of output 24 [2024-11-19 01:08:30,337 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:30,337 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 35 treesize of output 37 [2024-11-19 01:08:30,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:30,434 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 45 treesize of output 50 [2024-11-19 01:08:30,570 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:30,571 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 60 treesize of output 53 [2024-11-19 01:08:30,684 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:30,685 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 60 treesize of output 53 [2024-11-19 01:08:30,797 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:30,798 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 55 treesize of output 63 [2024-11-19 01:08:31,021 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:31,021 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 66 treesize of output 66 [2024-11-19 01:08:31,205 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:31,206 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 109 treesize of output 81 [2024-11-19 01:08:31,521 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:31,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 115 treesize of output 55 [2024-11-19 01:08:31,556 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-19 01:08:31,556 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:08:31,556 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:08:31,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1093407652] [2024-11-19 01:08:31,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1093407652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:08:31,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:08:31,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 01:08:31,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085565510] [2024-11-19 01:08:31,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:08:31,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 01:08:31,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:08:31,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 01:08:31,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2024-11-19 01:08:31,558 INFO L87 Difference]: Start difference. First operand 701 states and 953 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 9 states have internal predecessors, (63), 5 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2024-11-19 01:08:33,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:08:33,040 INFO L93 Difference]: Finished difference Result 1326 states and 1809 transitions. [2024-11-19 01:08:33,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:08:33,041 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 9 states have internal predecessors, (63), 5 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 118 [2024-11-19 01:08:33,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:08:33,050 INFO L225 Difference]: With dead ends: 1326 [2024-11-19 01:08:33,051 INFO L226 Difference]: Without dead ends: 707 [2024-11-19 01:08:33,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-19 01:08:33,053 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 369 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-19 01:08:33,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 358 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-19 01:08:33,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2024-11-19 01:08:33,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 703. [2024-11-19 01:08:33,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 588 states have (on average 1.2993197278911566) internal successors, (764), 594 states have internal predecessors, (764), 94 states have call successors, (94), 20 states have call predecessors, (94), 20 states have return successors, (94), 88 states have call predecessors, (94), 94 states have call successors, (94) [2024-11-19 01:08:33,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 952 transitions. [2024-11-19 01:08:33,160 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 952 transitions. Word has length 118 [2024-11-19 01:08:33,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:08:33,161 INFO L471 AbstractCegarLoop]: Abstraction has 703 states and 952 transitions. [2024-11-19 01:08:33,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 9 states have internal predecessors, (63), 5 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2024-11-19 01:08:33,161 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 952 transitions. [2024-11-19 01:08:33,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-19 01:08:33,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:08:33,165 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:08:33,176 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-19 01:08:33,366 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-19 01:08:33,366 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:08:33,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:08:33,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1713730350, now seen corresponding path program 1 times [2024-11-19 01:08:33,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:08:33,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1339855482] [2024-11-19 01:08:33,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:08:33,368 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-19 01:08:33,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:08:33,370 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-19 01:08:33,372 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-19 01:08:33,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:08:33,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-19 01:08:33,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:08:33,615 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-19 01:08:33,642 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-19 01:08:33,660 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-19 01:08:33,730 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:33,730 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 41 treesize of output 28 [2024-11-19 01:08:33,786 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:33,787 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 36 treesize of output 38 [2024-11-19 01:08:33,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:33,903 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 47 treesize of output 41 [2024-11-19 01:08:33,920 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:33,921 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 51 treesize of output 41 [2024-11-19 01:08:33,951 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:33,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 42 treesize of output 18 [2024-11-19 01:08:33,968 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 263 proven. 24 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-19 01:08:33,968 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:08:34,121 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 15 proven. 24 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-19 01:08:34,122 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:08:34,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1339855482] [2024-11-19 01:08:34,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1339855482] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:08:34,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 01:08:34,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2024-11-19 01:08:34,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783773901] [2024-11-19 01:08:34,123 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 01:08:34,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 01:08:34,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:08:34,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 01:08:34,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-19 01:08:34,124 INFO L87 Difference]: Start difference. First operand 703 states and 952 transitions. Second operand has 13 states, 11 states have (on average 8.0) internal successors, (88), 13 states have internal predecessors, (88), 6 states have call successors, (23), 4 states have call predecessors, (23), 6 states have return successors, (23), 4 states have call predecessors, (23), 6 states have call successors, (23) [2024-11-19 01:08:35,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:08:35,011 INFO L93 Difference]: Finished difference Result 1458 states and 1918 transitions. [2024-11-19 01:08:35,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 01:08:35,012 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 8.0) internal successors, (88), 13 states have internal predecessors, (88), 6 states have call successors, (23), 4 states have call predecessors, (23), 6 states have return successors, (23), 4 states have call predecessors, (23), 6 states have call successors, (23) Word has length 118 [2024-11-19 01:08:35,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:08:35,022 INFO L225 Difference]: With dead ends: 1458 [2024-11-19 01:08:35,022 INFO L226 Difference]: Without dead ends: 837 [2024-11-19 01:08:35,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 222 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=404, Unknown=0, NotChecked=0, Total=552 [2024-11-19 01:08:35,028 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 259 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 01:08:35,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 240 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 01:08:35,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2024-11-19 01:08:35,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 678. [2024-11-19 01:08:35,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 573 states have (on average 1.2792321116928447) internal successors, (733), 578 states have internal predecessors, (733), 74 states have call successors, (74), 30 states have call predecessors, (74), 30 states have return successors, (74), 69 states have call predecessors, (74), 74 states have call successors, (74) [2024-11-19 01:08:35,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 881 transitions. [2024-11-19 01:08:35,180 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 881 transitions. Word has length 118 [2024-11-19 01:08:35,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:08:35,180 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 881 transitions. [2024-11-19 01:08:35,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 8.0) internal successors, (88), 13 states have internal predecessors, (88), 6 states have call successors, (23), 4 states have call predecessors, (23), 6 states have return successors, (23), 4 states have call predecessors, (23), 6 states have call successors, (23) [2024-11-19 01:08:35,180 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 881 transitions. [2024-11-19 01:08:35,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-19 01:08:35,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:08:35,181 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:08:35,201 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-19 01:08:35,382 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-19 01:08:35,382 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:08:35,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:08:35,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1126924336, now seen corresponding path program 1 times [2024-11-19 01:08:35,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:08:35,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [351901251] [2024-11-19 01:08:35,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:08:35,383 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-19 01:08:35,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:08:35,386 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-19 01:08:35,387 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-19 01:08:35,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:08:35,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-19 01:08:35,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:08:35,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:35,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:35,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:35,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:35,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:35,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:35,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:35,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:35,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:35,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:35,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:35,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:35,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:35,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:35,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:35,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 71 [2024-11-19 01:08:35,771 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:35,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 91 treesize of output 112 [2024-11-19 01:08:39,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:39,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 110 treesize of output 109 [2024-11-19 01:08:42,378 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:42,378 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 95 treesize of output 106 [2024-11-19 01:08:44,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:44,928 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 100 treesize of output 105 [2024-11-19 01:08:45,278 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:45,278 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 95 treesize of output 106 [2024-11-19 01:08:48,111 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:48,112 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 100 treesize of output 96 [2024-11-19 01:08:50,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:50,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 90 treesize of output 92 [2024-11-19 01:08:51,292 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:51,292 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 105 treesize of output 108 [2024-11-19 01:08:51,351 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:51,351 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 109 treesize of output 99 [2024-11-19 01:08:51,500 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:51,500 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 110 treesize of output 44 [2024-11-19 01:08:51,548 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-19 01:08:51,548 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:08:55,688 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:08:55,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [351901251] [2024-11-19 01:08:55,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [351901251] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:08:55,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1838484346] [2024-11-19 01:08:55,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:08:55,688 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 01:08:55,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 01:08:55,689 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 01:08:55,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2024-11-19 01:08:56,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:08:56,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-19 01:08:56,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:08:56,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 36 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 8 [2024-11-19 01:08:56,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28