./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-39.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-39.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 77e2354f2cb7c50edc4d757661e3378145df169c487a524446d0f0165ad173f1 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 04:48:27,857 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 04:48:27,907 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 04:48:27,914 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 04:48:27,914 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 04:48:27,944 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 04:48:27,946 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 04:48:27,946 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 04:48:27,947 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 04:48:27,947 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 04:48:27,948 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 04:48:27,949 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 04:48:27,949 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 04:48:27,949 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 04:48:27,950 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 04:48:27,951 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 04:48:27,952 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 04:48:27,952 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 04:48:27,952 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 04:48:27,952 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 04:48:27,952 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 04:48:27,955 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 04:48:27,955 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 04:48:27,956 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 04:48:27,956 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 04:48:27,956 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 04:48:27,956 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 04:48:27,956 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 04:48:27,957 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 04:48:27,957 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 04:48:27,957 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 04:48:27,957 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 04:48:27,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:48:27,957 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 04:48:27,957 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 04:48:27,958 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 04:48:27,958 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 04:48:27,958 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 04:48:27,958 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 04:48:27,958 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 04:48:27,958 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 04:48:27,959 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 04:48:27,959 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 -> 77e2354f2cb7c50edc4d757661e3378145df169c487a524446d0f0165ad173f1 [2024-11-12 04:48:28,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 04:48:28,194 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 04:48:28,196 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 04:48:28,197 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 04:48:28,198 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 04:48:28,200 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-39.i [2024-11-12 04:48:29,519 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 04:48:29,685 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 04:48:29,685 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-39.i [2024-11-12 04:48:29,696 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec0504ce8/409fa24ae25d417e92457a10c793a7a0/FLAG4981e0b68 [2024-11-12 04:48:29,709 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec0504ce8/409fa24ae25d417e92457a10c793a7a0 [2024-11-12 04:48:29,711 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 04:48:29,712 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 04:48:29,713 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 04:48:29,713 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 04:48:29,718 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 04:48:29,718 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:48:29" (1/1) ... [2024-11-12 04:48:29,719 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f9868b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:48:29, skipping insertion in model container [2024-11-12 04:48:29,719 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:48:29" (1/1) ... [2024-11-12 04:48:29,740 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 04:48:29,948 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_floatingpointinfluence_no-floats_file-39.i[916,929] [2024-11-12 04:48:29,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:48:30,000 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 04:48:30,013 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_floatingpointinfluence_no-floats_file-39.i[916,929] [2024-11-12 04:48:30,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:48:30,065 INFO L204 MainTranslator]: Completed translation [2024-11-12 04:48:30,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:48:30 WrapperNode [2024-11-12 04:48:30,065 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 04:48:30,066 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 04:48:30,066 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 04:48:30,066 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 04:48:30,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:48:30" (1/1) ... [2024-11-12 04:48:30,083 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:48:30" (1/1) ... [2024-11-12 04:48:30,115 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 131 [2024-11-12 04:48:30,116 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 04:48:30,118 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 04:48:30,118 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 04:48:30,118 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 04:48:30,132 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:48:30" (1/1) ... [2024-11-12 04:48:30,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:48:30" (1/1) ... [2024-11-12 04:48:30,138 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:48:30" (1/1) ... [2024-11-12 04:48:30,149 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 04:48:30,149 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:48:30" (1/1) ... [2024-11-12 04:48:30,150 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:48:30" (1/1) ... [2024-11-12 04:48:30,153 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:48:30" (1/1) ... [2024-11-12 04:48:30,156 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:48:30" (1/1) ... [2024-11-12 04:48:30,157 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:48:30" (1/1) ... [2024-11-12 04:48:30,158 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:48:30" (1/1) ... [2024-11-12 04:48:30,160 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 04:48:30,161 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 04:48:30,161 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 04:48:30,161 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 04:48:30,162 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:48:30" (1/1) ... [2024-11-12 04:48:30,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:48:30,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:48:30,208 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 04:48:30,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 04:48:30,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 04:48:30,250 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 04:48:30,250 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 04:48:30,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 04:48:30,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 04:48:30,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 04:48:30,305 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 04:48:30,307 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 04:48:30,519 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-12 04:48:30,519 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 04:48:30,540 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 04:48:30,540 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 04:48:30,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:48:30 BoogieIcfgContainer [2024-11-12 04:48:30,540 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 04:48:30,542 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 04:48:30,542 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 04:48:30,545 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 04:48:30,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:48:29" (1/3) ... [2024-11-12 04:48:30,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4be82387 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:48:30, skipping insertion in model container [2024-11-12 04:48:30,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:48:30" (2/3) ... [2024-11-12 04:48:30,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4be82387 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:48:30, skipping insertion in model container [2024-11-12 04:48:30,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:48:30" (3/3) ... [2024-11-12 04:48:30,548 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-39.i [2024-11-12 04:48:30,562 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 04:48:30,562 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 04:48:30,610 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 04:48:30,615 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;@5318cde5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 04:48:30,616 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 04:48:30,620 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 38 states have internal predecessors, (49), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 04:48:30,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-12 04:48:30,629 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:48:30,630 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:48:30,630 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:48:30,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:48:30,639 INFO L85 PathProgramCache]: Analyzing trace with hash 529088070, now seen corresponding path program 1 times [2024-11-12 04:48:30,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:48:30,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658778145] [2024-11-12 04:48:30,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:48:30,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:48:30,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:30,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:48:30,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:30,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:48:30,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:30,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:48:30,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:30,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:48:30,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:30,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:48:30,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:30,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:48:30,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:30,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:48:30,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:30,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:48:30,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:30,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:48:30,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:30,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:48:30,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:30,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:48:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:30,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:48:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:30,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:48:30,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:31,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:48:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:31,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:48:31,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:31,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:48:31,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:31,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 04:48:31,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:31,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:48:31,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:31,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-12 04:48:31,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:31,033 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-12 04:48:31,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:48:31,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658778145] [2024-11-12 04:48:31,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658778145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:48:31,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:48:31,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:48:31,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059186771] [2024-11-12 04:48:31,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:48:31,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 04:48:31,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:48:31,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 04:48:31,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:48:31,066 INFO L87 Difference]: Start difference. First operand has 59 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 38 states have internal predecessors, (49), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-12 04:48:31,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:48:31,089 INFO L93 Difference]: Finished difference Result 111 states and 187 transitions. [2024-11-12 04:48:31,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 04:48:31,092 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 119 [2024-11-12 04:48:31,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:48:31,097 INFO L225 Difference]: With dead ends: 111 [2024-11-12 04:48:31,099 INFO L226 Difference]: Without dead ends: 55 [2024-11-12 04:48:31,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:48:31,107 INFO L435 NwaCegarLoop]: 80 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, 80 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:48:31,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:48:31,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-12 04:48:31,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-12 04:48:31,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 04:48:31,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 80 transitions. [2024-11-12 04:48:31,148 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 80 transitions. Word has length 119 [2024-11-12 04:48:31,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:48:31,149 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 80 transitions. [2024-11-12 04:48:31,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-12 04:48:31,149 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 80 transitions. [2024-11-12 04:48:31,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-12 04:48:31,155 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:48:31,155 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:48:31,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 04:48:31,156 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:48:31,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:48:31,156 INFO L85 PathProgramCache]: Analyzing trace with hash -612413688, now seen corresponding path program 1 times [2024-11-12 04:48:31,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:48:31,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736837633] [2024-11-12 04:48:31,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:48:31,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:48:31,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:32,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:48:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:32,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:48:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:32,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:48:32,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:32,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:48:32,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:32,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:48:32,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:32,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:48:32,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:32,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:48:32,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:32,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:48:32,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:32,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:48:32,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:32,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:48:32,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:32,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:48:32,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:32,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:48:32,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:32,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:48:32,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:32,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:48:32,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:32,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:48:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:32,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:48:32,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:32,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 04:48:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:32,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:48:32,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:32,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-12 04:48:32,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:32,139 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-12 04:48:32,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:48:32,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736837633] [2024-11-12 04:48:32,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736837633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:48:32,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:48:32,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 04:48:32,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125596063] [2024-11-12 04:48:32,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:48:32,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 04:48:32,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:48:32,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 04:48:32,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 04:48:32,143 INFO L87 Difference]: Start difference. First operand 55 states and 80 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 04:48:32,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:48:32,393 INFO L93 Difference]: Finished difference Result 127 states and 182 transitions. [2024-11-12 04:48:32,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 04:48:32,394 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 119 [2024-11-12 04:48:32,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:48:32,396 INFO L225 Difference]: With dead ends: 127 [2024-11-12 04:48:32,396 INFO L226 Difference]: Without dead ends: 75 [2024-11-12 04:48:32,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 04:48:32,397 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 54 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 04:48:32,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 189 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 04:48:32,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-12 04:48:32,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 62. [2024-11-12 04:48:32,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 states have internal predecessors, (52), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 04:48:32,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 90 transitions. [2024-11-12 04:48:32,408 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 90 transitions. Word has length 119 [2024-11-12 04:48:32,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:48:32,409 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 90 transitions. [2024-11-12 04:48:32,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 04:48:32,410 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 90 transitions. [2024-11-12 04:48:32,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-12 04:48:32,411 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:48:32,411 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:48:32,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 04:48:32,411 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:48:32,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:48:32,412 INFO L85 PathProgramCache]: Analyzing trace with hash 2056540108, now seen corresponding path program 1 times [2024-11-12 04:48:32,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:48:32,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471262087] [2024-11-12 04:48:32,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:48:32,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:48:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:33,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:48:33,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:33,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:48:33,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:33,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:48:33,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:33,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:48:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:33,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:48:33,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:33,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:48:33,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:33,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:48:33,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:33,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:48:33,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:33,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:48:33,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:33,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:48:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:33,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:48:33,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:33,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:48:33,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:33,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:48:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:33,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:48:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:33,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:48:33,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:33,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:48:33,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:33,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 04:48:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:33,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:48:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:33,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-12 04:48:33,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:33,240 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-12 04:48:33,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:48:33,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471262087] [2024-11-12 04:48:33,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471262087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:48:33,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:48:33,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 04:48:33,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954510703] [2024-11-12 04:48:33,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:48:33,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 04:48:33,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:48:33,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 04:48:33,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-12 04:48:33,246 INFO L87 Difference]: Start difference. First operand 62 states and 90 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 04:48:33,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:48:33,520 INFO L93 Difference]: Finished difference Result 152 states and 214 transitions. [2024-11-12 04:48:33,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 04:48:33,522 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 120 [2024-11-12 04:48:33,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:48:33,524 INFO L225 Difference]: With dead ends: 152 [2024-11-12 04:48:33,524 INFO L226 Difference]: Without dead ends: 93 [2024-11-12 04:48:33,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-12 04:48:33,526 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 72 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 04:48:33,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 199 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 04:48:33,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-12 04:48:33,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 62. [2024-11-12 04:48:33,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 states have internal predecessors, (52), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 04:48:33,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 90 transitions. [2024-11-12 04:48:33,534 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 90 transitions. Word has length 120 [2024-11-12 04:48:33,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:48:33,535 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 90 transitions. [2024-11-12 04:48:33,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 04:48:33,535 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 90 transitions. [2024-11-12 04:48:33,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-12 04:48:33,536 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:48:33,537 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:48:33,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 04:48:33,538 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:48:33,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:48:33,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1663513098, now seen corresponding path program 1 times [2024-11-12 04:48:33,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:48:33,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576363848] [2024-11-12 04:48:33,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:48:33,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:48:33,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:34,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:48:34,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:34,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:48:34,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:34,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:48:34,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:34,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:48:34,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:34,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:48:34,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:34,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:48:34,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:34,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:48:34,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:34,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:48:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:34,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:48:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:34,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:48:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:34,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:48:34,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:34,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:48:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:34,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:48:34,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:34,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:48:34,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:34,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:48:34,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:34,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:48:34,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:34,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 04:48:34,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:34,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:48:34,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:34,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-12 04:48:34,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:34,494 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-12 04:48:34,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:48:34,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576363848] [2024-11-12 04:48:34,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576363848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:48:34,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:48:34,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 04:48:34,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955817441] [2024-11-12 04:48:34,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:48:34,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 04:48:34,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:48:34,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 04:48:34,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 04:48:34,497 INFO L87 Difference]: Start difference. First operand 62 states and 90 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 04:48:34,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:48:34,922 INFO L93 Difference]: Finished difference Result 141 states and 201 transitions. [2024-11-12 04:48:34,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 04:48:34,923 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 120 [2024-11-12 04:48:34,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:48:34,924 INFO L225 Difference]: With dead ends: 141 [2024-11-12 04:48:34,924 INFO L226 Difference]: Without dead ends: 82 [2024-11-12 04:48:34,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-12 04:48:34,925 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 61 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 04:48:34,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 186 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 04:48:34,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-12 04:48:34,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 55. [2024-11-12 04:48:34,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 04:48:34,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 79 transitions. [2024-11-12 04:48:34,932 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 79 transitions. Word has length 120 [2024-11-12 04:48:34,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:48:34,932 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 79 transitions. [2024-11-12 04:48:34,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 04:48:34,932 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 79 transitions. [2024-11-12 04:48:34,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-12 04:48:34,933 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:48:34,934 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:48:34,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 04:48:34,934 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:48:34,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:48:34,934 INFO L85 PathProgramCache]: Analyzing trace with hash -667490973, now seen corresponding path program 1 times [2024-11-12 04:48:34,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:48:34,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006086809] [2024-11-12 04:48:34,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:48:34,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:48:34,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:41,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:48:41,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:41,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:48:41,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:41,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:48:41,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:41,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:48:41,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:41,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:48:41,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:41,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:48:41,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:41,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:48:41,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:41,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:48:41,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:41,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:48:41,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:41,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:48:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:41,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:48:41,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:41,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:48:41,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:41,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:48:41,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:41,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:48:41,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:41,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:48:41,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:41,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:48:41,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:41,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 04:48:41,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:41,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:48:41,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:41,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-12 04:48:41,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:41,830 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-12 04:48:41,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:48:41,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006086809] [2024-11-12 04:48:41,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006086809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:48:41,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:48:41,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 04:48:41,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966940124] [2024-11-12 04:48:41,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:48:41,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 04:48:41,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:48:41,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 04:48:41,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-12 04:48:41,832 INFO L87 Difference]: Start difference. First operand 55 states and 79 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 04:48:42,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:48:42,259 INFO L93 Difference]: Finished difference Result 76 states and 102 transitions. [2024-11-12 04:48:42,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 04:48:42,259 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 121 [2024-11-12 04:48:42,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:48:42,260 INFO L225 Difference]: With dead ends: 76 [2024-11-12 04:48:42,260 INFO L226 Difference]: Without dead ends: 74 [2024-11-12 04:48:42,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-12 04:48:42,261 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 15 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 04:48:42,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 498 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 04:48:42,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-12 04:48:42,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 64. [2024-11-12 04:48:42,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 43 states have internal predecessors, (52), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 04:48:42,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 90 transitions. [2024-11-12 04:48:42,267 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 90 transitions. Word has length 121 [2024-11-12 04:48:42,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:48:42,268 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 90 transitions. [2024-11-12 04:48:42,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 04:48:42,268 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 90 transitions. [2024-11-12 04:48:42,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-12 04:48:42,269 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:48:42,269 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:48:42,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 04:48:42,269 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:48:42,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:48:42,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1620873309, now seen corresponding path program 1 times [2024-11-12 04:48:42,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:48:42,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200434466] [2024-11-12 04:48:42,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:48:42,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:48:42,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:43,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:48:43,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:43,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:48:43,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:43,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:48:43,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:43,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:48:43,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:43,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:48:43,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:43,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:48:43,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:43,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:48:43,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:43,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:48:43,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:43,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:48:43,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:43,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:48:43,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:43,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:48:43,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:43,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:48:43,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:43,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:48:43,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:43,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:48:43,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:43,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:48:43,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:43,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:48:43,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:43,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 04:48:43,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:43,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:48:43,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:43,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-12 04:48:43,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:43,105 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-12 04:48:43,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:48:43,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200434466] [2024-11-12 04:48:43,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200434466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:48:43,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:48:43,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 04:48:43,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270043417] [2024-11-12 04:48:43,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:48:43,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 04:48:43,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:48:43,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 04:48:43,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-12 04:48:43,107 INFO L87 Difference]: Start difference. First operand 64 states and 90 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 04:48:43,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:48:43,445 INFO L93 Difference]: Finished difference Result 84 states and 112 transitions. [2024-11-12 04:48:43,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 04:48:43,446 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 122 [2024-11-12 04:48:43,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:48:43,447 INFO L225 Difference]: With dead ends: 84 [2024-11-12 04:48:43,447 INFO L226 Difference]: Without dead ends: 82 [2024-11-12 04:48:43,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-12 04:48:43,448 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 14 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 04:48:43,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 525 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 04:48:43,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-12 04:48:43,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 65. [2024-11-12 04:48:43,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 04:48:43,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 92 transitions. [2024-11-12 04:48:43,461 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 92 transitions. Word has length 122 [2024-11-12 04:48:43,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:48:43,462 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 92 transitions. [2024-11-12 04:48:43,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 04:48:43,462 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 92 transitions. [2024-11-12 04:48:43,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-12 04:48:43,463 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:48:43,463 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:48:43,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 04:48:43,463 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:48:43,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:48:43,464 INFO L85 PathProgramCache]: Analyzing trace with hash -940814939, now seen corresponding path program 1 times [2024-11-12 04:48:43,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:48:43,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182994196] [2024-11-12 04:48:43,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:48:43,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:48:43,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:43,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:48:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:43,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:48:43,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:43,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:48:43,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:43,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:48:43,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:43,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:48:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:43,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:48:43,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:43,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:48:43,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:43,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:48:43,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:43,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:48:43,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:43,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:48:43,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:43,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:48:43,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:43,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:48:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:43,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:48:43,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:43,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:48:43,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:43,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:48:43,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:43,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:48:43,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:43,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 04:48:43,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:43,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:48:43,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:43,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-12 04:48:43,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:43,839 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-12 04:48:43,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:48:43,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182994196] [2024-11-12 04:48:43,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182994196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:48:43,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:48:43,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 04:48:43,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331834132] [2024-11-12 04:48:43,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:48:43,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 04:48:43,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:48:43,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 04:48:43,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-12 04:48:43,841 INFO L87 Difference]: Start difference. First operand 65 states and 92 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 04:48:45,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-12 04:48:45,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:48:45,190 INFO L93 Difference]: Finished difference Result 84 states and 112 transitions. [2024-11-12 04:48:45,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 04:48:45,191 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 122 [2024-11-12 04:48:45,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:48:45,192 INFO L225 Difference]: With dead ends: 84 [2024-11-12 04:48:45,192 INFO L226 Difference]: Without dead ends: 82 [2024-11-12 04:48:45,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2024-11-12 04:48:45,193 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 15 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-12 04:48:45,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 566 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-12 04:48:45,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-12 04:48:45,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 65. [2024-11-12 04:48:45,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 04:48:45,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 92 transitions. [2024-11-12 04:48:45,197 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 92 transitions. Word has length 122 [2024-11-12 04:48:45,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:48:45,197 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 92 transitions. [2024-11-12 04:48:45,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 04:48:45,197 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 92 transitions. [2024-11-12 04:48:45,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-12 04:48:45,198 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:48:45,198 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:48:45,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 04:48:45,198 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:48:45,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:48:45,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1798358431, now seen corresponding path program 1 times [2024-11-12 04:48:45,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:48:45,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100774683] [2024-11-12 04:48:45,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:48:45,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:48:45,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:45,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:48:45,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:45,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:48:45,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:45,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:48:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:45,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:48:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:45,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:48:45,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:45,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:48:45,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:45,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:48:45,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:45,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:48:45,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:45,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:48:45,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:45,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:48:45,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:45,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:48:45,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:45,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:48:45,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:45,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:48:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:45,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:48:45,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:45,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:48:45,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:45,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:48:45,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:45,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 04:48:45,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:45,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:48:45,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:45,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-12 04:48:45,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:45,254 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-12 04:48:45,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:48:45,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100774683] [2024-11-12 04:48:45,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100774683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:48:45,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:48:45,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 04:48:45,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190028358] [2024-11-12 04:48:45,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:48:45,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 04:48:45,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:48:45,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 04:48:45,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:48:45,256 INFO L87 Difference]: Start difference. First operand 65 states and 92 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 04:48:45,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:48:45,286 INFO L93 Difference]: Finished difference Result 136 states and 190 transitions. [2024-11-12 04:48:45,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 04:48:45,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 122 [2024-11-12 04:48:45,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:48:45,287 INFO L225 Difference]: With dead ends: 136 [2024-11-12 04:48:45,287 INFO L226 Difference]: Without dead ends: 74 [2024-11-12 04:48:45,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:48:45,288 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 14 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:48:45,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 127 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:48:45,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-12 04:48:45,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 65. [2024-11-12 04:48:45,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 44 states have internal predecessors, (53), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 04:48:45,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 91 transitions. [2024-11-12 04:48:45,293 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 91 transitions. Word has length 122 [2024-11-12 04:48:45,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:48:45,293 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 91 transitions. [2024-11-12 04:48:45,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 04:48:45,294 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 91 transitions. [2024-11-12 04:48:45,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-12 04:48:45,294 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:48:45,294 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:48:45,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 04:48:45,295 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:48:45,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:48:45,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1921569657, now seen corresponding path program 1 times [2024-11-12 04:48:45,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:48:45,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924747402] [2024-11-12 04:48:45,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:48:45,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:48:45,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:45,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:48:45,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:45,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:48:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:45,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:48:45,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:45,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:48:45,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:45,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:48:45,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:45,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:48:45,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:45,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:48:45,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:45,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:48:45,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:45,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:48:45,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:45,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:48:45,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:45,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:48:45,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:45,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:48:45,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:45,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:48:45,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:45,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:48:45,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:45,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:48:45,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:45,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:48:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:45,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 04:48:45,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:45,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:48:45,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:45,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-12 04:48:45,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:45,345 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-12 04:48:45,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:48:45,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924747402] [2024-11-12 04:48:45,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924747402] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:48:45,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:48:45,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 04:48:45,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220547168] [2024-11-12 04:48:45,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:48:45,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 04:48:45,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:48:45,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 04:48:45,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:48:45,347 INFO L87 Difference]: Start difference. First operand 65 states and 91 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 04:48:45,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:48:45,375 INFO L93 Difference]: Finished difference Result 130 states and 182 transitions. [2024-11-12 04:48:45,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 04:48:45,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 122 [2024-11-12 04:48:45,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:48:45,377 INFO L225 Difference]: With dead ends: 130 [2024-11-12 04:48:45,377 INFO L226 Difference]: Without dead ends: 68 [2024-11-12 04:48:45,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:48:45,378 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 13 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:48:45,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 139 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:48:45,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-12 04:48:45,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2024-11-12 04:48:45,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 04:48:45,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 90 transitions. [2024-11-12 04:48:45,382 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 90 transitions. Word has length 122 [2024-11-12 04:48:45,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:48:45,382 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 90 transitions. [2024-11-12 04:48:45,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-12 04:48:45,383 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 90 transitions. [2024-11-12 04:48:45,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-12 04:48:45,384 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:48:45,384 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:48:45,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 04:48:45,384 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:48:45,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:48:45,384 INFO L85 PathProgramCache]: Analyzing trace with hash -2020091971, now seen corresponding path program 1 times [2024-11-12 04:48:45,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:48:45,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655021909] [2024-11-12 04:48:45,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:48:45,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:48:45,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 04:48:45,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1826480075] [2024-11-12 04:48:45,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:48:45,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:48:45,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:48:45,425 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 04:48:45,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 04:48:45,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:48:45,493 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 04:48:45,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:48:45,579 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 04:48:45,579 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 04:48:45,580 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 04:48:45,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 04:48:45,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-12 04:48:45,787 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:48:45,850 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 04:48:45,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:48:45 BoogieIcfgContainer [2024-11-12 04:48:45,854 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 04:48:45,854 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 04:48:45,854 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 04:48:45,854 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 04:48:45,855 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:48:30" (3/4) ... [2024-11-12 04:48:45,856 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 04:48:45,858 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 04:48:45,858 INFO L158 Benchmark]: Toolchain (without parser) took 16146.13ms. Allocated memory was 148.9MB in the beginning and 771.8MB in the end (delta: 622.9MB). Free memory was 95.1MB in the beginning and 610.5MB in the end (delta: -515.3MB). Peak memory consumption was 107.8MB. Max. memory is 16.1GB. [2024-11-12 04:48:45,858 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory is still 51.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:48:45,858 INFO L158 Benchmark]: CACSL2BoogieTranslator took 352.61ms. Allocated memory is still 148.9MB. Free memory was 94.9MB in the beginning and 115.6MB in the end (delta: -20.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-12 04:48:45,859 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.00ms. Allocated memory is still 148.9MB. Free memory was 115.6MB in the beginning and 113.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 04:48:45,859 INFO L158 Benchmark]: Boogie Preprocessor took 42.57ms. Allocated memory is still 148.9MB. Free memory was 113.5MB in the beginning and 111.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 04:48:45,859 INFO L158 Benchmark]: RCFGBuilder took 379.59ms. Allocated memory is still 148.9MB. Free memory was 111.0MB in the beginning and 94.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 04:48:45,859 INFO L158 Benchmark]: TraceAbstraction took 15311.83ms. Allocated memory was 148.9MB in the beginning and 771.8MB in the end (delta: 622.9MB). Free memory was 93.8MB in the beginning and 610.5MB in the end (delta: -516.7MB). Peak memory consumption was 108.9MB. Max. memory is 16.1GB. [2024-11-12 04:48:45,860 INFO L158 Benchmark]: Witness Printer took 3.55ms. Allocated memory is still 771.8MB. Free memory is still 610.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:48:45,862 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 96.5MB. Free memory is still 51.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 352.61ms. Allocated memory is still 148.9MB. Free memory was 94.9MB in the beginning and 115.6MB in the end (delta: -20.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.00ms. Allocated memory is still 148.9MB. Free memory was 115.6MB in the beginning and 113.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.57ms. Allocated memory is still 148.9MB. Free memory was 113.5MB in the beginning and 111.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 379.59ms. Allocated memory is still 148.9MB. Free memory was 111.0MB in the beginning and 94.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 15311.83ms. Allocated memory was 148.9MB in the beginning and 771.8MB in the end (delta: 622.9MB). Free memory was 93.8MB in the beginning and 610.5MB in the end (delta: -516.7MB). Peak memory consumption was 108.9MB. Max. memory is 16.1GB. * Witness Printer took 3.55ms. Allocated memory is still 771.8MB. Free memory is still 610.5MB. 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 shiftLeft at line 92. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -5; [L23] signed short int var_1_2 = 0; [L24] signed short int var_1_3 = 1000; [L25] signed short int var_1_4 = 10; [L26] signed short int var_1_5 = 32; [L27] signed long int var_1_6 = 5; [L28] signed long int var_1_7 = 1; [L29] signed long int var_1_8 = 7; [L30] signed long int var_1_9 = 1; [L31] signed long int var_1_10 = 32; [L32] unsigned char var_1_11 = 64; [L33] signed long int var_1_12 = 1230482582; VAL [isInitial=0, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=1000, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L96] isInitial = 1 [L97] FCALL initially() [L98] COND TRUE 1 [L99] FCALL updateLastVariables() [L100] CALL updateVariables() [L60] var_1_2 = __VERIFIER_nondet_short() [L61] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1000, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1000, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L61] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1000, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L62] CALL assume_abort_if_not(var_1_2 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1000, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1000, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L62] RET assume_abort_if_not(var_1_2 <= 16383) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1000, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L63] var_1_3 = __VERIFIER_nondet_short() [L64] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L64] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L65] CALL assume_abort_if_not(var_1_3 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L65] RET assume_abort_if_not(var_1_3 <= 16383) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L66] var_1_4 = __VERIFIER_nondet_short() [L67] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L67] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L68] CALL assume_abort_if_not(var_1_4 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L68] RET assume_abort_if_not(var_1_4 <= 16383) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=32, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L69] var_1_5 = __VERIFIER_nondet_short() [L70] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L70] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L71] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L71] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=1, var_1_8=7, var_1_9=1] [L72] var_1_7 = __VERIFIER_nondet_long() [L73] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=7, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=7, var_1_9=1] [L73] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=7, var_1_9=1] [L74] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=7, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=7, var_1_9=1] [L74] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=7, var_1_9=1] [L75] var_1_8 = __VERIFIER_nondet_long() [L76] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=1] [L76] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=1] [L77] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=1] [L77] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=1] [L78] var_1_9 = __VERIFIER_nondet_long() [L79] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L79] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L80] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L80] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L81] var_1_11 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L82] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=32, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L83] CALL assume_abort_if_not(var_1_11 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L83] RET assume_abort_if_not(var_1_11 <= 255) VAL [isInitial=1, var_1_10=32, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L84] CALL assume_abort_if_not(var_1_11 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=2, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=2, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L84] RET assume_abort_if_not(var_1_11 != 0) VAL [isInitial=1, var_1_10=32, var_1_11=2, var_1_12=1230482582, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L85] var_1_12 = __VERIFIER_nondet_long() [L86] CALL assume_abort_if_not(var_1_12 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=2, var_1_12=1073741823, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=2, var_1_12=1073741823, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L86] RET assume_abort_if_not(var_1_12 >= 1073741823) VAL [isInitial=1, var_1_10=32, var_1_11=2, var_1_12=1073741823, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L87] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=2, var_1_12=1073741823, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=2, var_1_12=1073741823, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L87] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, var_1_10=32, var_1_11=2, var_1_12=1073741823, var_1_1=-5, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L100] RET updateVariables() [L101] CALL step() [L37] var_1_1 = ((((((16) > (4)) ? (16) : (4))) + var_1_2) - (var_1_3 + ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))))) VAL [isInitial=1, var_1_10=32, var_1_11=2, var_1_12=1073741823, var_1_1=13, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=5, var_1_7=0, var_1_8=0, var_1_9=0] [L38] COND FALSE !(var_1_2 >= var_1_1) [L45] var_1_6 = var_1_4 VAL [isInitial=1, var_1_10=32, var_1_11=2, var_1_12=1073741823, var_1_1=13, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=14, var_1_7=0, var_1_8=0, var_1_9=0] [L47] EXPR var_1_4 << var_1_2 VAL [isInitial=1, var_1_10=32, var_1_11=2, var_1_12=1073741823, var_1_1=13, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=14, var_1_7=0, var_1_8=0, var_1_9=0] [L47] signed long int stepLocal_1 = var_1_6 + (var_1_4 << var_1_2); [L48] signed long int stepLocal_0 = var_1_2 - (var_1_12 - var_1_5); VAL [isInitial=1, stepLocal_0=-1073741782, stepLocal_1=29, var_1_10=32, var_1_11=2, var_1_12=1073741823, var_1_1=13, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=14, var_1_7=0, var_1_8=0, var_1_9=0] [L49] COND FALSE !(stepLocal_1 != var_1_5) [L56] var_1_10 = var_1_2 VAL [isInitial=1, stepLocal_0=-1073741782, var_1_10=12, var_1_11=2, var_1_12=1073741823, var_1_1=13, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=14, var_1_7=0, var_1_8=0, var_1_9=0] [L101] RET step() [L102] CALL, EXPR property() [L92] EXPR ((var_1_1 == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + var_1_2) - (var_1_3 + ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))))))) && ((var_1_2 >= var_1_1) ? ((((((var_1_7 + var_1_8) < 0 ) ? -(var_1_7 + var_1_8) : (var_1_7 + var_1_8))) < var_1_9) ? (var_1_6 == ((signed long int) var_1_3)) : (var_1_6 == ((signed long int) var_1_1))) : (var_1_6 == ((signed long int) var_1_4)))) && (((var_1_6 + (var_1_4 << var_1_2)) != var_1_5) ? (((var_1_3 / var_1_11) < (var_1_2 - (var_1_12 - var_1_5))) ? (var_1_10 == ((signed long int) ((((-256) < (((((var_1_4) < (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))) ? (var_1_4) : (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2)))))))) ? (-256) : (((((var_1_4) < (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))) ? (var_1_4) : (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))))))))) : (var_1_10 == ((signed long int) var_1_4))) : (var_1_10 == ((signed long int) var_1_2))) VAL [isInitial=1, var_1_10=12, var_1_11=2, var_1_12=1073741823, var_1_1=13, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=14, var_1_7=0, var_1_8=0, var_1_9=0] [L92] EXPR var_1_4 << var_1_2 VAL [isInitial=1, var_1_10=12, var_1_11=2, var_1_12=1073741823, var_1_1=13, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=14, var_1_7=0, var_1_8=0, var_1_9=0] [L92] EXPR ((var_1_1 == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + var_1_2) - (var_1_3 + ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))))))) && ((var_1_2 >= var_1_1) ? ((((((var_1_7 + var_1_8) < 0 ) ? -(var_1_7 + var_1_8) : (var_1_7 + var_1_8))) < var_1_9) ? (var_1_6 == ((signed long int) var_1_3)) : (var_1_6 == ((signed long int) var_1_1))) : (var_1_6 == ((signed long int) var_1_4)))) && (((var_1_6 + (var_1_4 << var_1_2)) != var_1_5) ? (((var_1_3 / var_1_11) < (var_1_2 - (var_1_12 - var_1_5))) ? (var_1_10 == ((signed long int) ((((-256) < (((((var_1_4) < (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))) ? (var_1_4) : (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2)))))))) ? (-256) : (((((var_1_4) < (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))) ? (var_1_4) : (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))))))))) : (var_1_10 == ((signed long int) var_1_4))) : (var_1_10 == ((signed long int) var_1_2))) VAL [isInitial=1, var_1_10=12, var_1_11=2, var_1_12=1073741823, var_1_1=13, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=14, var_1_7=0, var_1_8=0, var_1_9=0] [L92-L93] return ((var_1_1 == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + var_1_2) - (var_1_3 + ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))))))) && ((var_1_2 >= var_1_1) ? ((((((var_1_7 + var_1_8) < 0 ) ? -(var_1_7 + var_1_8) : (var_1_7 + var_1_8))) < var_1_9) ? (var_1_6 == ((signed long int) var_1_3)) : (var_1_6 == ((signed long int) var_1_1))) : (var_1_6 == ((signed long int) var_1_4)))) && (((var_1_6 + (var_1_4 << var_1_2)) != var_1_5) ? (((var_1_3 / var_1_11) < (var_1_2 - (var_1_12 - var_1_5))) ? (var_1_10 == ((signed long int) ((((-256) < (((((var_1_4) < (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))) ? (var_1_4) : (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2)))))))) ? (-256) : (((((var_1_4) < (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))) ? (var_1_4) : (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))))))))) : (var_1_10 == ((signed long int) var_1_4))) : (var_1_10 == ((signed long int) var_1_2))) ; [L102] RET, EXPR property() [L102] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=12, var_1_11=2, var_1_12=1073741823, var_1_1=13, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=14, var_1_7=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=12, var_1_11=2, var_1_12=1073741823, var_1_1=13, var_1_2=12, var_1_3=1, var_1_4=14, var_1_5=29, var_1_6=14, var_1_7=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 59 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.2s, OverallIterations: 10, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 258 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 258 mSDsluCounter, 2509 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1825 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 993 IncrementalHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 684 mSDtfsCounter, 993 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 432 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=6, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 127 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 11.0s InterpolantComputationTime, 1333 NumberOfCodeBlocks, 1333 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1078 ConstructedInterpolants, 0 QuantifiedInterpolants, 7530 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 6156/6156 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 04:48:45,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-39.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 77e2354f2cb7c50edc4d757661e3378145df169c487a524446d0f0165ad173f1 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 04:48:47,874 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 04:48:47,943 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 04:48:47,947 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 04:48:47,947 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 04:48:47,975 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 04:48:47,975 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 04:48:47,976 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 04:48:47,976 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 04:48:47,976 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 04:48:47,976 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 04:48:47,977 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 04:48:47,977 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 04:48:47,977 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 04:48:47,977 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 04:48:47,978 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 04:48:47,978 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 04:48:47,981 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 04:48:47,982 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 04:48:47,982 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 04:48:47,982 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 04:48:47,982 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 04:48:47,983 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 04:48:47,983 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 04:48:47,983 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 04:48:47,983 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 04:48:47,983 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 04:48:47,983 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 04:48:47,984 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 04:48:47,984 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 04:48:47,984 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 04:48:47,984 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 04:48:47,984 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 04:48:47,984 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 04:48:47,984 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:48:47,985 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 04:48:47,985 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 04:48:47,985 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 04:48:47,985 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 04:48:47,985 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 04:48:47,985 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 04:48:47,986 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 04:48:47,986 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 04:48:47,986 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 04:48:47,987 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 -> 77e2354f2cb7c50edc4d757661e3378145df169c487a524446d0f0165ad173f1 [2024-11-12 04:48:48,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 04:48:48,254 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 04:48:48,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 04:48:48,259 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 04:48:48,259 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 04:48:48,260 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-39.i [2024-11-12 04:48:49,616 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 04:48:49,778 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 04:48:49,779 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-39.i [2024-11-12 04:48:49,786 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a21631ad/3a53e67398b141ef96d49b85a0a0ecc1/FLAG41addac51 [2024-11-12 04:48:49,799 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a21631ad/3a53e67398b141ef96d49b85a0a0ecc1 [2024-11-12 04:48:49,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 04:48:49,802 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 04:48:49,803 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 04:48:49,803 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 04:48:49,808 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 04:48:49,809 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:48:49" (1/1) ... [2024-11-12 04:48:49,810 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43a9f268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:48:49, skipping insertion in model container [2024-11-12 04:48:49,810 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:48:49" (1/1) ... [2024-11-12 04:48:49,829 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 04:48:49,982 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_floatingpointinfluence_no-floats_file-39.i[916,929] [2024-11-12 04:48:50,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:48:50,054 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 04:48:50,065 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_floatingpointinfluence_no-floats_file-39.i[916,929] [2024-11-12 04:48:50,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:48:50,104 INFO L204 MainTranslator]: Completed translation [2024-11-12 04:48:50,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:48:50 WrapperNode [2024-11-12 04:48:50,105 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 04:48:50,106 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 04:48:50,106 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 04:48:50,106 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 04:48:50,111 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:48:50" (1/1) ... [2024-11-12 04:48:50,125 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:48:50" (1/1) ... [2024-11-12 04:48:50,153 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 105 [2024-11-12 04:48:50,153 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 04:48:50,154 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 04:48:50,154 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 04:48:50,154 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 04:48:50,165 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:48:50" (1/1) ... [2024-11-12 04:48:50,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:48:50" (1/1) ... [2024-11-12 04:48:50,170 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:48:50" (1/1) ... [2024-11-12 04:48:50,183 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 04:48:50,183 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:48:50" (1/1) ... [2024-11-12 04:48:50,183 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:48:50" (1/1) ... [2024-11-12 04:48:50,194 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:48:50" (1/1) ... [2024-11-12 04:48:50,197 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:48:50" (1/1) ... [2024-11-12 04:48:50,200 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:48:50" (1/1) ... [2024-11-12 04:48:50,201 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:48:50" (1/1) ... [2024-11-12 04:48:50,207 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 04:48:50,208 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 04:48:50,208 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 04:48:50,208 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 04:48:50,208 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:48:50" (1/1) ... [2024-11-12 04:48:50,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:48:50,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:48:50,242 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 04:48:50,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 04:48:50,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 04:48:50,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 04:48:50,290 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 04:48:50,290 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 04:48:50,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 04:48:50,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 04:48:50,383 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 04:48:50,385 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 04:48:50,665 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-12 04:48:50,666 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 04:48:50,681 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 04:48:50,681 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 04:48:50,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:48:50 BoogieIcfgContainer [2024-11-12 04:48:50,682 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 04:48:50,684 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 04:48:50,685 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 04:48:50,688 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 04:48:50,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:48:49" (1/3) ... [2024-11-12 04:48:50,689 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ccd511a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:48:50, skipping insertion in model container [2024-11-12 04:48:50,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:48:50" (2/3) ... [2024-11-12 04:48:50,689 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ccd511a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:48:50, skipping insertion in model container [2024-11-12 04:48:50,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:48:50" (3/3) ... [2024-11-12 04:48:50,690 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-39.i [2024-11-12 04:48:50,705 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 04:48:50,706 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 04:48:50,767 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 04:48:50,773 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;@3c079960, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 04:48:50,773 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 04:48:50,778 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-12 04:48:50,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-12 04:48:50,790 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:48:50,791 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:48:50,792 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:48:50,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:48:50,798 INFO L85 PathProgramCache]: Analyzing trace with hash 448191956, now seen corresponding path program 1 times [2024-11-12 04:48:50,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:48:50,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1868417060] [2024-11-12 04:48:50,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:48:50,825 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:48:50,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:48:50,830 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 04:48:50,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 04:48:50,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:48:50,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-12 04:48:51,008 INFO L279 TraceCheckSpWp]: Computing forward predicates...