./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-57.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-57.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 506a72b3b5e4475eed5e733962e05391d137523f1d5318aec25e1e8464914641 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:30:33,075 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:30:33,136 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 09:30:33,146 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:30:33,147 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:30:33,181 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:30:33,182 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:30:33,183 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:30:33,183 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:30:33,185 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:30:33,186 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:30:33,186 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:30:33,186 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:30:33,187 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:30:33,187 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:30:33,187 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:30:33,191 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:30:33,191 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:30:33,192 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 09:30:33,192 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:30:33,192 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:30:33,193 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:30:33,193 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:30:33,193 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:30:33,193 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:30:33,195 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:30:33,195 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:30:33,195 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:30:33,196 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:30:33,196 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:30:33,196 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:30:33,196 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:30:33,197 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:30:33,197 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:30:33,197 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:30:33,198 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:30:33,198 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 09:30:33,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 09:30:33,199 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:30:33,199 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:30:33,199 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:30:33,200 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:30:33,200 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-clean/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-clean/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 -> 506a72b3b5e4475eed5e733962e05391d137523f1d5318aec25e1e8464914641 [2024-10-11 09:30:33,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:30:33,520 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:30:33,523 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:30:33,525 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:30:33,525 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:30:33,527 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-57.i [2024-10-11 09:30:34,991 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:30:35,212 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:30:35,212 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-57.i [2024-10-11 09:30:35,221 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5df0cac6b/38c8e9f8a391422984307d8aaa0cf544/FLAG4e63651e4 [2024-10-11 09:30:35,575 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5df0cac6b/38c8e9f8a391422984307d8aaa0cf544 [2024-10-11 09:30:35,578 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:30:35,580 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:30:35,581 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:30:35,582 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:30:35,587 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:30:35,588 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:30:35" (1/1) ... [2024-10-11 09:30:35,589 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c2fc8aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:35, skipping insertion in model container [2024-10-11 09:30:35,589 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:30:35" (1/1) ... [2024-10-11 09:30:35,625 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:30:35,842 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-57.i[919,932] [2024-10-11 09:30:35,931 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:30:35,945 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:30:35,958 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-57.i[919,932] [2024-10-11 09:30:35,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:30:36,017 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:30:36,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:36 WrapperNode [2024-10-11 09:30:36,021 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:30:36,023 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:30:36,023 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:30:36,024 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:30:36,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:36" (1/1) ... [2024-10-11 09:30:36,042 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:36" (1/1) ... [2024-10-11 09:30:36,127 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 276 [2024-10-11 09:30:36,128 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:30:36,129 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:30:36,129 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:30:36,129 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:30:36,141 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:36" (1/1) ... [2024-10-11 09:30:36,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:36" (1/1) ... [2024-10-11 09:30:36,153 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:36" (1/1) ... [2024-10-11 09:30:36,189 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 09:30:36,193 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:36" (1/1) ... [2024-10-11 09:30:36,193 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:36" (1/1) ... [2024-10-11 09:30:36,214 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:36" (1/1) ... [2024-10-11 09:30:36,223 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:36" (1/1) ... [2024-10-11 09:30:36,232 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:36" (1/1) ... [2024-10-11 09:30:36,240 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:36" (1/1) ... [2024-10-11 09:30:36,253 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:30:36,255 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:30:36,256 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:30:36,256 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:30:36,257 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:36" (1/1) ... [2024-10-11 09:30:36,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:30:36,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:30:36,295 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 09:30:36,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 09:30:36,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:30:36,367 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:30:36,367 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:30:36,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 09:30:36,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:30:36,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:30:36,505 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:30:36,508 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:30:37,044 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-10-11 09:30:37,045 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:30:37,084 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:30:37,085 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 09:30:37,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:30:37 BoogieIcfgContainer [2024-10-11 09:30:37,085 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:30:37,087 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:30:37,089 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:30:37,092 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:30:37,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:30:35" (1/3) ... [2024-10-11 09:30:37,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75bd9b1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:30:37, skipping insertion in model container [2024-10-11 09:30:37,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:36" (2/3) ... [2024-10-11 09:30:37,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75bd9b1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:30:37, skipping insertion in model container [2024-10-11 09:30:37,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:30:37" (3/3) ... [2024-10-11 09:30:37,095 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-57.i [2024-10-11 09:30:37,112 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:30:37,113 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:30:37,187 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:30:37,196 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;@4da5f236, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:30:37,196 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:30:37,201 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 79 states have (on average 1.4936708860759493) internal successors, (118), 80 states have internal predecessors, (118), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 09:30:37,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-11 09:30:37,219 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:30:37,220 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 09:30:37,220 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:30:37,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:30:37,225 INFO L85 PathProgramCache]: Analyzing trace with hash -483962422, now seen corresponding path program 1 times [2024-10-11 09:30:37,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:30:37,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076508857] [2024-10-11 09:30:37,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:30:37,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:30:37,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:30:38,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:30:38,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:30:38,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:30:38,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:30:38,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:30:38,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 09:30:38,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:30:38,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 09:30:38,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:30:38,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:30:38,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:30:38,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:30:38,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 09:30:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 09:30:38,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:30:38,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 09:30:38,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:30:38,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 09:30:38,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:30:38,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 09:30:38,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:30:38,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:30:38,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:30:38,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:30:38,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 09:30:38,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:30:38,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 09:30:38,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:30:38,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:30:38,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:30:38,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 09:30:38,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-11 09:30:38,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:30:38,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076508857] [2024-10-11 09:30:38,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076508857] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:30:38,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:30:38,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:30:38,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246373622] [2024-10-11 09:30:38,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:30:38,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:30:38,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:30:38,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:30:38,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:30:38,245 INFO L87 Difference]: Start difference. First operand has 114 states, 79 states have (on average 1.4936708860759493) internal successors, (118), 80 states have internal predecessors, (118), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 09:30:38,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:30:38,330 INFO L93 Difference]: Finished difference Result 226 states and 396 transitions. [2024-10-11 09:30:38,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:30:38,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 208 [2024-10-11 09:30:38,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:30:38,347 INFO L225 Difference]: With dead ends: 226 [2024-10-11 09:30:38,347 INFO L226 Difference]: Without dead ends: 113 [2024-10-11 09:30:38,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 67 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-10-11 09:30:38,360 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 0 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:30:38,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 340 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 09:30:38,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-11 09:30:38,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-10-11 09:30:38,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 79 states have internal predecessors, (114), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 09:30:38,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 178 transitions. [2024-10-11 09:30:38,425 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 178 transitions. Word has length 208 [2024-10-11 09:30:38,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:30:38,431 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 178 transitions. [2024-10-11 09:30:38,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 09:30:38,432 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 178 transitions. [2024-10-11 09:30:38,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-11 09:30:38,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:30:38,437 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 09:30:38,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 09:30:38,438 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:30:38,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:30:38,438 INFO L85 PathProgramCache]: Analyzing trace with hash 550285063, now seen corresponding path program 1 times [2024-10-11 09:30:38,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:30:38,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858067612] [2024-10-11 09:30:38,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:30:38,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:30:38,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:30:38,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:30:38,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:30:38,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:30:38,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:30:38,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:30:38,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 09:30:38,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:30:38,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 09:30:38,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:30:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:30:38,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:30:38,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:30:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 09:30:38,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 09:30:38,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:30:38,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 09:30:38,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:30:38,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 09:30:38,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:30:38,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 09:30:38,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:30:38,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:30:38,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:30:38,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:30:38,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 09:30:38,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:30:38,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 09:30:38,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:30:38,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:30:38,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:30:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 09:30:38,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:38,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-11 09:30:38,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:30:38,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858067612] [2024-10-11 09:30:38,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858067612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:30:38,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:30:38,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:30:38,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545213359] [2024-10-11 09:30:38,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:30:38,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:30:39,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:30:39,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:30:39,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:30:39,001 INFO L87 Difference]: Start difference. First operand 113 states and 178 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 09:30:39,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:30:39,072 INFO L93 Difference]: Finished difference Result 226 states and 357 transitions. [2024-10-11 09:30:39,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:30:39,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 209 [2024-10-11 09:30:39,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:30:39,075 INFO L225 Difference]: With dead ends: 226 [2024-10-11 09:30:39,076 INFO L226 Difference]: Without dead ends: 114 [2024-10-11 09:30:39,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 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-10-11 09:30:39,079 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:30:39,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 333 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 09:30:39,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-11 09:30:39,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-10-11 09:30:39,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 79 states have internal predecessors, (114), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 09:30:39,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 178 transitions. [2024-10-11 09:30:39,096 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 178 transitions. Word has length 209 [2024-10-11 09:30:39,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:30:39,097 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 178 transitions. [2024-10-11 09:30:39,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-11 09:30:39,097 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 178 transitions. [2024-10-11 09:30:39,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-11 09:30:39,102 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:30:39,102 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 09:30:39,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 09:30:39,103 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:30:39,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:30:39,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1909888350, now seen corresponding path program 1 times [2024-10-11 09:30:39,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:30:39,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634549609] [2024-10-11 09:30:39,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:30:39,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:30:39,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:39,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:30:39,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:39,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:30:39,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:39,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:30:39,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:39,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:30:39,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:39,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:30:39,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:39,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:30:39,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:39,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 09:30:39,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:39,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:30:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:39,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 09:30:39,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:39,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:30:39,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:40,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:30:40,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:40,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:30:40,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:40,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:30:40,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:40,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 09:30:40,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:40,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 09:30:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:40,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:30:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:40,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 09:30:40,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:40,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:30:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:40,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 09:30:40,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:40,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:30:40,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:40,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 09:30:40,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:40,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:30:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:40,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:30:40,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:40,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:30:40,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:40,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:30:40,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:40,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 09:30:40,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:40,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:30:40,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:40,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 09:30:40,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:40,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:30:40,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:40,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:30:40,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:40,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:30:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:40,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 09:30:40,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:40,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-11 09:30:40,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:30:40,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634549609] [2024-10-11 09:30:40,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634549609] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:30:40,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:30:40,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 09:30:40,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072160260] [2024-10-11 09:30:40,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:30:40,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 09:30:40,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:30:40,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 09:30:40,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-11 09:30:40,140 INFO L87 Difference]: Start difference. First operand 113 states and 178 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-11 09:30:41,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:30:41,674 INFO L93 Difference]: Finished difference Result 541 states and 841 transitions. [2024-10-11 09:30:41,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 09:30:41,675 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 210 [2024-10-11 09:30:41,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:30:41,680 INFO L225 Difference]: With dead ends: 541 [2024-10-11 09:30:41,680 INFO L226 Difference]: Without dead ends: 429 [2024-10-11 09:30:41,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2024-10-11 09:30:41,683 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 1186 mSDsluCounter, 969 mSDsCounter, 0 mSdLazyCounter, 1125 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1186 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 1266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 1125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 09:30:41,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1186 Valid, 1214 Invalid, 1266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 1125 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 09:30:41,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2024-10-11 09:30:41,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 399. [2024-10-11 09:30:41,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 295 states have (on average 1.464406779661017) internal successors, (432), 297 states have internal predecessors, (432), 98 states have call successors, (98), 5 states have call predecessors, (98), 5 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2024-10-11 09:30:41,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 628 transitions. [2024-10-11 09:30:41,753 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 628 transitions. Word has length 210 [2024-10-11 09:30:41,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:30:41,755 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 628 transitions. [2024-10-11 09:30:41,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-11 09:30:41,755 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 628 transitions. [2024-10-11 09:30:41,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-11 09:30:41,760 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:30:41,760 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 09:30:41,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 09:30:41,761 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:30:41,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:30:41,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1092239900, now seen corresponding path program 1 times [2024-10-11 09:30:41,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:30:41,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675861346] [2024-10-11 09:30:41,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:30:41,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:30:41,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:42,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:30:42,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:42,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:30:42,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:42,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:30:42,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:42,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:30:42,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:42,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:30:42,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:42,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:30:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:42,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 09:30:42,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:42,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:30:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:42,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 09:30:42,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:42,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:30:42,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:42,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:30:42,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:42,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:30:42,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:42,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:30:42,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:42,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 09:30:42,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:42,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 09:30:42,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:42,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:30:42,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:42,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 09:30:42,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:42,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:30:42,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:42,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 09:30:42,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:42,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:30:42,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:42,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 09:30:42,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:42,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:30:42,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:42,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:30:42,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:42,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:30:42,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:42,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:30:42,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:42,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 09:30:42,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:42,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:30:42,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:42,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 09:30:42,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:42,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:30:42,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:42,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:30:42,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:42,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:30:42,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:42,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 09:30:42,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:42,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 6 proven. 87 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-11 09:30:42,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:30:42,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675861346] [2024-10-11 09:30:42,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675861346] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:30:42,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723432736] [2024-10-11 09:30:42,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:30:42,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:30:42,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:30:42,201 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:30:42,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 09:30:42,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:42,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 09:30:42,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:30:42,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 267 proven. 87 refuted. 0 times theorem prover too weak. 1630 trivial. 0 not checked. [2024-10-11 09:30:42,722 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:30:42,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 6 proven. 87 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-11 09:30:42,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723432736] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 09:30:43,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 09:30:43,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-10-11 09:30:43,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251457565] [2024-10-11 09:30:43,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 09:30:43,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 09:30:43,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:30:43,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 09:30:43,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-10-11 09:30:43,005 INFO L87 Difference]: Start difference. First operand 399 states and 628 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 2 states have call successors, (61), 2 states have call predecessors, (61), 4 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) [2024-10-11 09:30:43,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:30:43,428 INFO L93 Difference]: Finished difference Result 533 states and 826 transitions. [2024-10-11 09:30:43,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 09:30:43,429 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 2 states have call successors, (61), 2 states have call predecessors, (61), 4 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) Word has length 210 [2024-10-11 09:30:43,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:30:43,436 INFO L225 Difference]: With dead ends: 533 [2024-10-11 09:30:43,437 INFO L226 Difference]: Without dead ends: 421 [2024-10-11 09:30:43,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 476 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-10-11 09:30:43,442 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 86 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 09:30:43,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 562 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 09:30:43,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-10-11 09:30:43,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 415. [2024-10-11 09:30:43,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 308 states have (on average 1.4415584415584415) internal successors, (444), 310 states have internal predecessors, (444), 98 states have call successors, (98), 8 states have call predecessors, (98), 8 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2024-10-11 09:30:43,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 640 transitions. [2024-10-11 09:30:43,486 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 640 transitions. Word has length 210 [2024-10-11 09:30:43,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:30:43,487 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 640 transitions. [2024-10-11 09:30:43,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 13 states have internal predecessors, (68), 2 states have call successors, (61), 2 states have call predecessors, (61), 4 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) [2024-10-11 09:30:43,488 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 640 transitions. [2024-10-11 09:30:43,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-10-11 09:30:43,490 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:30:43,490 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 09:30:43,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 09:30:43,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:30:43,693 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:30:43,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:30:43,694 INFO L85 PathProgramCache]: Analyzing trace with hash 16146420, now seen corresponding path program 1 times [2024-10-11 09:30:43,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:30:43,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337813522] [2024-10-11 09:30:43,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:30:43,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:30:43,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:43,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:30:43,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:43,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:30:43,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:43,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:30:43,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:43,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:30:43,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:43,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:30:43,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:43,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:30:43,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:43,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 09:30:43,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:43,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:30:43,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:43,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 09:30:43,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:43,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:30:43,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:43,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:30:43,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:43,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:30:43,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:43,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:30:43,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:43,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 09:30:44,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:44,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 09:30:44,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:44,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 09:30:44,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:44,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 09:30:44,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:44,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 09:30:44,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:44,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 09:30:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:44,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:30:44,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:44,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 09:30:44,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:44,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 09:30:44,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:44,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 09:30:44,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:44,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 09:30:44,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:44,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 09:30:44,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:44,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 09:30:44,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:44,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 09:30:44,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:44,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 09:30:44,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:44,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 09:30:44,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:44,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 09:30:44,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:44,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 09:30:44,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:44,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 09:30:44,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:44,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 84 proven. 9 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-11 09:30:44,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:30:44,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337813522] [2024-10-11 09:30:44,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337813522] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:30:44,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504039642] [2024-10-11 09:30:44,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:30:44,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:30:44,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:30:44,078 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:30:44,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 09:30:44,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:30:44,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 09:30:44,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:30:44,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 423 proven. 9 refuted. 0 times theorem prover too weak. 1552 trivial. 0 not checked. [2024-10-11 09:30:44,356 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:30:44,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 84 proven. 9 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-11 09:30:44,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504039642] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 09:30:44,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 09:30:44,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-10-11 09:30:44,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566014753] [2024-10-11 09:30:44,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 09:30:44,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 09:30:44,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:30:44,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 09:30:44,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 09:30:44,592 INFO L87 Difference]: Start difference. First operand 415 states and 640 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 3 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2024-10-11 09:30:44,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:30:44,910 INFO L93 Difference]: Finished difference Result 847 states and 1294 transitions. [2024-10-11 09:30:44,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 09:30:44,911 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 3 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) Word has length 211 [2024-10-11 09:30:44,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:30:44,914 INFO L225 Difference]: With dead ends: 847 [2024-10-11 09:30:44,914 INFO L226 Difference]: Without dead ends: 433 [2024-10-11 09:30:44,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 482 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-10-11 09:30:44,916 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 293 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 09:30:44,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 329 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 09:30:44,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2024-10-11 09:30:44,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 427. [2024-10-11 09:30:44,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 317 states have (on average 1.3974763406940063) internal successors, (443), 319 states have internal predecessors, (443), 98 states have call successors, (98), 11 states have call predecessors, (98), 11 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2024-10-11 09:30:44,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 639 transitions. [2024-10-11 09:30:44,975 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 639 transitions. Word has length 211 [2024-10-11 09:30:44,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:30:44,976 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 639 transitions. [2024-10-11 09:30:44,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 3 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2024-10-11 09:30:44,976 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 639 transitions. [2024-10-11 09:30:44,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-11 09:30:44,979 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:30:44,980 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 09:30:44,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 09:30:45,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:30:45,181 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:30:45,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:30:45,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1748228567, now seen corresponding path program 1 times [2024-10-11 09:30:45,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:30:45,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511337762] [2024-10-11 09:30:45,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:30:45,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:30:45,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 09:30:45,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1446731431] [2024-10-11 09:30:45,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:30:45,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:30:45,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:30:45,311 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:30:45,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 09:30:45,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 09:30:45,653 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 09:30:45,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 09:30:45,876 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 09:30:45,877 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 09:30:45,878 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 09:30:45,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 09:30:46,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:30:46,084 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-11 09:30:46,223 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 09:30:46,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 09:30:46 BoogieIcfgContainer [2024-10-11 09:30:46,227 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 09:30:46,227 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 09:30:46,227 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 09:30:46,227 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 09:30:46,228 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:30:37" (3/4) ... [2024-10-11 09:30:46,230 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 09:30:46,231 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 09:30:46,231 INFO L158 Benchmark]: Toolchain (without parser) took 10651.72ms. Allocated memory was 163.6MB in the beginning and 239.1MB in the end (delta: 75.5MB). Free memory was 108.3MB in the beginning and 128.7MB in the end (delta: -20.4MB). Peak memory consumption was 55.1MB. Max. memory is 16.1GB. [2024-10-11 09:30:46,232 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory was 59.7MB in the beginning and 59.6MB in the end (delta: 69.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 09:30:46,232 INFO L158 Benchmark]: CACSL2BoogieTranslator took 440.61ms. Allocated memory is still 163.6MB. Free memory was 108.3MB in the beginning and 90.9MB in the end (delta: 17.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 09:30:46,233 INFO L158 Benchmark]: Boogie Procedure Inliner took 105.33ms. Allocated memory is still 163.6MB. Free memory was 90.9MB in the beginning and 130.1MB in the end (delta: -39.2MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2024-10-11 09:30:46,233 INFO L158 Benchmark]: Boogie Preprocessor took 125.40ms. Allocated memory is still 163.6MB. Free memory was 130.1MB in the beginning and 122.7MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 09:30:46,233 INFO L158 Benchmark]: RCFGBuilder took 830.19ms. Allocated memory is still 163.6MB. Free memory was 122.7MB in the beginning and 93.0MB in the end (delta: 29.6MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-11 09:30:46,233 INFO L158 Benchmark]: TraceAbstraction took 9139.57ms. Allocated memory was 163.6MB in the beginning and 239.1MB in the end (delta: 75.5MB). Free memory was 92.3MB in the beginning and 128.7MB in the end (delta: -36.3MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. [2024-10-11 09:30:46,234 INFO L158 Benchmark]: Witness Printer took 3.77ms. Allocated memory is still 239.1MB. Free memory is still 128.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 09:30:46,235 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory was 59.7MB in the beginning and 59.6MB in the end (delta: 69.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 440.61ms. Allocated memory is still 163.6MB. Free memory was 108.3MB in the beginning and 90.9MB in the end (delta: 17.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 105.33ms. Allocated memory is still 163.6MB. Free memory was 90.9MB in the beginning and 130.1MB in the end (delta: -39.2MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 125.40ms. Allocated memory is still 163.6MB. Free memory was 130.1MB in the beginning and 122.7MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 830.19ms. Allocated memory is still 163.6MB. Free memory was 122.7MB in the beginning and 93.0MB in the end (delta: 29.6MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 9139.57ms. Allocated memory was 163.6MB in the beginning and 239.1MB in the end (delta: 75.5MB). Free memory was 92.3MB in the beginning and 128.7MB in the end (delta: -36.3MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. * Witness Printer took 3.77ms. Allocated memory is still 239.1MB. Free memory is still 128.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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 someBinaryFLOATComparisonOperation at line 180, overapproximation of bitwiseOr at line 110, overapproximation of someBinaryArithmeticDOUBLEoperation at line 59, overapproximation of someUnaryDOUBLEoperation at line 111, overapproximation of someBinaryDOUBLEComparisonOperation at line 185. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 5; [L23] signed char var_1_2 = -1; [L24] signed char var_1_3 = 10; [L25] signed long int var_1_5 = 5; [L26] unsigned char var_1_6 = 0; [L27] double var_1_7 = 24.8; [L28] double var_1_8 = 500.5; [L29] double var_1_9 = 2.4; [L30] double var_1_10 = 0.4; [L31] double var_1_11 = 255.8; [L32] double var_1_12 = 50.75; [L33] unsigned char var_1_13 = 4; [L34] unsigned char var_1_14 = 200; [L35] unsigned char var_1_15 = 25; [L36] unsigned char var_1_16 = 128; [L37] unsigned char var_1_17 = 64; [L38] unsigned char var_1_18 = 32; [L39] unsigned char var_1_19 = 32; [L40] unsigned long int var_1_20 = 1; [L41] float var_1_21 = 9999999999.2; [L42] double var_1_23 = 10.875; [L43] unsigned char var_1_24 = 0; [L44] unsigned char var_1_25 = 0; [L45] float var_1_26 = 1000000000000.6; [L46] unsigned long int var_1_27 = 2609431563; [L47] float var_1_30 = 8.8; [L48] unsigned short int var_1_32 = 1; [L49] signed char var_1_36 = 64; [L50] float var_1_37 = 9.5; [L51] signed long int var_1_41 = 200; [L52] signed char var_1_42 = 2; [L53] signed long int var_1_43 = 2; [L189] isInitial = 1 [L190] FCALL initially() [L191] COND TRUE 1 [L192] FCALL updateLastVariables() [L193] CALL updateVariables() [L131] var_1_2 = __VERIFIER_nondet_char() [L132] CALL assume_abort_if_not(var_1_2 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=10, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=10, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L132] RET assume_abort_if_not(var_1_2 >= -1) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=10, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L133] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=10, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=10, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L133] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=10, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L134] var_1_3 = __VERIFIER_nondet_char() [L135] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L135] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L136] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L136] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L137] var_1_5 = __VERIFIER_nondet_long() [L138] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L138] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L139] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L139] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L140] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L140] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L141] var_1_6 = __VERIFIER_nondet_uchar() [L142] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L142] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L143] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L143] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L144] var_1_8 = __VERIFIER_nondet_double() [L145] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5, var_1_9=12/5] [L145] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5, var_1_9=12/5] [L146] var_1_9 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L147] RET assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L148] var_1_10 = __VERIFIER_nondet_double() [L149] CALL assume_abort_if_not((var_1_10 >= -230584.3009213691390e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 2305843.009213691390e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L149] RET assume_abort_if_not((var_1_10 >= -230584.3009213691390e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 2305843.009213691390e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L150] var_1_11 = __VERIFIER_nondet_double() [L151] CALL assume_abort_if_not((var_1_11 >= -115292.1504606845700e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 1152921.504606845700e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L151] RET assume_abort_if_not((var_1_11 >= -115292.1504606845700e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 1152921.504606845700e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L152] var_1_12 = __VERIFIER_nondet_double() [L153] CALL assume_abort_if_not((var_1_12 >= -115292.1504606845700e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 1152921.504606845700e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L153] RET assume_abort_if_not((var_1_12 >= -115292.1504606845700e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 1152921.504606845700e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L154] var_1_14 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_14 >= 190) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L155] RET assume_abort_if_not(var_1_14 >= 190) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L156] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L156] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L157] var_1_15 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L158] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L159] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L159] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L160] var_1_16 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_16 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L161] RET assume_abort_if_not(var_1_16 >= 127) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L162] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L162] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L163] var_1_17 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=191, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=191, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L164] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=191, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L165] CALL assume_abort_if_not(var_1_17 <= 64) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L165] RET assume_abort_if_not(var_1_17 <= 64) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L166] var_1_18 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L167] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L168] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=-255, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=-255, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L168] RET assume_abort_if_not(var_1_18 <= 63) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=-255, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L169] var_1_19 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=-255, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=-255, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L170] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=-255, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L171] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=-255, var_1_19=1, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=-255, var_1_19=1, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L171] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=-255, var_1_19=1, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L172] var_1_25 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=-255, var_1_19=1, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=-255, var_1_19=1, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L173] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=-255, var_1_19=1, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L174] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=-255, var_1_19=1, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=-255, var_1_19=1, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L174] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=-255, var_1_19=1, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L175] var_1_27 = __VERIFIER_nondet_ulong() [L176] CALL assume_abort_if_not(var_1_27 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=-255, var_1_19=1, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=4294967171, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=-255, var_1_19=1, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=4294967171, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L176] RET assume_abort_if_not(var_1_27 >= 2147483647) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=-255, var_1_19=1, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=4294967171, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L177] CALL assume_abort_if_not(var_1_27 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=-255, var_1_19=1, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=4294967171, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=-255, var_1_19=1, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=4294967171, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L177] RET assume_abort_if_not(var_1_27 <= 4294967295) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=-255, var_1_19=1, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=4294967171, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L178] var_1_37 = __VERIFIER_nondet_float() [L179] CALL assume_abort_if_not((var_1_37 >= -922337.2036854776000e+13F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854776000e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=-255, var_1_19=1, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=4294967171, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=-255, var_1_19=1, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=4294967171, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L179] RET assume_abort_if_not((var_1_37 >= -922337.2036854776000e+13F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854776000e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=-255, var_1_19=1, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=4294967171, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L180] CALL assume_abort_if_not(var_1_37 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=-255, var_1_19=1, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=4294967171, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=-255, var_1_19=1, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=4294967171, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L180] RET assume_abort_if_not(var_1_37 != 0.0F) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=-255, var_1_19=1, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=4294967171, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L193] RET updateVariables() [L194] CALL step() [L57] signed char stepLocal_0 = var_1_2; VAL [isInitial=1, stepLocal_0=0, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=-255, var_1_19=1, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=4294967171, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1, var_1_7=124/5] [L58] COND TRUE -256 <= stepLocal_0 [L59] var_1_7 = (var_1_8 + (((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) + (var_1_11 + var_1_12))) VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=-255, var_1_19=1, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=4294967171, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1] [L65] var_1_24 = var_1_25 VAL [isInitial=1, var_1_13=4, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=-255, var_1_19=1, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=4294967171, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1] [L66] COND TRUE var_1_11 <= var_1_9 [L67] var_1_13 = ((((((var_1_14 - var_1_15)) > (var_1_16)) ? ((var_1_14 - var_1_15)) : (var_1_16))) - (var_1_17 + ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) VAL [isInitial=1, var_1_13=126, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=-255, var_1_19=1, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=4294967171, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1] [L69] COND TRUE (var_1_2 - var_1_3) > (var_1_13 / var_1_5) [L70] var_1_1 = (128 - var_1_3) VAL [isInitial=1, var_1_13=126, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=-255, var_1_19=1, var_1_1=128, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=4294967171, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1] [L78] EXPR (var_1_1 / var_1_14) & var_1_16 VAL [isInitial=1, var_1_13=126, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=-255, var_1_19=1, var_1_1=128, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=4294967171, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1] [L78] COND TRUE (-1 - var_1_15) < ((var_1_1 / var_1_14) & var_1_16) [L79] EXPR var_1_14 >> var_1_15 VAL [isInitial=1, var_1_13=126, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=-255, var_1_19=1, var_1_1=128, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=4294967171, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1] [L79] COND TRUE (- ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16)))) < (var_1_14 >> var_1_15) [L80] var_1_32 = var_1_15 VAL [isInitial=1, var_1_13=126, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=-255, var_1_19=1, var_1_1=128, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=4294967171, var_1_2=0, var_1_30=44/5, var_1_32=0, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1] [L87] EXPR (var_1_2 * var_1_13) & var_1_1 VAL [isInitial=1, var_1_13=126, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=-255, var_1_19=1, var_1_1=128, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=4294967171, var_1_2=0, var_1_30=44/5, var_1_32=0, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1] [L87] signed long int stepLocal_1 = (var_1_2 * var_1_13) & var_1_1; [L88] COND FALSE !(var_1_3 < stepLocal_1) VAL [isInitial=1, var_1_13=126, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=-255, var_1_19=1, var_1_1=128, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=4294967171, var_1_2=0, var_1_30=44/5, var_1_32=0, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1] [L91] COND FALSE !(var_1_9 < ((var_1_12 / var_1_37) + var_1_9)) [L96] var_1_36 = ((((var_1_18) > ((var_1_15 - var_1_18))) ? (var_1_18) : ((var_1_15 - var_1_18)))) VAL [isInitial=1, var_1_13=126, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=-255, var_1_19=1, var_1_1=128, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=4294967171, var_1_2=0, var_1_30=44/5, var_1_32=0, var_1_36=1, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-126, var_1_6=1] [L98] var_1_42 = var_1_18 [L99] var_1_43 = var_1_17 VAL [isInitial=1, var_1_13=126, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=-255, var_1_19=1, var_1_1=128, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=4294967171, var_1_2=0, var_1_30=44/5, var_1_32=0, var_1_36=1, var_1_3=0, var_1_41=200, var_1_42=1, var_1_43=64, var_1_5=-126, var_1_6=1] [L100] EXPR var_1_1 & var_1_3 VAL [isInitial=1, var_1_13=126, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=-255, var_1_19=1, var_1_1=128, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=4294967171, var_1_2=0, var_1_30=44/5, var_1_32=0, var_1_36=1, var_1_3=0, var_1_41=200, var_1_42=1, var_1_43=64, var_1_5=-126, var_1_6=1] [L100] signed long int stepLocal_2 = var_1_1 & var_1_3; [L101] COND FALSE !((((((var_1_1) > (var_1_5)) ? (var_1_1) : (var_1_5))) + (var_1_1 / var_1_14)) <= stepLocal_2) [L108] var_1_21 = var_1_12 VAL [isInitial=1, var_1_12=2, var_1_13=126, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=-255, var_1_19=1, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=4294967171, var_1_2=0, var_1_30=44/5, var_1_32=0, var_1_36=1, var_1_3=0, var_1_41=200, var_1_42=1, var_1_43=64, var_1_5=-126, var_1_6=1] [L110] EXPR 25u | (var_1_27 - 5u) VAL [isInitial=1, var_1_12=2, var_1_13=126, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=-255, var_1_19=1, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=4294967171, var_1_2=0, var_1_30=44/5, var_1_32=0, var_1_36=1, var_1_3=0, var_1_41=200, var_1_42=1, var_1_43=64, var_1_5=-126, var_1_6=1] [L110] COND TRUE (25u | (var_1_27 - 5u)) >= var_1_5 [L111] var_1_26 = (((((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) < 0 ) ? -((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) : ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))) VAL [isInitial=1, var_1_12=2, var_1_13=126, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=-255, var_1_19=1, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=3, var_1_27=4294967171, var_1_2=0, var_1_30=44/5, var_1_32=0, var_1_36=1, var_1_3=0, var_1_41=200, var_1_42=1, var_1_43=64, var_1_5=-126, var_1_6=1, var_1_8=5] [L117] COND TRUE var_1_10 < var_1_10 [L118] var_1_30 = ((((var_1_10) > (var_1_12)) ? (var_1_10) : (var_1_12))) VAL [isInitial=1, var_1_10=4, var_1_12=2, var_1_13=126, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=-255, var_1_19=1, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=3, var_1_27=4294967171, var_1_2=0, var_1_30=4, var_1_32=0, var_1_36=1, var_1_3=0, var_1_41=200, var_1_42=1, var_1_43=64, var_1_5=-126, var_1_6=1, var_1_8=5] [L120] EXPR var_1_27 >> var_1_15 VAL [isInitial=1, var_1_10=4, var_1_12=2, var_1_13=126, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=-255, var_1_19=1, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=3, var_1_27=4294967171, var_1_2=0, var_1_30=4, var_1_32=0, var_1_36=1, var_1_3=0, var_1_41=200, var_1_42=1, var_1_43=64, var_1_5=-126, var_1_6=1, var_1_8=5] [L120] COND FALSE !((var_1_27 >> var_1_15) <= var_1_5) [L123] unsigned long int stepLocal_3 = var_1_20; VAL [isInitial=1, stepLocal_3=1, var_1_10=4, var_1_12=2, var_1_13=126, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=-255, var_1_19=1, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=3, var_1_27=4294967171, var_1_2=0, var_1_30=4, var_1_32=0, var_1_36=1, var_1_3=0, var_1_41=200, var_1_42=1, var_1_43=64, var_1_5=-126, var_1_6=1, var_1_8=5] [L124] COND TRUE var_1_1 > stepLocal_3 VAL [isInitial=1, var_1_10=4, var_1_12=2, var_1_13=126, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=-255, var_1_19=1, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=3, var_1_27=4294967171, var_1_2=0, var_1_30=4, var_1_32=0, var_1_36=1, var_1_3=0, var_1_41=200, var_1_42=1, var_1_43=64, var_1_5=-126, var_1_6=1, var_1_8=5] [L125] COND TRUE ! (! var_1_6) [L126] var_1_23 = var_1_8 VAL [isInitial=1, var_1_10=4, var_1_12=2, var_1_13=126, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=-255, var_1_19=1, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=5, var_1_24=0, var_1_25=0, var_1_26=3, var_1_27=4294967171, var_1_2=0, var_1_30=4, var_1_32=0, var_1_36=1, var_1_3=0, var_1_41=200, var_1_42=1, var_1_43=64, var_1_5=-126, var_1_6=1, var_1_8=5] [L194] RET step() [L195] CALL, EXPR property() [L185] EXPR (((((var_1_2 - var_1_3) > (var_1_13 / var_1_5)) ? (var_1_1 == ((unsigned char) (128 - var_1_3))) : ((! var_1_6) ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3)))) && ((-256 <= var_1_2) ? (var_1_7 == ((double) (var_1_8 + (((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) + (var_1_11 + var_1_12))))) : ((var_1_11 == var_1_9) ? (var_1_7 == ((double) var_1_8)) : 1))) && ((var_1_11 <= var_1_9) ? (var_1_13 == ((unsigned char) ((((((var_1_14 - var_1_15)) > (var_1_16)) ? ((var_1_14 - var_1_15)) : (var_1_16))) - (var_1_17 + ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))))) : 1)) && ((var_1_3 < ((var_1_2 * var_1_13) & var_1_1)) ? (var_1_20 == ((unsigned long int) (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))) + var_1_14))) : 1) VAL [isInitial=1, var_1_10=4, var_1_12=2, var_1_13=126, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=-255, var_1_19=1, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=5, var_1_24=0, var_1_25=0, var_1_26=3, var_1_27=4294967171, var_1_2=0, var_1_30=4, var_1_32=0, var_1_36=1, var_1_3=0, var_1_41=200, var_1_42=1, var_1_43=64, var_1_5=-126, var_1_6=1, var_1_8=5] [L185] EXPR ((((((var_1_2 - var_1_3) > (var_1_13 / var_1_5)) ? (var_1_1 == ((unsigned char) (128 - var_1_3))) : ((! var_1_6) ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3)))) && ((-256 <= var_1_2) ? (var_1_7 == ((double) (var_1_8 + (((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) + (var_1_11 + var_1_12))))) : ((var_1_11 == var_1_9) ? (var_1_7 == ((double) var_1_8)) : 1))) && ((var_1_11 <= var_1_9) ? (var_1_13 == ((unsigned char) ((((((var_1_14 - var_1_15)) > (var_1_16)) ? ((var_1_14 - var_1_15)) : (var_1_16))) - (var_1_17 + ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))))) : 1)) && ((var_1_3 < ((var_1_2 * var_1_13) & var_1_1)) ? (var_1_20 == ((unsigned long int) (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))) + var_1_14))) : 1)) && (((((((var_1_1) > (var_1_5)) ? (var_1_1) : (var_1_5))) + (var_1_1 / var_1_14)) <= (var_1_1 & var_1_3)) ? (var_1_6 ? (var_1_21 == ((float) var_1_12)) : (var_1_21 == ((float) var_1_10))) : (var_1_21 == ((float) var_1_12))) VAL [isInitial=1, var_1_10=4, var_1_12=2, var_1_13=126, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=-255, var_1_19=1, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=5, var_1_24=0, var_1_25=0, var_1_26=3, var_1_27=4294967171, var_1_2=0, var_1_30=4, var_1_32=0, var_1_36=1, var_1_3=0, var_1_41=200, var_1_42=1, var_1_43=64, var_1_5=-126, var_1_6=1, var_1_8=5] [L185-L186] return (((((((var_1_2 - var_1_3) > (var_1_13 / var_1_5)) ? (var_1_1 == ((unsigned char) (128 - var_1_3))) : ((! var_1_6) ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3)))) && ((-256 <= var_1_2) ? (var_1_7 == ((double) (var_1_8 + (((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) + (var_1_11 + var_1_12))))) : ((var_1_11 == var_1_9) ? (var_1_7 == ((double) var_1_8)) : 1))) && ((var_1_11 <= var_1_9) ? (var_1_13 == ((unsigned char) ((((((var_1_14 - var_1_15)) > (var_1_16)) ? ((var_1_14 - var_1_15)) : (var_1_16))) - (var_1_17 + ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))))) : 1)) && ((var_1_3 < ((var_1_2 * var_1_13) & var_1_1)) ? (var_1_20 == ((unsigned long int) (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))) + var_1_14))) : 1)) && (((((((var_1_1) > (var_1_5)) ? (var_1_1) : (var_1_5))) + (var_1_1 / var_1_14)) <= (var_1_1 & var_1_3)) ? (var_1_6 ? (var_1_21 == ((float) var_1_12)) : (var_1_21 == ((float) var_1_10))) : (var_1_21 == ((float) var_1_12)))) && ((var_1_1 > var_1_20) ? ((! (! var_1_6)) ? (var_1_23 == ((double) var_1_8)) : 1) : 1) ; [L195] RET, EXPR property() [L195] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=4, var_1_12=2, var_1_13=126, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=-255, var_1_19=1, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=5, var_1_24=0, var_1_25=0, var_1_26=3, var_1_27=4294967171, var_1_2=0, var_1_30=4, var_1_32=0, var_1_36=1, var_1_3=0, var_1_41=200, var_1_42=1, var_1_43=64, var_1_5=-126, var_1_6=1, var_1_8=5] [L19] reach_error() VAL [isInitial=1, var_1_10=4, var_1_12=2, var_1_13=126, var_1_14=190, var_1_15=0, var_1_16=191, var_1_17=-1216, var_1_18=-255, var_1_19=1, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=5, var_1_24=0, var_1_25=0, var_1_26=3, var_1_27=4294967171, var_1_2=0, var_1_30=4, var_1_32=0, var_1_36=1, var_1_3=0, var_1_41=200, var_1_42=1, var_1_43=64, var_1_5=-126, var_1_6=1, var_1_8=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 114 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.9s, OverallIterations: 6, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1595 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1565 mSDsluCounter, 2778 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1932 mSDsCounter, 266 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1858 IncrementalHoareTripleChecker+Invalid, 2124 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 266 mSolverCounterUnsat, 846 mSDtfsCounter, 1858 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1206 GetRequests, 1163 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=427occurred in iteration=5, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 43 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 1895 NumberOfCodeBlocks, 1895 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1881 ConstructedInterpolants, 0 QuantifiedInterpolants, 3922 SizeOfPredicates, 2 NumberOfNonLiveVariables, 937 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 17568/17856 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 09:30:46,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-57.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 506a72b3b5e4475eed5e733962e05391d137523f1d5318aec25e1e8464914641 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:30:48,487 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:30:48,578 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 09:30:48,583 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:30:48,584 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:30:48,619 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:30:48,620 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:30:48,620 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:30:48,621 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:30:48,625 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:30:48,625 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:30:48,625 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:30:48,626 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:30:48,626 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:30:48,626 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:30:48,627 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:30:48,627 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:30:48,627 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:30:48,627 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:30:48,628 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:30:48,628 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:30:48,630 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:30:48,630 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:30:48,630 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 09:30:48,631 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 09:30:48,631 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:30:48,631 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 09:30:48,631 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:30:48,631 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:30:48,632 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:30:48,632 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:30:48,632 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:30:48,632 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:30:48,640 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:30:48,640 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:30:48,641 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:30:48,641 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:30:48,641 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:30:48,641 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 09:30:48,641 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 09:30:48,642 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:30:48,643 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:30:48,643 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:30:48,643 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:30:48,643 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 09:30:48,643 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-clean/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-clean/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 -> 506a72b3b5e4475eed5e733962e05391d137523f1d5318aec25e1e8464914641 [2024-10-11 09:30:48,973 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:30:49,002 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:30:49,007 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:30:49,008 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:30:49,009 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:30:49,010 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-57.i [2024-10-11 09:30:50,516 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:30:50,765 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:30:50,769 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-57.i [2024-10-11 09:30:50,783 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/723d2e10b/e85ba755dd354e12a078c30cd7180038/FLAGf686e62dd [2024-10-11 09:30:50,800 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/723d2e10b/e85ba755dd354e12a078c30cd7180038 [2024-10-11 09:30:50,803 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:30:50,805 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:30:50,806 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:30:50,806 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:30:50,812 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:30:50,813 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:30:50" (1/1) ... [2024-10-11 09:30:50,814 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26c9e2e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:50, skipping insertion in model container [2024-10-11 09:30:50,814 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:30:50" (1/1) ... [2024-10-11 09:30:50,849 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:30:51,026 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-57.i[919,932] [2024-10-11 09:30:51,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:30:51,137 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:30:51,149 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-57.i[919,932] [2024-10-11 09:30:51,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:30:51,236 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:30:51,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:51 WrapperNode [2024-10-11 09:30:51,237 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:30:51,239 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:30:51,239 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:30:51,239 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:30:51,246 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:51" (1/1) ... [2024-10-11 09:30:51,264 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:51" (1/1) ... [2024-10-11 09:30:51,305 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 197 [2024-10-11 09:30:51,306 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:30:51,307 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:30:51,307 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:30:51,307 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:30:51,322 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:51" (1/1) ... [2024-10-11 09:30:51,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:51" (1/1) ... [2024-10-11 09:30:51,327 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:51" (1/1) ... [2024-10-11 09:30:51,342 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 09:30:51,343 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:51" (1/1) ... [2024-10-11 09:30:51,343 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:51" (1/1) ... [2024-10-11 09:30:51,355 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:51" (1/1) ... [2024-10-11 09:30:51,359 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:51" (1/1) ... [2024-10-11 09:30:51,364 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:51" (1/1) ... [2024-10-11 09:30:51,366 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:51" (1/1) ... [2024-10-11 09:30:51,377 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:30:51,381 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:30:51,381 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:30:51,382 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:30:51,383 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:51" (1/1) ... [2024-10-11 09:30:51,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:30:51,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:30:51,421 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 09:30:51,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 09:30:51,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:30:51,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 09:30:51,468 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:30:51,468 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:30:51,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:30:51,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:30:51,559 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:30:51,562 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:31:08,257 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-10-11 09:31:08,258 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:31:08,313 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:31:08,313 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 09:31:08,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:31:08 BoogieIcfgContainer [2024-10-11 09:31:08,314 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:31:08,317 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:31:08,317 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:31:08,320 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:31:08,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:30:50" (1/3) ... [2024-10-11 09:31:08,322 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16066051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:31:08, skipping insertion in model container [2024-10-11 09:31:08,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:30:51" (2/3) ... [2024-10-11 09:31:08,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16066051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:31:08, skipping insertion in model container [2024-10-11 09:31:08,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:31:08" (3/3) ... [2024-10-11 09:31:08,326 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-57.i [2024-10-11 09:31:08,342 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:31:08,343 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:31:08,408 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:31:08,414 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;@e17d2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:31:08,414 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:31:08,417 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 50 states have (on average 1.46) internal successors, (73), 51 states have internal predecessors, (73), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 09:31:08,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-11 09:31:08,429 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:31:08,430 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 09:31:08,430 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:31:08,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:31:08,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1176466105, now seen corresponding path program 1 times [2024-10-11 09:31:08,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:31:08,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [429467953] [2024-10-11 09:31:08,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:31:08,450 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:31:08,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:31:08,453 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 09:31:08,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 09:31:09,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:09,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 09:31:09,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:31:09,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 942 proven. 0 refuted. 0 times theorem prover too weak. 1042 trivial. 0 not checked. [2024-10-11 09:31:09,748 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:31:09,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:31:09,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [429467953] [2024-10-11 09:31:09,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [429467953] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:31:09,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:31:09,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:31:09,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747247126] [2024-10-11 09:31:09,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:31:09,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 09:31:09,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:31:09,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 09:31:09,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:31:09,782 INFO L87 Difference]: Start difference. First operand has 85 states, 50 states have (on average 1.46) internal successors, (73), 51 states have internal predecessors, (73), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-11 09:31:13,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:31:13,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:31:13,957 INFO L93 Difference]: Finished difference Result 166 states and 302 transitions. [2024-10-11 09:31:13,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 09:31:13,997 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 198 [2024-10-11 09:31:13,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:31:14,003 INFO L225 Difference]: With dead ends: 166 [2024-10-11 09:31:14,003 INFO L226 Difference]: Without dead ends: 82 [2024-10-11 09:31:14,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:31:14,008 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:31:14,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2024-10-11 09:31:14,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-11 09:31:14,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-11 09:31:14,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 09:31:14,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 127 transitions. [2024-10-11 09:31:14,054 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 127 transitions. Word has length 198 [2024-10-11 09:31:14,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:31:14,054 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 127 transitions. [2024-10-11 09:31:14,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-11 09:31:14,055 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 127 transitions. [2024-10-11 09:31:14,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-11 09:31:14,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:31:14,064 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 09:31:14,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 09:31:14,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:31:14,265 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:31:14,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:31:14,266 INFO L85 PathProgramCache]: Analyzing trace with hash 2035859678, now seen corresponding path program 1 times [2024-10-11 09:31:14,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:31:14,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2051276899] [2024-10-11 09:31:14,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:31:14,268 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:31:14,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:31:14,271 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 09:31:14,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 09:31:15,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:31:16,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 09:31:16,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:31:45,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1124 proven. 204 refuted. 0 times theorem prover too weak. 656 trivial. 0 not checked. [2024-10-11 09:31:45,151 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:31:53,167 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:31:53,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2051276899] [2024-10-11 09:31:53,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2051276899] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:31:53,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [895658036] [2024-10-11 09:31:53,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:31:53,169 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 09:31:53,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 09:31:53,173 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 09:31:53,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process