./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-40.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-40.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 ff360ccd3a0ad755a7a964ff9d3582570f4eb182f793226f13b7e89a482a33ba --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:21:05,674 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:21:05,742 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 03:21:05,748 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:21:05,748 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:21:05,771 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:21:05,772 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:21:05,773 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:21:05,773 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:21:05,774 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:21:05,774 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:21:05,775 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:21:05,776 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:21:05,776 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:21:05,777 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:21:05,778 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:21:05,778 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:21:05,778 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:21:05,778 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 03:21:05,780 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:21:05,780 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:21:05,781 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:21:05,781 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:21:05,781 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:21:05,781 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:21:05,781 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:21:05,781 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:21:05,782 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:21:05,782 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:21:05,782 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:21:05,782 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:21:05,783 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:21:05,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:21:05,783 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:21:05,783 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:21:05,783 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:21:05,783 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 03:21:05,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 03:21:05,784 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:21:05,784 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:21:05,784 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:21:05,784 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:21:05,784 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 -> ff360ccd3a0ad755a7a964ff9d3582570f4eb182f793226f13b7e89a482a33ba [2024-11-10 03:21:05,976 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:21:05,997 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:21:06,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:21:06,001 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:21:06,001 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:21:06,002 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-40.i [2024-11-10 03:21:07,252 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:21:07,422 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:21:07,422 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-40.i [2024-11-10 03:21:07,434 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5008dc715/76c4c52bcaea4bf29d092836831b2cbd/FLAG3b855f7a0 [2024-11-10 03:21:07,816 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5008dc715/76c4c52bcaea4bf29d092836831b2cbd [2024-11-10 03:21:07,818 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:21:07,819 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:21:07,821 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:21:07,821 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:21:07,825 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:21:07,825 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:21:07" (1/1) ... [2024-11-10 03:21:07,826 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25b495d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:07, skipping insertion in model container [2024-11-10 03:21:07,826 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:21:07" (1/1) ... [2024-11-10 03:21:07,852 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:21:07,999 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-40.i[913,926] [2024-11-10 03:21:08,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:21:08,065 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:21:08,074 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-40.i[913,926] [2024-11-10 03:21:08,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:21:08,119 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:21:08,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:08 WrapperNode [2024-11-10 03:21:08,120 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:21:08,120 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:21:08,121 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:21:08,121 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:21:08,126 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:21:08" (1/1) ... [2024-11-10 03:21:08,138 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:21:08" (1/1) ... [2024-11-10 03:21:08,171 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 163 [2024-11-10 03:21:08,172 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:21:08,172 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:21:08,172 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:21:08,172 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:21:08,184 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:08" (1/1) ... [2024-11-10 03:21:08,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:08" (1/1) ... [2024-11-10 03:21:08,187 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:08" (1/1) ... [2024-11-10 03:21:08,228 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:21:08,229 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:08" (1/1) ... [2024-11-10 03:21:08,229 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:08" (1/1) ... [2024-11-10 03:21:08,244 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:08" (1/1) ... [2024-11-10 03:21:08,244 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:08" (1/1) ... [2024-11-10 03:21:08,249 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:08" (1/1) ... [2024-11-10 03:21:08,250 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:08" (1/1) ... [2024-11-10 03:21:08,273 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:21:08,274 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:21:08,274 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:21:08,274 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:21:08,275 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:08" (1/1) ... [2024-11-10 03:21:08,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:21:08,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:21:08,312 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:21:08,314 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:21:08,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:21:08,354 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:21:08,354 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:21:08,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 03:21:08,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:21:08,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:21:08,430 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:21:08,432 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:21:08,706 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-10 03:21:08,707 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:21:08,725 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:21:08,726 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:21:08,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:21:08 BoogieIcfgContainer [2024-11-10 03:21:08,727 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:21:08,729 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:21:08,730 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:21:08,733 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:21:08,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:21:07" (1/3) ... [2024-11-10 03:21:08,734 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11110282 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:21:08, skipping insertion in model container [2024-11-10 03:21:08,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:08" (2/3) ... [2024-11-10 03:21:08,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11110282 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:21:08, skipping insertion in model container [2024-11-10 03:21:08,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:21:08" (3/3) ... [2024-11-10 03:21:08,737 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-40.i [2024-11-10 03:21:08,751 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:21:08,751 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:21:08,808 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:21:08,815 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;@5c9c21fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:21:08,816 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:21:08,821 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 47 states have internal predecessors, (60), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-10 03:21:08,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-10 03:21:08,837 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:21:08,838 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:08,839 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:21:08,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:21:08,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1111010348, now seen corresponding path program 1 times [2024-11-10 03:21:08,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:21:08,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631509955] [2024-11-10 03:21:08,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:21:08,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:21:08,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:21:09,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:21:09,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:21:09,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:21:09,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:21:09,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:21:09,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 03:21:09,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:21:09,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 03:21:09,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:21:09,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 03:21:09,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:21:09,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 03:21:09,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:21:09,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 03:21:09,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:21:09,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 03:21:09,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 03:21:09,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-10 03:21:09,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 03:21:09,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 03:21:09,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 03:21:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 03:21:09,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 03:21:09,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 03:21:09,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 03:21:09,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 03:21:09,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 03:21:09,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 03:21:09,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 03:21:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-10 03:21:09,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:21:09,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631509955] [2024-11-10 03:21:09,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631509955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:21:09,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:21:09,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:21:09,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685206555] [2024-11-10 03:21:09,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:21:09,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:21:09,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:21:09,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:21:09,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:21:09,257 INFO L87 Difference]: Start difference. First operand has 79 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 47 states have internal predecessors, (60), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-10 03:21:09,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:21:09,285 INFO L93 Difference]: Finished difference Result 150 states and 263 transitions. [2024-11-10 03:21:09,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:21:09,287 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 185 [2024-11-10 03:21:09,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:21:09,293 INFO L225 Difference]: With dead ends: 150 [2024-11-10 03:21:09,294 INFO L226 Difference]: Without dead ends: 74 [2024-11-10 03:21:09,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 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:21:09,302 INFO L432 NwaCegarLoop]: 110 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, 110 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:21:09,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:21:09,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-10 03:21:09,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-10 03:21:09,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 42 states have internal predecessors, (50), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-10 03:21:09,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 110 transitions. [2024-11-10 03:21:09,368 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 110 transitions. Word has length 185 [2024-11-10 03:21:09,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:21:09,368 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 110 transitions. [2024-11-10 03:21:09,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-10 03:21:09,368 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 110 transitions. [2024-11-10 03:21:09,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-10 03:21:09,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:21:09,373 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:09,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 03:21:09,374 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:21:09,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:21:09,374 INFO L85 PathProgramCache]: Analyzing trace with hash -504322962, now seen corresponding path program 1 times [2024-11-10 03:21:09,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:21:09,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622192093] [2024-11-10 03:21:09,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:21:09,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:21:09,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:21:09,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:21:09,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:21:09,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:21:09,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:21:09,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:21:09,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 03:21:09,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:21:09,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 03:21:09,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:21:09,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 03:21:09,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:21:09,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 03:21:09,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:21:09,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 03:21:09,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 03:21:09,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 03:21:09,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 03:21:09,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-10 03:21:09,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 03:21:09,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 03:21:09,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 03:21:09,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 03:21:09,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 03:21:09,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 03:21:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 03:21:09,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 03:21:09,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 03:21:09,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 03:21:09,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 03:21:09,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:09,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 54 proven. 33 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-10 03:21:09,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:21:09,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622192093] [2024-11-10 03:21:09,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622192093] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 03:21:09,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407889509] [2024-11-10 03:21:09,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:21:09,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:21:09,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:21:09,960 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:21:09,961 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:21:10,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:10,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 03:21:10,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:21:10,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 857 proven. 33 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2024-11-10 03:21:10,286 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 03:21:10,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 54 proven. 33 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-10 03:21:10,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407889509] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 03:21:10,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 03:21:10,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-10 03:21:10,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250236230] [2024-11-10 03:21:10,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 03:21:10,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 03:21:10,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:21:10,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 03:21:10,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 03:21:10,526 INFO L87 Difference]: Start difference. First operand 74 states and 110 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-11-10 03:21:10,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:21:10,789 INFO L93 Difference]: Finished difference Result 151 states and 220 transitions. [2024-11-10 03:21:10,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 03:21:10,790 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 186 [2024-11-10 03:21:10,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:21:10,792 INFO L225 Difference]: With dead ends: 151 [2024-11-10 03:21:10,792 INFO L226 Difference]: Without dead ends: 80 [2024-11-10 03:21:10,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 428 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-10 03:21:10,795 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 98 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 03:21:10,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 144 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 03:21:10,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-10 03:21:10,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2024-11-10 03:21:10,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 states have internal predecessors, (47), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-10 03:21:10,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 107 transitions. [2024-11-10 03:21:10,817 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 107 transitions. Word has length 186 [2024-11-10 03:21:10,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:21:10,819 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 107 transitions. [2024-11-10 03:21:10,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-11-10 03:21:10,819 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 107 transitions. [2024-11-10 03:21:10,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-10 03:21:10,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:21:10,823 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:10,838 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:21:11,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:21:11,024 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:21:11,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:21:11,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1983189871, now seen corresponding path program 1 times [2024-11-10 03:21:11,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:21:11,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59237798] [2024-11-10 03:21:11,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:21:11,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:21:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 03:21:11,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1072837838] [2024-11-10 03:21:11,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:21:11,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:21:11,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:21:11,131 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:21:11,133 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:21:11,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:21:11,284 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 03:21:11,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:21:11,391 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 03:21:11,391 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 03:21:11,392 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 03:21:11,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 03:21:11,594 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,SelfDestructingSolverStorable2 [2024-11-10 03:21:11,597 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 03:21:11,692 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 03:21:11,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:21:11 BoogieIcfgContainer [2024-11-10 03:21:11,696 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 03:21:11,697 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 03:21:11,697 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 03:21:11,697 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 03:21:11,697 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:21:08" (3/4) ... [2024-11-10 03:21:11,700 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 03:21:11,701 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 03:21:11,702 INFO L158 Benchmark]: Toolchain (without parser) took 3882.34ms. Allocated memory was 157.3MB in the beginning and 199.2MB in the end (delta: 41.9MB). Free memory was 87.7MB in the beginning and 92.0MB in the end (delta: -4.2MB). Peak memory consumption was 39.1MB. Max. memory is 16.1GB. [2024-11-10 03:21:11,702 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 117.4MB. Free memory was 78.1MB in the beginning and 77.9MB in the end (delta: 114.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:21:11,703 INFO L158 Benchmark]: CACSL2BoogieTranslator took 299.27ms. Allocated memory is still 157.3MB. Free memory was 87.5MB in the beginning and 71.6MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 03:21:11,703 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.37ms. Allocated memory is still 157.3MB. Free memory was 71.6MB in the beginning and 67.7MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 03:21:11,703 INFO L158 Benchmark]: Boogie Preprocessor took 101.27ms. Allocated memory is still 157.3MB. Free memory was 67.7MB in the beginning and 123.3MB in the end (delta: -55.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 03:21:11,703 INFO L158 Benchmark]: IcfgBuilder took 452.80ms. Allocated memory is still 157.3MB. Free memory was 123.3MB in the beginning and 100.2MB in the end (delta: 23.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-10 03:21:11,704 INFO L158 Benchmark]: TraceAbstraction took 2966.97ms. Allocated memory was 157.3MB in the beginning and 199.2MB in the end (delta: 41.9MB). Free memory was 99.6MB in the beginning and 92.0MB in the end (delta: 7.6MB). Peak memory consumption was 51.6MB. Max. memory is 16.1GB. [2024-11-10 03:21:11,704 INFO L158 Benchmark]: Witness Printer took 4.42ms. Allocated memory is still 199.2MB. Free memory is still 92.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:21:11,705 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.15ms. Allocated memory is still 117.4MB. Free memory was 78.1MB in the beginning and 77.9MB in the end (delta: 114.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 299.27ms. Allocated memory is still 157.3MB. Free memory was 87.5MB in the beginning and 71.6MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.37ms. Allocated memory is still 157.3MB. Free memory was 71.6MB in the beginning and 67.7MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 101.27ms. Allocated memory is still 157.3MB. Free memory was 67.7MB in the beginning and 123.3MB in the end (delta: -55.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 452.80ms. Allocated memory is still 157.3MB. Free memory was 123.3MB in the beginning and 100.2MB in the end (delta: 23.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 2966.97ms. Allocated memory was 157.3MB in the beginning and 199.2MB in the end (delta: 41.9MB). Free memory was 99.6MB in the beginning and 92.0MB in the end (delta: 7.6MB). Peak memory consumption was 51.6MB. Max. memory is 16.1GB. * Witness Printer took 4.42ms. Allocated memory is still 199.2MB. Free memory is still 92.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 137, overapproximation of someBinaryFLOATComparisonOperation at line 137, overapproximation of someUnaryDOUBLEoperation at line 45. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 128; [L23] signed char var_1_2 = 2; [L24] signed char var_1_3 = -100; [L25] signed short int var_1_4 = -200; [L26] signed long int var_1_5 = -2; [L27] unsigned short int var_1_6 = 32; [L28] unsigned short int var_1_7 = 8; [L29] unsigned short int var_1_8 = 5; [L30] unsigned char var_1_9 = 1; [L31] unsigned char var_1_10 = 0; [L32] unsigned char var_1_11 = 0; [L33] unsigned char var_1_12 = 16; [L34] double var_1_13 = 4.8; [L35] double var_1_14 = 8.4; [L36] unsigned char var_1_15 = 50; [L37] unsigned short int var_1_16 = 1; [L38] float var_1_17 = 25.4; [L39] signed long int var_1_19 = 2; [L40] float var_1_20 = 1.6; [L41] unsigned short int var_1_21 = 0; [L42] unsigned short int var_1_22 = 8; [L43] unsigned short int var_1_23 = 16; [L44] float var_1_24 = 128.5; [L45] double var_1_25 = -0.5; [L46] signed long int var_1_26 = 4; VAL [isInitial=0, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=2, var_1_3=-100, var_1_4=-200, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L141] isInitial = 1 [L142] FCALL initially() [L143] COND TRUE 1 [L144] FCALL updateLastVariables() [L145] CALL updateVariables() [L87] var_1_2 = __VERIFIER_nondet_char() [L88] CALL assume_abort_if_not(var_1_2 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=-100, var_1_4=-200, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=-100, var_1_4=-200, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L88] RET assume_abort_if_not(var_1_2 >= -128) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=-100, var_1_4=-200, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L89] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=-100, var_1_4=-200, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=-100, var_1_4=-200, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L89] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=-100, var_1_4=-200, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L90] var_1_3 = __VERIFIER_nondet_char() [L91] CALL assume_abort_if_not(var_1_3 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=-200, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=-200, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L91] RET assume_abort_if_not(var_1_3 >= -128) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=-200, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L92] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=-200, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=-200, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L92] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=-200, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L93] var_1_4 = __VERIFIER_nondet_short() [L94] CALL assume_abort_if_not(var_1_4 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L94] RET assume_abort_if_not(var_1_4 >= -32768) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L95] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L95] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L96] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L96] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L97] var_1_5 = __VERIFIER_nondet_long() [L98] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L98] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L99] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L99] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=32, var_1_7=8, var_1_8=5, var_1_9=1] [L100] var_1_6 = __VERIFIER_nondet_ushort() [L101] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_7=8, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_7=8, var_1_8=5, var_1_9=1] [L101] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_7=8, var_1_8=5, var_1_9=1] [L102] CALL assume_abort_if_not(var_1_6 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=8, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=8, var_1_8=5, var_1_9=1] [L102] RET assume_abort_if_not(var_1_6 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=8, var_1_8=5, var_1_9=1] [L103] var_1_7 = __VERIFIER_nondet_ushort() [L104] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_8=5, var_1_9=1] [L104] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_8=5, var_1_9=1] [L105] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=5, var_1_9=1] [L105] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=5, var_1_9=1] [L106] var_1_8 = __VERIFIER_nondet_ushort() [L107] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_9=1] [L107] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_9=1] [L108] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=1] [L108] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=1] [L109] var_1_10 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=1] [L110] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=1] [L111] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=1] [L111] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=1] [L112] var_1_11 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=1] [L113] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=1, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=1] [L114] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=1] [L114] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_13=24/5, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=1] [L115] var_1_13 = __VERIFIER_nondet_double() [L116] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=1] [L116] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_14=42/5, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=1] [L117] var_1_14 = __VERIFIER_nondet_double() [L118] CALL assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=1] [L118] RET assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=1] [L119] var_1_15 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=1] [L120] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=1] [L121] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=1] [L121] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=2, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=1] [L122] var_1_19 = __VERIFIER_nondet_long() [L123] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=1] [L123] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=1] [L124] CALL assume_abort_if_not(var_1_19 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=1] [L124] RET assume_abort_if_not(var_1_19 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=1] [L125] var_1_20 = __VERIFIER_nondet_float() [L126] CALL assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=1] [L126] RET assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=8, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=1] [L127] var_1_22 = __VERIFIER_nondet_ushort() [L128] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=1] [L128] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=1] [L129] CALL assume_abort_if_not(var_1_22 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=-65536, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=-65536, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=1] [L129] RET assume_abort_if_not(var_1_22 <= 16383) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=-65536, var_1_23=16, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=1] [L130] var_1_23 = __VERIFIER_nondet_ushort() [L131] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=-65536, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=-65536, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=1] [L131] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=-65536, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=1] [L132] CALL assume_abort_if_not(var_1_23 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=-65536, var_1_23=0, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=-65536, var_1_23=0, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=1] [L132] RET assume_abort_if_not(var_1_23 <= 16383) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=-65536, var_1_23=0, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=1] [L145] RET updateVariables() [L146] CALL step() [L50] COND TRUE ((var_1_3 * var_1_2) / var_1_4) <= var_1_5 [L51] var_1_1 = var_1_6 VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=0, var_1_21=0, var_1_22=-65536, var_1_23=0, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=1] [L55] COND TRUE (var_1_5 != var_1_4) || var_1_10 [L56] var_1_9 = var_1_11 VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=0, var_1_21=0, var_1_22=-65536, var_1_23=0, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=0] [L58] COND FALSE !((var_1_9 && var_1_11) && (50 > var_1_8)) [L65] var_1_12 = var_1_15 VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_19=0, var_1_1=0, var_1_21=0, var_1_22=-65536, var_1_23=0, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=0] [L67] var_1_16 = (((((((((256) > (var_1_7)) ? (256) : (var_1_7))) + var_1_8)) < (var_1_15)) ? ((((((256) > (var_1_7)) ? (256) : (var_1_7))) + var_1_8)) : (var_1_15))) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=127/5, var_1_19=0, var_1_1=0, var_1_21=0, var_1_22=-65536, var_1_23=0, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=0] [L68] COND TRUE (var_1_1 - ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))) < (var_1_8 - var_1_19) [L69] var_1_17 = var_1_20 VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=0, var_1_22=-65536, var_1_23=0, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=0] [L71] COND FALSE !((var_1_10 && var_1_11) && var_1_9) [L74] var_1_21 = ((23370 - var_1_15) + var_1_23) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_22=-65536, var_1_23=0, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=0] [L76] COND FALSE !(! (-4 < var_1_22)) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_22=-65536, var_1_23=0, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=0] [L79] COND FALSE !(-4 > var_1_12) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_22=-65536, var_1_23=0, var_1_24=257/2, var_1_26=4, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=0] [L83] var_1_25 = var_1_20 [L84] var_1_26 = var_1_6 VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_22=-65536, var_1_23=0, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=0] [L146] RET step() [L147] CALL, EXPR property() [L137-L138] return (((((((((((var_1_3 * var_1_2) / var_1_4) <= var_1_5) ? (var_1_1 == ((unsigned short int) var_1_6)) : (var_1_1 == ((unsigned short int) (var_1_7 + var_1_8)))) && (((var_1_5 != var_1_4) || var_1_10) ? (var_1_9 == ((unsigned char) var_1_11)) : 1)) && (((var_1_9 && var_1_11) && (50 > var_1_8)) ? (((- var_1_13) < var_1_14) ? (var_1_10 ? (var_1_12 == ((unsigned char) 5)) : 1) : 1) : (var_1_12 == ((unsigned char) var_1_15)))) && (var_1_16 == ((unsigned short int) (((((((((256) > (var_1_7)) ? (256) : (var_1_7))) + var_1_8)) < (var_1_15)) ? ((((((256) > (var_1_7)) ? (256) : (var_1_7))) + var_1_8)) : (var_1_15)))))) && (((var_1_1 - ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))) < (var_1_8 - var_1_19)) ? (var_1_17 == ((float) var_1_20)) : 1)) && (((var_1_10 && var_1_11) && var_1_9) ? (var_1_21 == ((unsigned short int) (var_1_12 + (var_1_15 + ((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23))))))) : (var_1_21 == ((unsigned short int) ((23370 - var_1_15) + var_1_23))))) && ((! (-4 < var_1_22)) ? (var_1_24 == ((float) var_1_20)) : ((-4 > var_1_12) ? (var_1_24 == ((float) 10.6f)) : 1))) && (var_1_25 == ((double) var_1_20))) && (var_1_26 == ((signed long int) var_1_6)) ; VAL [\result=0, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_22=-65536, var_1_23=0, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=0] [L147] RET, EXPR property() [L147] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_22=-65536, var_1_23=0, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_22=-65536, var_1_23=0, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=2, var_1_6=0, var_1_7=-65280, var_1_8=-65535, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 79 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 3, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 115 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 98 mSDsluCounter, 254 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 75 mSDsCounter, 82 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 162 IncrementalHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 82 mSolverCounterUnsat, 179 mSDtfsCounter, 162 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 530 GetRequests, 520 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=0, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 929 NumberOfCodeBlocks, 929 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 739 ConstructedInterpolants, 0 QuantifiedInterpolants, 1261 SizeOfPredicates, 1 NumberOfNonLiveVariables, 407 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 6861/6960 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:21:11,724 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-40.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 ff360ccd3a0ad755a7a964ff9d3582570f4eb182f793226f13b7e89a482a33ba --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:21:13,561 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:21:13,631 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 03:21:13,635 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:21:13,635 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:21:13,657 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:21:13,660 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:21:13,660 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:21:13,661 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:21:13,661 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:21:13,661 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:21:13,662 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:21:13,662 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:21:13,662 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:21:13,663 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:21:13,663 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:21:13,665 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:21:13,666 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:21:13,667 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:21:13,667 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:21:13,667 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:21:13,667 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:21:13,667 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:21:13,668 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 03:21:13,668 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 03:21:13,668 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:21:13,668 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 03:21:13,668 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:21:13,668 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:21:13,669 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:21:13,669 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:21:13,669 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:21:13,669 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:21:13,669 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:21:13,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:21:13,670 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:21:13,670 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:21:13,670 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:21:13,672 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 03:21:13,673 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 03:21:13,673 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:21:13,673 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:21:13,673 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:21:13,673 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:21:13,673 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 -> ff360ccd3a0ad755a7a964ff9d3582570f4eb182f793226f13b7e89a482a33ba [2024-11-10 03:21:13,945 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:21:13,962 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:21:13,965 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:21:13,966 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:21:13,966 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:21:13,968 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-40.i [2024-11-10 03:21:15,236 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:21:15,457 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:21:15,458 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-40.i [2024-11-10 03:21:15,470 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6aa0842ec/cd46994945b44fbb9af1dec4379d3ae0/FLAG782abdc94 [2024-11-10 03:21:15,836 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6aa0842ec/cd46994945b44fbb9af1dec4379d3ae0 [2024-11-10 03:21:15,838 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:21:15,839 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:21:15,841 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:21:15,841 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:21:15,845 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:21:15,845 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:21:15" (1/1) ... [2024-11-10 03:21:15,846 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@350848ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:15, skipping insertion in model container [2024-11-10 03:21:15,846 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:21:15" (1/1) ... [2024-11-10 03:21:15,865 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:21:16,008 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-40.i[913,926] [2024-11-10 03:21:16,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:21:16,102 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:21:16,115 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-40.i[913,926] [2024-11-10 03:21:16,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:21:16,201 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:21:16,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:16 WrapperNode [2024-11-10 03:21:16,201 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:21:16,202 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:21:16,202 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:21:16,202 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:21:16,207 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:21:16" (1/1) ... [2024-11-10 03:21:16,219 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:21:16" (1/1) ... [2024-11-10 03:21:16,255 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 158 [2024-11-10 03:21:16,256 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:21:16,257 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:21:16,258 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:21:16,258 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:21:16,266 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:16" (1/1) ... [2024-11-10 03:21:16,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:16" (1/1) ... [2024-11-10 03:21:16,271 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:16" (1/1) ... [2024-11-10 03:21:16,287 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:21:16,287 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:16" (1/1) ... [2024-11-10 03:21:16,288 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:16" (1/1) ... [2024-11-10 03:21:16,302 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:16" (1/1) ... [2024-11-10 03:21:16,303 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:16" (1/1) ... [2024-11-10 03:21:16,305 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:16" (1/1) ... [2024-11-10 03:21:16,306 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:16" (1/1) ... [2024-11-10 03:21:16,313 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:21:16,314 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:21:16,317 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:21:16,317 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:21:16,318 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:16" (1/1) ... [2024-11-10 03:21:16,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:21:16,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:21:16,349 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:21:16,352 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:21:16,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:21:16,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 03:21:16,392 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:21:16,392 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:21:16,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:21:16,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:21:16,467 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:21:16,470 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:21:17,077 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-10 03:21:17,077 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:21:17,091 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:21:17,091 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:21:17,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:21:17 BoogieIcfgContainer [2024-11-10 03:21:17,092 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:21:17,093 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:21:17,093 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:21:17,096 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:21:17,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:21:15" (1/3) ... [2024-11-10 03:21:17,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@433fa384 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:21:17, skipping insertion in model container [2024-11-10 03:21:17,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:16" (2/3) ... [2024-11-10 03:21:17,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@433fa384 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:21:17, skipping insertion in model container [2024-11-10 03:21:17,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:21:17" (3/3) ... [2024-11-10 03:21:17,098 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-40.i [2024-11-10 03:21:17,113 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:21:17,113 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:21:17,165 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:21:17,171 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;@3084b51a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:21:17,171 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:21:17,174 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 47 states have internal predecessors, (60), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-10 03:21:17,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-10 03:21:17,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:21:17,187 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:17,188 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:21:17,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:21:17,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1111010348, now seen corresponding path program 1 times [2024-11-10 03:21:17,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:21:17,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2073729571] [2024-11-10 03:21:17,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:21:17,202 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:21:17,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:21:17,205 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:21:17,206 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:21:17,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:17,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 03:21:17,472 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:21:17,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 610 proven. 0 refuted. 0 times theorem prover too weak. 1130 trivial. 0 not checked. [2024-11-10 03:21:17,518 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 03:21:17,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:21:17,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2073729571] [2024-11-10 03:21:17,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2073729571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:21:17,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:21:17,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:21:17,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965734269] [2024-11-10 03:21:17,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:21:17,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:21:17,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:21:17,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:21:17,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:21:17,552 INFO L87 Difference]: Start difference. First operand has 79 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 47 states have internal predecessors, (60), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) 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, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-10 03:21:17,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:21:17,576 INFO L93 Difference]: Finished difference Result 150 states and 263 transitions. [2024-11-10 03:21:17,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:21:17,578 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, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 185 [2024-11-10 03:21:17,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:21:17,584 INFO L225 Difference]: With dead ends: 150 [2024-11-10 03:21:17,584 INFO L226 Difference]: Without dead ends: 74 [2024-11-10 03:21:17,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 184 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:21:17,589 INFO L432 NwaCegarLoop]: 110 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, 110 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:21:17,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:21:17,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-10 03:21:17,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-10 03:21:17,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 42 states have internal predecessors, (50), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-10 03:21:17,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 110 transitions. [2024-11-10 03:21:17,629 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 110 transitions. Word has length 185 [2024-11-10 03:21:17,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:21:17,630 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 110 transitions. [2024-11-10 03:21:17,630 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, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-10 03:21:17,630 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 110 transitions. [2024-11-10 03:21:17,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-10 03:21:17,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:21:17,634 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:17,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-10 03:21:17,834 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:21:17,835 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:21:17,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:21:17,837 INFO L85 PathProgramCache]: Analyzing trace with hash -504322962, now seen corresponding path program 1 times [2024-11-10 03:21:17,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:21:17,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [858655936] [2024-11-10 03:21:17,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:21:17,839 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:21:17,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:21:17,841 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:21:17,842 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:21:18,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:18,037 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 03:21:18,044 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:21:18,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 857 proven. 33 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2024-11-10 03:21:18,265 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 03:21:18,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 54 proven. 33 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-10 03:21:18,521 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:21:18,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [858655936] [2024-11-10 03:21:18,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [858655936] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 03:21:18,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 03:21:18,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-10 03:21:18,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263181853] [2024-11-10 03:21:18,522 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 03:21:18,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 03:21:18,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:21:18,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 03:21:18,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 03:21:18,528 INFO L87 Difference]: Start difference. First operand 74 states and 110 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-11-10 03:21:19,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:21:19,034 INFO L93 Difference]: Finished difference Result 151 states and 220 transitions. [2024-11-10 03:21:19,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 03:21:19,042 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 186 [2024-11-10 03:21:19,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:21:19,044 INFO L225 Difference]: With dead ends: 151 [2024-11-10 03:21:19,044 INFO L226 Difference]: Without dead ends: 80 [2024-11-10 03:21:19,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 364 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-10 03:21:19,046 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 45 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 03:21:19,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 143 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 03:21:19,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-10 03:21:19,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2024-11-10 03:21:19,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 states have internal predecessors, (47), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-10 03:21:19,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 107 transitions. [2024-11-10 03:21:19,060 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 107 transitions. Word has length 186 [2024-11-10 03:21:19,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:21:19,060 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 107 transitions. [2024-11-10 03:21:19,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-11-10 03:21:19,061 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 107 transitions. [2024-11-10 03:21:19,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-10 03:21:19,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:21:19,064 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:19,074 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:21:19,264 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:21:19,265 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:21:19,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:21:19,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1983189871, now seen corresponding path program 1 times [2024-11-10 03:21:19,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:21:19,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [565220109] [2024-11-10 03:21:19,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:21:19,266 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:21:19,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:21:19,268 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:21:19,269 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:21:19,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:19,464 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-10 03:21:19,472 INFO L278 TraceCheckSpWp]: Computing forward predicates...