./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-49.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-49.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 02fd9ca01e9b4cf3bb802fdecc600f36b127dae39ec959fa79aabe6d1e914ff2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:22:02,073 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:22:02,144 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 03:22:02,147 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:22:02,149 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:22:02,169 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:22:02,170 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:22:02,170 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:22:02,171 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:22:02,172 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:22:02,174 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:22:02,174 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:22:02,175 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:22:02,175 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:22:02,175 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:22:02,175 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:22:02,175 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:22:02,176 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:22:02,176 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 03:22:02,176 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:22:02,176 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:22:02,178 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:22:02,178 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:22:02,178 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:22:02,178 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:22:02,178 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:22:02,179 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:22:02,179 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:22:02,179 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:22:02,179 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:22:02,179 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:22:02,179 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:22:02,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:22:02,180 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:22:02,180 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:22:02,180 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:22:02,180 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 03:22:02,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 03:22:02,181 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:22:02,181 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:22:02,181 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:22:02,182 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:22:02,182 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 02fd9ca01e9b4cf3bb802fdecc600f36b127dae39ec959fa79aabe6d1e914ff2 [2024-11-10 03:22:02,366 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:22:02,389 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:22:02,392 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:22:02,393 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:22:02,393 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:22:02,394 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-49.i [2024-11-10 03:22:03,649 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:22:03,793 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:22:03,794 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-49.i [2024-11-10 03:22:03,804 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb6dd39e0/7cf6e43289204851ba14e0f0ef0bb506/FLAG5049ff91b [2024-11-10 03:22:03,814 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb6dd39e0/7cf6e43289204851ba14e0f0ef0bb506 [2024-11-10 03:22:03,816 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:22:03,817 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:22:03,818 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:22:03,818 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:22:03,823 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:22:03,823 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:22:03" (1/1) ... [2024-11-10 03:22:03,824 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48149b52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:03, skipping insertion in model container [2024-11-10 03:22:03,824 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:22:03" (1/1) ... [2024-11-10 03:22:03,842 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:22:03,978 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-49.i[913,926] [2024-11-10 03:22:04,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:22:04,045 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:22:04,054 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-49.i[913,926] [2024-11-10 03:22:04,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:22:04,107 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:22:04,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:04 WrapperNode [2024-11-10 03:22:04,109 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:22:04,110 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:22:04,111 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:22:04,111 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:22:04,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:04" (1/1) ... [2024-11-10 03:22:04,127 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:04" (1/1) ... [2024-11-10 03:22:04,157 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 190 [2024-11-10 03:22:04,157 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:22:04,158 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:22:04,159 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:22:04,159 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:22:04,166 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:04" (1/1) ... [2024-11-10 03:22:04,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:04" (1/1) ... [2024-11-10 03:22:04,169 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:04" (1/1) ... [2024-11-10 03:22:04,185 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 03:22:04,186 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:04" (1/1) ... [2024-11-10 03:22:04,186 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:04" (1/1) ... [2024-11-10 03:22:04,195 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:04" (1/1) ... [2024-11-10 03:22:04,196 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:04" (1/1) ... [2024-11-10 03:22:04,197 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:04" (1/1) ... [2024-11-10 03:22:04,198 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:04" (1/1) ... [2024-11-10 03:22:04,200 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:22:04,201 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:22:04,201 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:22:04,201 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:22:04,203 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:04" (1/1) ... [2024-11-10 03:22:04,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:22:04,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:22:04,233 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 03:22:04,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 03:22:04,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:22:04,272 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:22:04,272 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:22:04,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 03:22:04,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:22:04,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:22:04,363 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:22:04,364 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:22:04,629 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L144: havoc property_#t~bitwise23#1;havoc property_#t~short24#1; [2024-11-10 03:22:04,666 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-10 03:22:04,666 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:22:04,688 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:22:04,689 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:22:04,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:22:04 BoogieIcfgContainer [2024-11-10 03:22:04,690 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:22:04,692 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:22:04,693 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:22:04,695 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:22:04,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:22:03" (1/3) ... [2024-11-10 03:22:04,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@585aab1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:22:04, skipping insertion in model container [2024-11-10 03:22:04,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:04" (2/3) ... [2024-11-10 03:22:04,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@585aab1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:22:04, skipping insertion in model container [2024-11-10 03:22:04,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:22:04" (3/3) ... [2024-11-10 03:22:04,698 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-49.i [2024-11-10 03:22:04,711 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:22:04,712 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:22:04,754 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:22:04,759 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;@7adc51ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:22:04,760 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:22:04,764 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 58 states have internal predecessors, (77), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-10 03:22:04,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-10 03:22:04,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:22:04,780 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:22:04,780 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:22:04,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:22:04,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1117524055, now seen corresponding path program 1 times [2024-11-10 03:22:04,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:22:04,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247320279] [2024-11-10 03:22:04,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:22:04,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:22:04,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:22:05,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:22:05,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:22:05,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:22:05,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:22:05,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:22:05,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:22:05,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:22:05,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:22:05,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:22:05,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:22:05,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:22:05,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:22:05,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:22:05,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:22:05,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:22:05,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 03:22:05,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 03:22:05,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 03:22:05,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 03:22:05,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 03:22:05,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 03:22:05,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 03:22:05,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 03:22:05,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 03:22:05,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 03:22:05,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 03:22:05,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 03:22:05,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 03:22:05,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 03:22:05,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 03:22:05,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-10 03:22:05,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-10 03:22:05,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-10 03:22:05,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:22:05,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247320279] [2024-11-10 03:22:05,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247320279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:22:05,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:22:05,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:22:05,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073502622] [2024-11-10 03:22:05,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:22:05,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:22:05,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:22:05,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:22:05,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:22:05,232 INFO L87 Difference]: Start difference. First operand has 93 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 58 states have internal predecessors, (77), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-10 03:22:05,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:22:05,270 INFO L93 Difference]: Finished difference Result 177 states and 310 transitions. [2024-11-10 03:22:05,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:22:05,272 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 203 [2024-11-10 03:22:05,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:22:05,278 INFO L225 Difference]: With dead ends: 177 [2024-11-10 03:22:05,278 INFO L226 Difference]: Without dead ends: 87 [2024-11-10 03:22:05,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:22:05,288 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:22:05,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:22:05,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-10 03:22:05,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-10 03:22:05,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 52 states have internal predecessors, (66), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-10 03:22:05,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 132 transitions. [2024-11-10 03:22:05,329 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 132 transitions. Word has length 203 [2024-11-10 03:22:05,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:22:05,329 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 132 transitions. [2024-11-10 03:22:05,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-10 03:22:05,330 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 132 transitions. [2024-11-10 03:22:05,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-10 03:22:05,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:22:05,333 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:22:05,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 03:22:05,334 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:22:05,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:22:05,335 INFO L85 PathProgramCache]: Analyzing trace with hash -465967762, now seen corresponding path program 1 times [2024-11-10 03:22:05,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:22:05,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17165818] [2024-11-10 03:22:05,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:22:05,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:22:05,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:22:05,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:22:05,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:22:05,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:22:05,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:22:05,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:22:05,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:22:05,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:22:05,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:22:05,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:22:05,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:22:05,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:22:05,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:22:05,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:22:05,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:22:05,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:22:05,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 03:22:05,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 03:22:05,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 03:22:05,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 03:22:05,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 03:22:05,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 03:22:05,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 03:22:05,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 03:22:05,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 03:22:05,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 03:22:05,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 03:22:05,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 03:22:05,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 03:22:05,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 03:22:05,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 03:22:05,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-10 03:22:05,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-10 03:22:05,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:05,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-10 03:22:05,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:22:05,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17165818] [2024-11-10 03:22:05,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17165818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:22:05,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:22:05,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 03:22:05,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785515157] [2024-11-10 03:22:05,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:22:05,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 03:22:05,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:22:05,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 03:22:05,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 03:22:05,786 INFO L87 Difference]: Start difference. First operand 87 states and 132 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 03:22:05,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:22:05,822 INFO L93 Difference]: Finished difference Result 172 states and 263 transitions. [2024-11-10 03:22:05,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 03:22:05,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 203 [2024-11-10 03:22:05,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:22:05,825 INFO L225 Difference]: With dead ends: 172 [2024-11-10 03:22:05,827 INFO L226 Difference]: Without dead ends: 88 [2024-11-10 03:22:05,828 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-11-10 03:22:05,828 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:22:05,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 253 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:22:05,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-10 03:22:05,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-10 03:22:05,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 53 states have internal predecessors, (67), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-10 03:22:05,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 133 transitions. [2024-11-10 03:22:05,842 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 133 transitions. Word has length 203 [2024-11-10 03:22:05,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:22:05,843 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 133 transitions. [2024-11-10 03:22:05,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-10 03:22:05,843 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 133 transitions. [2024-11-10 03:22:05,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-10 03:22:05,848 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:22:05,848 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:22:05,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 03:22:05,849 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:22:05,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:22:05,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1519469996, now seen corresponding path program 1 times [2024-11-10 03:22:05,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:22:05,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568964686] [2024-11-10 03:22:05,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:22:05,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:22:05,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:06,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:22:06,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:06,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:22:06,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:06,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:22:06,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:06,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:22:06,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:06,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:22:06,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:06,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:22:06,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:06,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:22:06,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:06,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:22:06,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:06,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:22:06,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:06,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:22:06,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:06,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:22:06,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:06,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:22:06,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:06,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:22:06,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:06,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:22:06,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:06,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:22:06,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:06,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:22:06,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:06,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 03:22:06,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:06,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 03:22:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:06,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 03:22:06,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:06,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 03:22:06,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:06,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 03:22:06,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:06,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 03:22:06,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:06,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 03:22:06,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:06,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 03:22:06,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:06,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 03:22:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:06,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 03:22:06,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:06,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 03:22:06,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:06,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 03:22:06,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:06,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 03:22:06,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:06,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 03:22:06,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:06,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 03:22:06,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:06,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-10 03:22:06,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:06,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-10 03:22:06,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:06,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 54 proven. 42 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-10 03:22:06,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:22:06,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568964686] [2024-11-10 03:22:06,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568964686] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 03:22:06,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660475273] [2024-11-10 03:22:06,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:22:06,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:22:06,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:22:06,223 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 03:22:06,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 03:22:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:06,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 03:22:06,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:22:06,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1076 proven. 42 refuted. 0 times theorem prover too weak. 994 trivial. 0 not checked. [2024-11-10 03:22:06,581 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 03:22:06,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 54 proven. 42 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-10 03:22:06,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660475273] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 03:22:06,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 03:22:06,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2024-11-10 03:22:06,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416602875] [2024-11-10 03:22:06,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 03:22:06,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 03:22:06,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:22:06,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 03:22:06,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 03:22:06,826 INFO L87 Difference]: Start difference. First operand 88 states and 133 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2024-11-10 03:22:07,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:22:07,105 INFO L93 Difference]: Finished difference Result 206 states and 305 transitions. [2024-11-10 03:22:07,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 03:22:07,106 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) Word has length 204 [2024-11-10 03:22:07,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:22:07,108 INFO L225 Difference]: With dead ends: 206 [2024-11-10 03:22:07,108 INFO L226 Difference]: Without dead ends: 121 [2024-11-10 03:22:07,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 469 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2024-11-10 03:22:07,109 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 145 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 03:22:07,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 246 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 03:22:07,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-10 03:22:07,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 96. [2024-11-10 03:22:07,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 60 states have (on average 1.25) internal successors, (75), 60 states have internal predecessors, (75), 33 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-10 03:22:07,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 141 transitions. [2024-11-10 03:22:07,120 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 141 transitions. Word has length 204 [2024-11-10 03:22:07,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:22:07,121 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 141 transitions. [2024-11-10 03:22:07,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2024-11-10 03:22:07,121 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 141 transitions. [2024-11-10 03:22:07,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-10 03:22:07,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:22:07,123 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:22:07,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 03:22:07,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:22:07,324 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:22:07,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:22:07,325 INFO L85 PathProgramCache]: Analyzing trace with hash -902781034, now seen corresponding path program 1 times [2024-11-10 03:22:07,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:22:07,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481207702] [2024-11-10 03:22:07,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:22:07,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:22:07,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 03:22:07,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [278306099] [2024-11-10 03:22:07,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:22:07,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:22:07,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:22:07,408 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 03:22:07,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 03:22:07,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:22:07,513 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 03:22:07,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:22:07,638 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 03:22:07,638 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 03:22:07,639 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 03:22:07,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 03:22:07,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-10 03:22:07,847 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-10 03:22:07,948 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 03:22:07,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:22:07 BoogieIcfgContainer [2024-11-10 03:22:07,951 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 03:22:07,951 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 03:22:07,951 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 03:22:07,951 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 03:22:07,952 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:22:04" (3/4) ... [2024-11-10 03:22:07,954 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 03:22:07,955 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 03:22:07,956 INFO L158 Benchmark]: Toolchain (without parser) took 4138.46ms. Allocated memory was 153.1MB in the beginning and 234.9MB in the end (delta: 81.8MB). Free memory was 104.5MB in the beginning and 179.3MB in the end (delta: -74.7MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. [2024-11-10 03:22:07,956 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 153.1MB. Free memory is still 112.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:22:07,956 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.70ms. Allocated memory is still 153.1MB. Free memory was 104.5MB in the beginning and 87.7MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 03:22:07,956 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.21ms. Allocated memory is still 153.1MB. Free memory was 87.7MB in the beginning and 83.6MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 03:22:07,956 INFO L158 Benchmark]: Boogie Preprocessor took 42.13ms. Allocated memory is still 153.1MB. Free memory was 83.6MB in the beginning and 78.4MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 03:22:07,957 INFO L158 Benchmark]: IcfgBuilder took 488.44ms. Allocated memory was 153.1MB in the beginning and 234.9MB in the end (delta: 81.8MB). Free memory was 78.4MB in the beginning and 185.8MB in the end (delta: -107.3MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2024-11-10 03:22:07,957 INFO L158 Benchmark]: TraceAbstraction took 3258.66ms. Allocated memory is still 234.9MB. Free memory was 184.7MB in the beginning and 179.3MB in the end (delta: 5.4MB). Peak memory consumption was 121.8MB. Max. memory is 16.1GB. [2024-11-10 03:22:07,957 INFO L158 Benchmark]: Witness Printer took 4.18ms. Allocated memory is still 234.9MB. Free memory is still 179.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:22:07,958 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 153.1MB. Free memory is still 112.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 291.70ms. Allocated memory is still 153.1MB. Free memory was 104.5MB in the beginning and 87.7MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.21ms. Allocated memory is still 153.1MB. Free memory was 87.7MB in the beginning and 83.6MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.13ms. Allocated memory is still 153.1MB. Free memory was 83.6MB in the beginning and 78.4MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 488.44ms. Allocated memory was 153.1MB in the beginning and 234.9MB in the end (delta: 81.8MB). Free memory was 78.4MB in the beginning and 185.8MB in the end (delta: -107.3MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. * TraceAbstraction took 3258.66ms. Allocated memory is still 234.9MB. Free memory was 184.7MB in the beginning and 179.3MB in the end (delta: 5.4MB). Peak memory consumption was 121.8MB. Max. memory is 16.1GB. * Witness Printer took 4.18ms. Allocated memory is still 234.9MB. Free memory is still 179.3MB. 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 144, overapproximation of someBinaryDOUBLEComparisonOperation at line 144. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 10; [L23] unsigned char var_1_2 = 0; [L24] unsigned long int var_1_3 = 3171453299; [L25] unsigned long int var_1_4 = 2038274679; [L26] unsigned long int var_1_5 = 1375699353; [L27] unsigned long int var_1_6 = 10; [L28] unsigned long int var_1_7 = 16; [L29] unsigned short int var_1_8 = 16; [L30] unsigned short int var_1_9 = 128; [L31] unsigned short int var_1_10 = 1; [L32] unsigned short int var_1_11 = 100; [L33] unsigned char var_1_12 = 1; [L34] unsigned char var_1_13 = 1; [L35] double var_1_14 = 64.45; [L36] float var_1_15 = 31.15; [L37] float var_1_16 = 16.4; [L38] double var_1_17 = 100.625; [L39] double var_1_18 = 128.1; [L40] unsigned char var_1_19 = 1; [L41] unsigned char var_1_20 = 8; [L42] unsigned char var_1_21 = 100; [L43] unsigned char var_1_22 = 0; [L44] signed char var_1_23 = 2; [L45] unsigned char var_1_24 = 0; VAL [isInitial=0, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=0, var_1_3=3171453299, var_1_4=2038274679, var_1_5=1375699353, var_1_6=10, var_1_7=16, var_1_8=16, var_1_9=128] [L148] isInitial = 1 [L149] FCALL initially() [L150] COND TRUE 1 [L151] FCALL updateLastVariables() [L152] CALL updateVariables() [L89] var_1_2 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=3171453299, var_1_4=2038274679, var_1_5=1375699353, var_1_6=10, var_1_7=16, var_1_8=16, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=3171453299, var_1_4=2038274679, var_1_5=1375699353, var_1_6=10, var_1_7=16, var_1_8=16, var_1_9=128] [L90] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=3171453299, var_1_4=2038274679, var_1_5=1375699353, var_1_6=10, var_1_7=16, var_1_8=16, var_1_9=128] [L91] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=3171453299, var_1_4=2038274679, var_1_5=1375699353, var_1_6=10, var_1_7=16, var_1_8=16, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=3171453299, var_1_4=2038274679, var_1_5=1375699353, var_1_6=10, var_1_7=16, var_1_8=16, var_1_9=128] [L91] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=3171453299, var_1_4=2038274679, var_1_5=1375699353, var_1_6=10, var_1_7=16, var_1_8=16, var_1_9=128] [L92] var_1_3 = __VERIFIER_nondet_ulong() [L93] CALL assume_abort_if_not(var_1_3 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=2038274679, var_1_5=1375699353, var_1_6=10, var_1_7=16, var_1_8=16, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=2038274679, var_1_5=1375699353, var_1_6=10, var_1_7=16, var_1_8=16, var_1_9=128] [L93] RET assume_abort_if_not(var_1_3 >= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=2038274679, var_1_5=1375699353, var_1_6=10, var_1_7=16, var_1_8=16, var_1_9=128] [L94] CALL assume_abort_if_not(var_1_3 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=2038274679, var_1_5=1375699353, var_1_6=10, var_1_7=16, var_1_8=16, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=2038274679, var_1_5=1375699353, var_1_6=10, var_1_7=16, var_1_8=16, var_1_9=128] [L94] RET assume_abort_if_not(var_1_3 <= 4294967294) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=2038274679, var_1_5=1375699353, var_1_6=10, var_1_7=16, var_1_8=16, var_1_9=128] [L95] var_1_4 = __VERIFIER_nondet_ulong() [L96] CALL assume_abort_if_not(var_1_4 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=1375699353, var_1_6=10, var_1_7=16, var_1_8=16, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=1375699353, var_1_6=10, var_1_7=16, var_1_8=16, var_1_9=128] [L96] RET assume_abort_if_not(var_1_4 >= 1073741823) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=1375699353, var_1_6=10, var_1_7=16, var_1_8=16, var_1_9=128] [L97] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=1375699353, var_1_6=10, var_1_7=16, var_1_8=16, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=1375699353, var_1_6=10, var_1_7=16, var_1_8=16, var_1_9=128] [L97] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=1375699353, var_1_6=10, var_1_7=16, var_1_8=16, var_1_9=128] [L98] var_1_5 = __VERIFIER_nondet_ulong() [L99] CALL assume_abort_if_not(var_1_5 >= 1073741824) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=10, var_1_7=16, var_1_8=16, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=10, var_1_7=16, var_1_8=16, var_1_9=128] [L99] RET assume_abort_if_not(var_1_5 >= 1073741824) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=10, var_1_7=16, var_1_8=16, var_1_9=128] [L100] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=10, var_1_7=16, var_1_8=16, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=10, var_1_7=16, var_1_8=16, var_1_9=128] [L100] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=10, var_1_7=16, var_1_8=16, var_1_9=128] [L101] var_1_6 = __VERIFIER_nondet_ulong() [L102] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_7=16, var_1_8=16, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_7=16, var_1_8=16, var_1_9=128] [L102] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_7=16, var_1_8=16, var_1_9=128] [L103] CALL assume_abort_if_not(var_1_6 <= 1073741824) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=16, var_1_8=16, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=16, var_1_8=16, var_1_9=128] [L103] RET assume_abort_if_not(var_1_6 <= 1073741824) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=16, var_1_8=16, var_1_9=128] [L104] var_1_7 = __VERIFIER_nondet_ulong() [L105] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_8=16, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_8=16, var_1_9=128] [L105] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_8=16, var_1_9=128] [L106] CALL assume_abort_if_not(var_1_7 <= 1073741824) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=128] [L106] RET assume_abort_if_not(var_1_7 <= 1073741824) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=128] [L107] var_1_9 = __VERIFIER_nondet_ushort() [L108] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16] [L108] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16] [L109] CALL assume_abort_if_not(var_1_9 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L109] RET assume_abort_if_not(var_1_9 <= 32767) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L110] var_1_10 = __VERIFIER_nondet_ushort() [L111] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L111] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L112] CALL assume_abort_if_not(var_1_10 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L112] RET assume_abort_if_not(var_1_10 <= 32767) VAL [isInitial=1, var_1_10=32767, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L113] var_1_11 = __VERIFIER_nondet_ushort() [L114] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L114] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=32767, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L115] CALL assume_abort_if_not(var_1_11 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L115] RET assume_abort_if_not(var_1_11 <= 16383) VAL [isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L116] var_1_13 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L117] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L118] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L118] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L119] var_1_15 = __VERIFIER_nondet_float() [L120] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L120] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L121] var_1_16 = __VERIFIER_nondet_float() [L122] CALL assume_abort_if_not((var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L122] RET assume_abort_if_not((var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L123] var_1_17 = __VERIFIER_nondet_double() [L124] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L124] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L125] var_1_18 = __VERIFIER_nondet_double() [L126] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L126] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L127] var_1_20 = __VERIFIER_nondet_uchar() [L128] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L128] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L129] CALL assume_abort_if_not(var_1_20 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L129] RET assume_abort_if_not(var_1_20 <= 254) VAL [isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L130] var_1_21 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L131] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L132] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L132] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L133] var_1_23 = __VERIFIER_nondet_char() [L134] CALL assume_abort_if_not(var_1_23 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L134] RET assume_abort_if_not(var_1_23 >= -128) VAL [isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L135] CALL assume_abort_if_not(var_1_23 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L135] RET assume_abort_if_not(var_1_23 <= 127) VAL [isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L136] CALL assume_abort_if_not(var_1_23 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L136] RET assume_abort_if_not(var_1_23 != 0) VAL [isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L137] var_1_24 = __VERIFIER_nondet_uchar() [L138] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L138] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L139] CALL assume_abort_if_not(var_1_24 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L139] RET assume_abort_if_not(var_1_24 <= 0) VAL [isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L152] RET updateVariables() [L153] CALL step() [L49] COND TRUE \read(var_1_2) [L50] var_1_1 = (((((var_1_3) > ((var_1_4 + var_1_5))) ? (var_1_3) : ((var_1_4 + var_1_5)))) - (((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7))) + 256u)) VAL [isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=2147483391, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=-32769] [L52] var_1_8 = ((((25) > ((((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) + (100 + var_1_11)))) ? (25) : ((((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) + (100 + var_1_11))))) VAL [isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=2147483391, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=32867, var_1_9=-32769] [L53] COND FALSE !(! var_1_2) [L58] var_1_12 = 0 VAL [isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=2147483391, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=32867, var_1_9=-32769] [L60] COND TRUE (((((- 9.5f)) > ((- var_1_15))) ? ((- 9.5f)) : ((- var_1_15)))) < var_1_16 [L61] var_1_14 = ((((var_1_17) < (var_1_18)) ? (var_1_17) : (var_1_18))) VAL [isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=2, var_1_17=2, var_1_18=0, var_1_19=1, var_1_1=2147483391, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=32867, var_1_9=-32769] [L63] COND TRUE var_1_13 && var_1_2 VAL [isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=2, var_1_17=2, var_1_18=0, var_1_19=1, var_1_1=2147483391, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=32867, var_1_9=-32769] [L64] COND TRUE var_1_4 > (256u * var_1_8) [L65] var_1_19 = ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21))) VAL [isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=2, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=2147483391, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=32867, var_1_9=-32769] [L70] EXPR var_1_11 & var_1_4 VAL [isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=2, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=2147483391, var_1_20=0, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=32867, var_1_9=-32769] [L70] COND TRUE (-2 / var_1_23) >= (var_1_11 & var_1_4) [L71] COND FALSE !(var_1_21 >= (var_1_19 + var_1_5)) [L82] var_1_22 = var_1_13 VAL [isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=2, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=2147483391, var_1_20=0, var_1_21=256, var_1_22=1, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=32867, var_1_9=-32769] [L153] RET step() [L154] CALL, EXPR property() [L144] EXPR (((((var_1_2 ? (var_1_1 == ((unsigned long int) (((((var_1_3) > ((var_1_4 + var_1_5))) ? (var_1_3) : ((var_1_4 + var_1_5)))) - (((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7))) + 256u)))) : 1) && (var_1_8 == ((unsigned short int) ((((25) > ((((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) + (100 + var_1_11)))) ? (25) : ((((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) + (100 + var_1_11)))))))) && ((! var_1_2) ? (((var_1_1 * ((((var_1_8) < (var_1_5)) ? (var_1_8) : (var_1_5)))) >= var_1_6) ? (var_1_12 == ((unsigned char) var_1_13)) : 1) : (var_1_12 == ((unsigned char) 0)))) && (((((((- 9.5f)) > ((- var_1_15))) ? ((- 9.5f)) : ((- var_1_15)))) < var_1_16) ? (var_1_14 == ((double) ((((var_1_17) < (var_1_18)) ? (var_1_17) : (var_1_18))))) : 1)) && ((var_1_13 && var_1_2) ? ((var_1_4 > (256u * var_1_8)) ? (var_1_19 == ((unsigned char) ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21))))) : (var_1_19 == ((unsigned char) var_1_20))) : 1)) && (((-2 / var_1_23) >= (var_1_11 & var_1_4)) ? ((var_1_21 >= (var_1_19 + var_1_5)) ? (((~ var_1_10) > var_1_20) ? (var_1_12 ? (var_1_22 == ((unsigned char) var_1_24)) : (var_1_22 == ((unsigned char) var_1_13))) : (var_1_22 == ((unsigned char) var_1_13))) : (var_1_22 == ((unsigned char) var_1_13))) : (var_1_22 == ((unsigned char) var_1_13))) VAL [isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=2, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=2147483391, var_1_20=0, var_1_21=256, var_1_22=1, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=32867, var_1_9=-32769] [L144-L145] return (((((var_1_2 ? (var_1_1 == ((unsigned long int) (((((var_1_3) > ((var_1_4 + var_1_5))) ? (var_1_3) : ((var_1_4 + var_1_5)))) - (((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7))) + 256u)))) : 1) && (var_1_8 == ((unsigned short int) ((((25) > ((((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) + (100 + var_1_11)))) ? (25) : ((((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) + (100 + var_1_11)))))))) && ((! var_1_2) ? (((var_1_1 * ((((var_1_8) < (var_1_5)) ? (var_1_8) : (var_1_5)))) >= var_1_6) ? (var_1_12 == ((unsigned char) var_1_13)) : 1) : (var_1_12 == ((unsigned char) 0)))) && (((((((- 9.5f)) > ((- var_1_15))) ? ((- 9.5f)) : ((- var_1_15)))) < var_1_16) ? (var_1_14 == ((double) ((((var_1_17) < (var_1_18)) ? (var_1_17) : (var_1_18))))) : 1)) && ((var_1_13 && var_1_2) ? ((var_1_4 > (256u * var_1_8)) ? (var_1_19 == ((unsigned char) ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21))))) : (var_1_19 == ((unsigned char) var_1_20))) : 1)) && (((-2 / var_1_23) >= (var_1_11 & var_1_4)) ? ((var_1_21 >= (var_1_19 + var_1_5)) ? (((~ var_1_10) > var_1_20) ? (var_1_12 ? (var_1_22 == ((unsigned char) var_1_24)) : (var_1_22 == ((unsigned char) var_1_13))) : (var_1_22 == ((unsigned char) var_1_13))) : (var_1_22 == ((unsigned char) var_1_13))) : (var_1_22 == ((unsigned char) var_1_13))) ; [L154] RET, EXPR property() [L154] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=2, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=2147483391, var_1_20=0, var_1_21=256, var_1_22=1, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=32867, var_1_9=-32769] [L19] reach_error() VAL [isInitial=1, var_1_10=32767, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=2, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=2147483391, var_1_20=0, var_1_21=256, var_1_22=1, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=32867, var_1_9=-32769] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 93 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 4, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 163 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 145 mSDsluCounter, 629 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 281 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 291 IncrementalHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 348 mSDtfsCounter, 291 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 650 GetRequests, 638 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=3, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 25 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1224 NumberOfCodeBlocks, 1224 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 1013 ConstructedInterpolants, 0 QuantifiedInterpolants, 1705 SizeOfPredicates, 1 NumberOfNonLiveVariables, 428 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 10434/10560 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 03:22:07,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-49.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 02fd9ca01e9b4cf3bb802fdecc600f36b127dae39ec959fa79aabe6d1e914ff2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:22:09,744 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:22:09,803 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 03:22:09,806 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:22:09,806 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:22:09,831 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:22:09,832 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:22:09,832 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:22:09,833 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:22:09,834 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:22:09,834 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:22:09,834 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:22:09,835 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:22:09,837 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:22:09,837 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:22:09,837 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:22:09,838 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:22:09,838 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:22:09,838 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:22:09,838 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:22:09,838 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:22:09,839 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:22:09,839 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:22:09,839 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 03:22:09,839 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 03:22:09,840 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:22:09,840 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 03:22:09,840 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:22:09,840 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:22:09,840 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:22:09,841 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:22:09,841 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:22:09,841 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:22:09,841 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:22:09,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:22:09,842 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:22:09,842 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:22:09,843 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:22:09,843 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 03:22:09,843 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 03:22:09,843 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:22:09,843 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:22:09,843 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:22:09,843 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:22:09,844 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 02fd9ca01e9b4cf3bb802fdecc600f36b127dae39ec959fa79aabe6d1e914ff2 [2024-11-10 03:22:10,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:22:10,097 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:22:10,099 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:22:10,100 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:22:10,101 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:22:10,102 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-49.i [2024-11-10 03:22:11,325 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:22:11,518 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:22:11,518 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-49.i [2024-11-10 03:22:11,538 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fb6c3576/76b67ed534e9477d92789fdff4ab22be/FLAGcdee32134 [2024-11-10 03:22:11,549 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fb6c3576/76b67ed534e9477d92789fdff4ab22be [2024-11-10 03:22:11,552 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:22:11,553 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:22:11,554 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:22:11,556 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:22:11,560 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:22:11,561 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:22:11" (1/1) ... [2024-11-10 03:22:11,562 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@606a9f9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:11, skipping insertion in model container [2024-11-10 03:22:11,562 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:22:11" (1/1) ... [2024-11-10 03:22:11,586 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:22:11,731 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-49.i[913,926] [2024-11-10 03:22:11,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:22:11,798 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:22:11,809 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-49.i[913,926] [2024-11-10 03:22:11,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:22:11,864 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:22:11,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:11 WrapperNode [2024-11-10 03:22:11,864 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:22:11,865 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:22:11,865 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:22:11,865 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:22:11,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:11" (1/1) ... [2024-11-10 03:22:11,885 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:11" (1/1) ... [2024-11-10 03:22:11,908 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 166 [2024-11-10 03:22:11,911 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:22:11,912 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:22:11,912 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:22:11,912 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:22:11,919 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:11" (1/1) ... [2024-11-10 03:22:11,920 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:11" (1/1) ... [2024-11-10 03:22:11,925 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:11" (1/1) ... [2024-11-10 03:22:11,939 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 03:22:11,940 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:11" (1/1) ... [2024-11-10 03:22:11,940 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:11" (1/1) ... [2024-11-10 03:22:11,947 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:11" (1/1) ... [2024-11-10 03:22:11,947 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:11" (1/1) ... [2024-11-10 03:22:11,949 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:11" (1/1) ... [2024-11-10 03:22:11,950 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:11" (1/1) ... [2024-11-10 03:22:11,960 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:22:11,961 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:22:11,961 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:22:11,961 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:22:11,961 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:11" (1/1) ... [2024-11-10 03:22:11,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:22:11,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:22:11,995 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 03:22:12,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 03:22:12,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:22:12,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 03:22:12,034 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:22:12,034 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:22:12,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:22:12,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:22:12,099 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:22:12,101 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:22:12,434 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-10 03:22:12,434 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:22:12,447 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:22:12,447 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:22:12,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:22:12 BoogieIcfgContainer [2024-11-10 03:22:12,448 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:22:12,452 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:22:12,452 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:22:12,455 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:22:12,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:22:11" (1/3) ... [2024-11-10 03:22:12,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65f561ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:22:12, skipping insertion in model container [2024-11-10 03:22:12,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:22:11" (2/3) ... [2024-11-10 03:22:12,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65f561ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:22:12, skipping insertion in model container [2024-11-10 03:22:12,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:22:12" (3/3) ... [2024-11-10 03:22:12,457 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-49.i [2024-11-10 03:22:12,470 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:22:12,471 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:22:12,526 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:22:12,530 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;@6f858483, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:22:12,530 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:22:12,537 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 48 states have (on average 1.3125) internal successors, (63), 49 states have internal predecessors, (63), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-10 03:22:12,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-10 03:22:12,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:22:12,556 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:22:12,556 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:22:12,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:22:12,561 INFO L85 PathProgramCache]: Analyzing trace with hash 855651290, now seen corresponding path program 1 times [2024-11-10 03:22:12,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:22:12,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [775683984] [2024-11-10 03:22:12,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:22:12,574 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:22:12,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:22:12,577 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:22:12,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 03:22:12,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:12,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 03:22:12,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:22:12,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 604 proven. 0 refuted. 0 times theorem prover too weak. 1508 trivial. 0 not checked. [2024-11-10 03:22:12,895 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 03:22:12,897 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:22:12,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [775683984] [2024-11-10 03:22:12,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [775683984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:22:12,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:22:12,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:22:12,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101887430] [2024-11-10 03:22:12,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:22:12,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:22:12,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:22:12,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:22:12,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:22:12,927 INFO L87 Difference]: Start difference. First operand has 84 states, 48 states have (on average 1.3125) internal successors, (63), 49 states have internal predecessors, (63), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-10 03:22:12,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:22:12,957 INFO L93 Difference]: Finished difference Result 159 states and 282 transitions. [2024-11-10 03:22:12,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:22:12,961 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 200 [2024-11-10 03:22:12,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:22:12,966 INFO L225 Difference]: With dead ends: 159 [2024-11-10 03:22:12,967 INFO L226 Difference]: Without dead ends: 78 [2024-11-10 03:22:12,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:22:12,974 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:22:12,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:22:12,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-10 03:22:13,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-10 03:22:13,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 43 states have internal predecessors, (52), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-10 03:22:13,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 118 transitions. [2024-11-10 03:22:13,012 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 118 transitions. Word has length 200 [2024-11-10 03:22:13,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:22:13,013 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 118 transitions. [2024-11-10 03:22:13,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-10 03:22:13,013 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 118 transitions. [2024-11-10 03:22:13,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-10 03:22:13,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:22:13,016 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:22:13,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 03:22:13,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:22:13,221 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:22:13,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:22:13,222 INFO L85 PathProgramCache]: Analyzing trace with hash -447046603, now seen corresponding path program 1 times [2024-11-10 03:22:13,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:22:13,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2042033282] [2024-11-10 03:22:13,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:22:13,223 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:22:13,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:22:13,225 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:22:13,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 03:22:13,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:13,459 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 03:22:13,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:22:13,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1076 proven. 42 refuted. 0 times theorem prover too weak. 994 trivial. 0 not checked. [2024-11-10 03:22:13,649 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 03:22:13,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 54 proven. 42 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-10 03:22:13,948 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:22:13,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2042033282] [2024-11-10 03:22:13,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2042033282] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 03:22:13,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 03:22:13,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-10 03:22:13,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673549701] [2024-11-10 03:22:13,949 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 03:22:13,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 03:22:13,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:22:13,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 03:22:13,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 03:22:13,951 INFO L87 Difference]: Start difference. First operand 78 states and 118 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2024-11-10 03:22:14,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:22:14,497 INFO L93 Difference]: Finished difference Result 176 states and 260 transitions. [2024-11-10 03:22:14,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 03:22:14,498 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) Word has length 200 [2024-11-10 03:22:14,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:22:14,500 INFO L225 Difference]: With dead ends: 176 [2024-11-10 03:22:14,500 INFO L226 Difference]: Without dead ends: 101 [2024-11-10 03:22:14,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 391 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2024-11-10 03:22:14,502 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 88 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 03:22:14,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 202 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 03:22:14,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-10 03:22:14,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 86. [2024-11-10 03:22:14,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 50 states have (on average 1.2) internal successors, (60), 50 states have internal predecessors, (60), 33 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-10 03:22:14,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 126 transitions. [2024-11-10 03:22:14,516 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 126 transitions. Word has length 200 [2024-11-10 03:22:14,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:22:14,517 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 126 transitions. [2024-11-10 03:22:14,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2024-11-10 03:22:14,517 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 126 transitions. [2024-11-10 03:22:14,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-10 03:22:14,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:22:14,520 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:22:14,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 03:22:14,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:22:14,738 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:22:14,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:22:14,740 INFO L85 PathProgramCache]: Analyzing trace with hash -739034098, now seen corresponding path program 1 times [2024-11-10 03:22:14,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:22:14,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1679783971] [2024-11-10 03:22:14,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:22:14,741 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:22:14,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:22:14,742 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:22:14,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 03:22:14,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:22:14,932 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-10 03:22:14,939 INFO L278 TraceCheckSpWp]: Computing forward predicates...