./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-60.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-60.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 0e3b66e9eccfd4fa8e4be46135bb01f9b94498d71482eaa706147ef592b066a9 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 02:51:08,904 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 02:51:08,987 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 02:51:08,991 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 02:51:08,993 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 02:51:09,028 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 02:51:09,029 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 02:51:09,030 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 02:51:09,031 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 02:51:09,032 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 02:51:09,033 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 02:51:09,034 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 02:51:09,034 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 02:51:09,036 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 02:51:09,036 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 02:51:09,036 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 02:51:09,037 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 02:51:09,037 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 02:51:09,040 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 02:51:09,041 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 02:51:09,041 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 02:51:09,042 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 02:51:09,042 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 02:51:09,042 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 02:51:09,042 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 02:51:09,043 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 02:51:09,043 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 02:51:09,043 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 02:51:09,044 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 02:51:09,044 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 02:51:09,044 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 02:51:09,045 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 02:51:09,045 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 02:51:09,045 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 02:51:09,045 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 02:51:09,046 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 02:51:09,046 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 02:51:09,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 02:51:09,047 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 02:51:09,047 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 02:51:09,047 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 02:51:09,049 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 02:51:09,049 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 -> 0e3b66e9eccfd4fa8e4be46135bb01f9b94498d71482eaa706147ef592b066a9 [2024-11-12 02:51:09,330 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 02:51:09,354 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 02:51:09,358 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 02:51:09,360 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 02:51:09,360 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 02:51:09,361 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-60.i [2024-11-12 02:51:10,884 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 02:51:11,121 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 02:51:11,121 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-60.i [2024-11-12 02:51:11,133 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3809f77ac/1c8fb7c18d3846cc821e2f78b59bce59/FLAGfc50db7d5 [2024-11-12 02:51:11,149 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3809f77ac/1c8fb7c18d3846cc821e2f78b59bce59 [2024-11-12 02:51:11,153 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 02:51:11,155 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 02:51:11,156 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 02:51:11,156 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 02:51:11,164 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 02:51:11,165 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:51:11" (1/1) ... [2024-11-12 02:51:11,166 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dada65e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:51:11, skipping insertion in model container [2024-11-12 02:51:11,167 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:51:11" (1/1) ... [2024-11-12 02:51:11,204 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 02:51:11,388 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_fillercode_fillercodestructure_filler-pe-ci_file-60.i[919,932] [2024-11-12 02:51:11,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 02:51:11,490 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 02:51:11,502 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_fillercode_fillercodestructure_filler-pe-ci_file-60.i[919,932] [2024-11-12 02:51:11,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 02:51:11,566 INFO L204 MainTranslator]: Completed translation [2024-11-12 02:51:11,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:51:11 WrapperNode [2024-11-12 02:51:11,567 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 02:51:11,568 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 02:51:11,568 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 02:51:11,568 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 02:51:11,576 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:51:11" (1/1) ... [2024-11-12 02:51:11,589 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:51:11" (1/1) ... [2024-11-12 02:51:11,631 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 198 [2024-11-12 02:51:11,631 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 02:51:11,632 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 02:51:11,632 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 02:51:11,632 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 02:51:11,644 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:51:11" (1/1) ... [2024-11-12 02:51:11,645 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:51:11" (1/1) ... [2024-11-12 02:51:11,648 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:51:11" (1/1) ... [2024-11-12 02:51:11,682 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 02:51:11,683 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:51:11" (1/1) ... [2024-11-12 02:51:11,684 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:51:11" (1/1) ... [2024-11-12 02:51:11,697 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:51:11" (1/1) ... [2024-11-12 02:51:11,705 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:51:11" (1/1) ... [2024-11-12 02:51:11,727 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:51:11" (1/1) ... [2024-11-12 02:51:11,729 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:51:11" (1/1) ... [2024-11-12 02:51:11,736 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 02:51:11,740 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 02:51:11,740 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 02:51:11,741 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 02:51:11,742 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:51:11" (1/1) ... [2024-11-12 02:51:11,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 02:51:11,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 02:51:11,831 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 02:51:11,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 02:51:11,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 02:51:11,903 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 02:51:11,905 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 02:51:11,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 02:51:11,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 02:51:11,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 02:51:12,022 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 02:51:12,024 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 02:51:12,508 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-12 02:51:12,508 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 02:51:12,534 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 02:51:12,534 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 02:51:12,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:51:12 BoogieIcfgContainer [2024-11-12 02:51:12,535 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 02:51:12,538 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 02:51:12,540 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 02:51:12,544 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 02:51:12,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:51:11" (1/3) ... [2024-11-12 02:51:12,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23aa9e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:51:12, skipping insertion in model container [2024-11-12 02:51:12,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:51:11" (2/3) ... [2024-11-12 02:51:12,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23aa9e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:51:12, skipping insertion in model container [2024-11-12 02:51:12,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:51:12" (3/3) ... [2024-11-12 02:51:12,548 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-60.i [2024-11-12 02:51:12,565 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 02:51:12,565 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 02:51:12,657 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 02:51:12,664 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;@3460709b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 02:51:12,664 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 02:51:12,668 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 54 states have (on average 1.462962962962963) internal successors, (79), 55 states have internal predecessors, (79), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-12 02:51:12,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-12 02:51:12,681 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:51:12,682 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:51:12,683 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:51:12,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:51:12,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1229361647, now seen corresponding path program 1 times [2024-11-12 02:51:12,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:51:12,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356463549] [2024-11-12 02:51:12,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:51:12,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:51:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:13,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:51:13,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:13,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:51:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:13,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:51:13,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:13,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:51:13,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:13,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:51:13,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:13,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:51:13,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:13,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 02:51:13,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:13,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:51:13,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:13,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 02:51:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:13,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:51:13,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:13,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 02:51:13,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:13,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 02:51:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:13,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 02:51:13,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:13,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 02:51:13,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:13,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 02:51:13,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:13,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 02:51:13,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:13,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 02:51:13,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:13,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 02:51:13,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:13,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 02:51:13,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:13,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 02:51:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:13,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 02:51:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:13,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 02:51:13,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:13,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 02:51:13,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:13,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 02:51:13,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:13,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 02:51:13,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:13,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 02:51:13,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:13,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 02:51:13,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:13,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 02:51:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:13,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-12 02:51:13,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:13,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-12 02:51:13,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:51:13,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356463549] [2024-11-12 02:51:13,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356463549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:51:13,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:51:13,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 02:51:13,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847426631] [2024-11-12 02:51:13,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:51:13,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 02:51:13,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:51:13,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 02:51:13,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 02:51:13,558 INFO L87 Difference]: Start difference. First operand has 86 states, 54 states have (on average 1.462962962962963) internal successors, (79), 55 states have internal predecessors, (79), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-12 02:51:13,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:51:13,671 INFO L93 Difference]: Finished difference Result 210 states and 383 transitions. [2024-11-12 02:51:13,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 02:51:13,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 184 [2024-11-12 02:51:13,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:51:13,689 INFO L225 Difference]: With dead ends: 210 [2024-11-12 02:51:13,689 INFO L226 Difference]: Without dead ends: 127 [2024-11-12 02:51:13,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 02:51:13,701 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 69 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 02:51:13,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 315 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 02:51:13,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-12 02:51:13,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2024-11-12 02:51:13,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 80 states have (on average 1.425) internal successors, (114), 81 states have internal predecessors, (114), 41 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-12 02:51:13,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 196 transitions. [2024-11-12 02:51:13,769 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 196 transitions. Word has length 184 [2024-11-12 02:51:13,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:51:13,771 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 196 transitions. [2024-11-12 02:51:13,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-12 02:51:13,772 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 196 transitions. [2024-11-12 02:51:13,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-12 02:51:13,779 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:51:13,779 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:51:13,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 02:51:13,780 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:51:13,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:51:13,782 INFO L85 PathProgramCache]: Analyzing trace with hash -114942725, now seen corresponding path program 1 times [2024-11-12 02:51:13,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:51:13,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114857231] [2024-11-12 02:51:13,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:51:13,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:51:13,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:51:14,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:51:14,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:51:14,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:51:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:51:14,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:51:14,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 02:51:14,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:51:14,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 02:51:14,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:51:14,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 02:51:14,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 02:51:14,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 02:51:14,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 02:51:14,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 02:51:14,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 02:51:14,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 02:51:14,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 02:51:14,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 02:51:14,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 02:51:14,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 02:51:14,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 02:51:14,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 02:51:14,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 02:51:14,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 02:51:14,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 02:51:14,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 02:51:14,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 02:51:14,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-12 02:51:14,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-12 02:51:14,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:51:14,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114857231] [2024-11-12 02:51:14,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114857231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:51:14,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:51:14,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 02:51:14,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371594926] [2024-11-12 02:51:14,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:51:14,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 02:51:14,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:51:14,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 02:51:14,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 02:51:14,236 INFO L87 Difference]: Start difference. First operand 124 states and 196 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-12 02:51:14,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:51:14,314 INFO L93 Difference]: Finished difference Result 287 states and 457 transitions. [2024-11-12 02:51:14,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 02:51:14,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 185 [2024-11-12 02:51:14,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:51:14,322 INFO L225 Difference]: With dead ends: 287 [2024-11-12 02:51:14,324 INFO L226 Difference]: Without dead ends: 166 [2024-11-12 02:51:14,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 02:51:14,330 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 34 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 02:51:14,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 245 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 02:51:14,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-12 02:51:14,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 132. [2024-11-12 02:51:14,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 88 states have (on average 1.4204545454545454) internal successors, (125), 89 states have internal predecessors, (125), 41 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-12 02:51:14,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 207 transitions. [2024-11-12 02:51:14,369 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 207 transitions. Word has length 185 [2024-11-12 02:51:14,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:51:14,370 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 207 transitions. [2024-11-12 02:51:14,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-12 02:51:14,371 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 207 transitions. [2024-11-12 02:51:14,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-12 02:51:14,374 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:51:14,374 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:51:14,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 02:51:14,375 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:51:14,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:51:14,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1394806403, now seen corresponding path program 1 times [2024-11-12 02:51:14,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:51:14,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012907546] [2024-11-12 02:51:14,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:51:14,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:51:14,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:51:14,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:51:14,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:51:14,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:51:14,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:51:14,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:51:14,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 02:51:14,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:51:14,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 02:51:14,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:51:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 02:51:14,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 02:51:14,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 02:51:14,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 02:51:14,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 02:51:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 02:51:14,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 02:51:14,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 02:51:14,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 02:51:14,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 02:51:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 02:51:14,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 02:51:14,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 02:51:14,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 02:51:14,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 02:51:14,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 02:51:14,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 02:51:14,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 02:51:14,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-12 02:51:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:14,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-12 02:51:14,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:51:14,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012907546] [2024-11-12 02:51:14,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012907546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:51:14,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:51:14,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 02:51:14,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720152415] [2024-11-12 02:51:14,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:51:14,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 02:51:14,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:51:14,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 02:51:14,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 02:51:14,651 INFO L87 Difference]: Start difference. First operand 132 states and 207 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-12 02:51:14,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:51:14,719 INFO L93 Difference]: Finished difference Result 299 states and 471 transitions. [2024-11-12 02:51:14,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 02:51:14,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 185 [2024-11-12 02:51:14,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:51:14,722 INFO L225 Difference]: With dead ends: 299 [2024-11-12 02:51:14,722 INFO L226 Difference]: Without dead ends: 170 [2024-11-12 02:51:14,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 02:51:14,724 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 28 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 02:51:14,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 247 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 02:51:14,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-12 02:51:14,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 144. [2024-11-12 02:51:14,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 100 states have (on average 1.44) internal successors, (144), 101 states have internal predecessors, (144), 41 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-12 02:51:14,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 226 transitions. [2024-11-12 02:51:14,745 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 226 transitions. Word has length 185 [2024-11-12 02:51:14,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:51:14,746 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 226 transitions. [2024-11-12 02:51:14,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-12 02:51:14,747 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 226 transitions. [2024-11-12 02:51:14,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-12 02:51:14,750 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:51:14,750 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:51:14,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 02:51:14,750 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:51:14,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:51:14,751 INFO L85 PathProgramCache]: Analyzing trace with hash -714748033, now seen corresponding path program 1 times [2024-11-12 02:51:14,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:51:14,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504574091] [2024-11-12 02:51:14,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:51:14,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:51:14,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:15,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:51:15,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:15,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:51:15,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:15,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:51:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:15,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:51:15,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:15,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:51:15,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:15,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:51:15,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:15,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 02:51:15,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:15,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:51:15,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:15,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 02:51:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:15,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:51:15,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:15,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 02:51:15,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:15,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 02:51:15,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:15,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 02:51:15,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:15,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 02:51:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:15,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 02:51:15,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:15,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 02:51:15,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:15,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 02:51:15,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:15,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 02:51:15,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:15,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 02:51:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:15,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 02:51:15,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:15,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 02:51:15,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:15,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 02:51:15,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:15,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 02:51:15,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:15,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 02:51:15,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:15,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 02:51:15,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:15,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 02:51:15,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:15,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 02:51:15,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:15,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 02:51:15,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:15,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-12 02:51:15,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:15,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 18 proven. 66 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-12 02:51:15,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:51:15,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504574091] [2024-11-12 02:51:15,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504574091] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 02:51:15,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566619112] [2024-11-12 02:51:15,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:51:15,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 02:51:15,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 02:51:15,524 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 02:51:15,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 02:51:15,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:15,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 02:51:15,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 02:51:16,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 568 proven. 66 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2024-11-12 02:51:16,037 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 02:51:16,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 18 proven. 66 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-12 02:51:16,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566619112] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 02:51:16,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 02:51:16,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-12 02:51:16,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013306810] [2024-11-12 02:51:16,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 02:51:16,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 02:51:16,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:51:16,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 02:51:16,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-12 02:51:16,378 INFO L87 Difference]: Start difference. First operand 144 states and 226 transitions. Second operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 2 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) [2024-11-12 02:51:17,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:51:17,140 INFO L93 Difference]: Finished difference Result 326 states and 491 transitions. [2024-11-12 02:51:17,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-12 02:51:17,141 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 2 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) Word has length 185 [2024-11-12 02:51:17,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:51:17,143 INFO L225 Difference]: With dead ends: 326 [2024-11-12 02:51:17,144 INFO L226 Difference]: Without dead ends: 185 [2024-11-12 02:51:17,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 424 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=184, Invalid=368, Unknown=0, NotChecked=0, Total=552 [2024-11-12 02:51:17,146 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 190 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 02:51:17,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 300 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 02:51:17,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-12 02:51:17,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 160. [2024-11-12 02:51:17,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 112 states have (on average 1.3392857142857142) internal successors, (150), 113 states have internal predecessors, (150), 41 states have call successors, (41), 6 states have call predecessors, (41), 6 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-12 02:51:17,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 232 transitions. [2024-11-12 02:51:17,166 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 232 transitions. Word has length 185 [2024-11-12 02:51:17,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:51:17,167 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 232 transitions. [2024-11-12 02:51:17,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 2 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) [2024-11-12 02:51:17,167 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 232 transitions. [2024-11-12 02:51:17,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-12 02:51:17,169 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:51:17,169 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:51:17,188 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-12 02:51:17,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 02:51:17,371 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:51:17,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:51:17,371 INFO L85 PathProgramCache]: Analyzing trace with hash -822222266, now seen corresponding path program 1 times [2024-11-12 02:51:17,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:51:17,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025346444] [2024-11-12 02:51:17,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:51:17,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:51:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:17,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:51:17,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:17,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:51:17,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:17,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:51:17,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:17,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:51:17,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:17,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:51:17,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:17,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:51:17,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:17,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 02:51:17,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:17,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:51:17,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:17,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 02:51:17,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:17,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:51:17,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:17,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 02:51:17,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:17,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 02:51:17,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:17,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 02:51:17,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:17,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 02:51:17,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:17,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 02:51:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:17,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 02:51:17,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:17,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 02:51:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:17,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 02:51:17,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:17,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 02:51:17,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:17,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 02:51:17,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:17,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 02:51:17,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:17,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 02:51:17,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:17,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 02:51:17,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:17,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 02:51:17,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:17,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 02:51:17,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:17,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 02:51:17,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:17,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 02:51:17,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:17,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 02:51:17,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:17,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-12 02:51:17,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:17,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 60 proven. 24 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-12 02:51:17,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:51:17,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025346444] [2024-11-12 02:51:17,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025346444] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 02:51:17,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249525919] [2024-11-12 02:51:17,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:51:17,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 02:51:17,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 02:51:17,795 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-12 02:51:17,798 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-12 02:51:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:17,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 02:51:17,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 02:51:18,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 378 proven. 9 refuted. 0 times theorem prover too weak. 1237 trivial. 0 not checked. [2024-11-12 02:51:18,030 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 02:51:18,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 75 proven. 9 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-12 02:51:18,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249525919] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 02:51:18,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 02:51:18,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-12 02:51:18,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482317883] [2024-11-12 02:51:18,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 02:51:18,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 02:51:18,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:51:18,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 02:51:18,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-12 02:51:18,225 INFO L87 Difference]: Start difference. First operand 160 states and 232 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 3 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) [2024-11-12 02:51:18,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:51:18,580 INFO L93 Difference]: Finished difference Result 333 states and 473 transitions. [2024-11-12 02:51:18,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 02:51:18,581 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 3 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) Word has length 186 [2024-11-12 02:51:18,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:51:18,583 INFO L225 Difference]: With dead ends: 333 [2024-11-12 02:51:18,583 INFO L226 Difference]: Without dead ends: 176 [2024-11-12 02:51:18,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 427 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2024-11-12 02:51:18,585 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 200 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 02:51:18,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 209 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 02:51:18,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-12 02:51:18,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 166. [2024-11-12 02:51:18,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 116 states have (on average 1.2586206896551724) internal successors, (146), 117 states have internal predecessors, (146), 41 states have call successors, (41), 8 states have call predecessors, (41), 8 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-12 02:51:18,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 228 transitions. [2024-11-12 02:51:18,608 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 228 transitions. Word has length 186 [2024-11-12 02:51:18,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:51:18,609 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 228 transitions. [2024-11-12 02:51:18,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 3 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) [2024-11-12 02:51:18,610 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 228 transitions. [2024-11-12 02:51:18,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-12 02:51:18,612 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:51:18,612 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:51:18,652 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-12 02:51:18,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 02:51:18,835 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:51:18,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:51:18,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1929671527, now seen corresponding path program 1 times [2024-11-12 02:51:18,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:51:18,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055132127] [2024-11-12 02:51:18,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:51:18,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:51:18,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 02:51:18,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1465086404] [2024-11-12 02:51:18,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:51:18,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 02:51:18,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 02:51:18,920 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 02:51:18,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 02:51:19,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:19,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-12 02:51:19,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 02:51:20,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 730 proven. 57 refuted. 0 times theorem prover too weak. 837 trivial. 0 not checked. [2024-11-12 02:51:20,074 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 02:51:20,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:51:20,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055132127] [2024-11-12 02:51:20,283 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 02:51:20,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465086404] [2024-11-12 02:51:20,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465086404] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 02:51:20,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-12 02:51:20,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2024-11-12 02:51:20,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915472824] [2024-11-12 02:51:20,286 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-12 02:51:20,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 02:51:20,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:51:20,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 02:51:20,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-12 02:51:20,288 INFO L87 Difference]: Start difference. First operand 166 states and 228 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-12 02:51:20,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:51:20,841 INFO L93 Difference]: Finished difference Result 475 states and 651 transitions. [2024-11-12 02:51:20,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 02:51:20,842 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 187 [2024-11-12 02:51:20,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:51:20,845 INFO L225 Difference]: With dead ends: 475 [2024-11-12 02:51:20,845 INFO L226 Difference]: Without dead ends: 312 [2024-11-12 02:51:20,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2024-11-12 02:51:20,847 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 86 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 02:51:20,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 538 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 02:51:20,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-11-12 02:51:20,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 241. [2024-11-12 02:51:20,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 156 states have (on average 1.205128205128205) internal successors, (188), 157 states have internal predecessors, (188), 70 states have call successors, (70), 14 states have call predecessors, (70), 14 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-12 02:51:20,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 328 transitions. [2024-11-12 02:51:20,891 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 328 transitions. Word has length 187 [2024-11-12 02:51:20,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:51:20,891 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 328 transitions. [2024-11-12 02:51:20,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-12 02:51:20,892 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 328 transitions. [2024-11-12 02:51:20,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-12 02:51:20,894 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:51:20,894 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:51:20,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-12 02:51:21,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 02:51:21,099 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:51:21,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:51:21,099 INFO L85 PathProgramCache]: Analyzing trace with hash 676352027, now seen corresponding path program 1 times [2024-11-12 02:51:21,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:51:21,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357297871] [2024-11-12 02:51:21,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:51:21,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:51:21,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 02:51:21,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1165252207] [2024-11-12 02:51:21,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:51:21,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 02:51:21,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 02:51:21,187 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 02:51:21,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-12 02:51:21,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 02:51:21,365 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 02:51:21,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 02:51:21,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 02:51:21,510 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 02:51:21,512 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 02:51:21,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-12 02:51:21,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 02:51:21,717 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:51:21,845 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 02:51:21,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:51:21 BoogieIcfgContainer [2024-11-12 02:51:21,848 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 02:51:21,848 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 02:51:21,848 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 02:51:21,848 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 02:51:21,849 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:51:12" (3/4) ... [2024-11-12 02:51:21,852 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 02:51:21,853 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 02:51:21,854 INFO L158 Benchmark]: Toolchain (without parser) took 10699.10ms. Allocated memory was 140.5MB in the beginning and 243.3MB in the end (delta: 102.8MB). Free memory was 83.8MB in the beginning and 148.2MB in the end (delta: -64.4MB). Peak memory consumption was 40.1MB. Max. memory is 16.1GB. [2024-11-12 02:51:21,854 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 140.5MB. Free memory is still 100.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 02:51:21,854 INFO L158 Benchmark]: CACSL2BoogieTranslator took 411.53ms. Allocated memory is still 140.5MB. Free memory was 83.5MB in the beginning and 66.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 02:51:21,855 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.32ms. Allocated memory is still 140.5MB. Free memory was 66.7MB in the beginning and 63.2MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 02:51:21,855 INFO L158 Benchmark]: Boogie Preprocessor took 107.06ms. Allocated memory is still 140.5MB. Free memory was 63.2MB in the beginning and 111.0MB in the end (delta: -47.8MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. [2024-11-12 02:51:21,855 INFO L158 Benchmark]: RCFGBuilder took 795.38ms. Allocated memory is still 140.5MB. Free memory was 111.0MB in the beginning and 86.8MB in the end (delta: 24.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-12 02:51:21,856 INFO L158 Benchmark]: TraceAbstraction took 9309.68ms. Allocated memory was 140.5MB in the beginning and 243.3MB in the end (delta: 102.8MB). Free memory was 86.0MB in the beginning and 148.2MB in the end (delta: -62.2MB). Peak memory consumption was 42.3MB. Max. memory is 16.1GB. [2024-11-12 02:51:21,856 INFO L158 Benchmark]: Witness Printer took 4.96ms. Allocated memory is still 243.3MB. Free memory is still 148.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 02:51:21,858 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.14ms. Allocated memory is still 140.5MB. Free memory is still 100.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 411.53ms. Allocated memory is still 140.5MB. Free memory was 83.5MB in the beginning and 66.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.32ms. Allocated memory is still 140.5MB. Free memory was 66.7MB in the beginning and 63.2MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 107.06ms. Allocated memory is still 140.5MB. Free memory was 63.2MB in the beginning and 111.0MB in the end (delta: -47.8MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. * RCFGBuilder took 795.38ms. Allocated memory is still 140.5MB. Free memory was 111.0MB in the beginning and 86.8MB in the end (delta: 24.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 9309.68ms. Allocated memory was 140.5MB in the beginning and 243.3MB in the end (delta: 102.8MB). Free memory was 86.0MB in the beginning and 148.2MB in the end (delta: -62.2MB). Peak memory consumption was 42.3MB. Max. memory is 16.1GB. * Witness Printer took 4.96ms. Allocated memory is still 243.3MB. Free memory is still 148.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 192, overapproximation of someBinaryDOUBLEComparisonOperation at line 192, overapproximation of someBinaryArithmeticDOUBLEoperation at line 117. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 32; [L23] unsigned char var_1_2 = 1; [L24] float var_1_4 = 7.8; [L25] signed short int var_1_6 = 16; [L26] signed short int var_1_7 = 256; [L27] float var_1_8 = 256.6; [L28] unsigned char var_1_9 = 50; [L29] unsigned char var_1_10 = 5; [L30] double var_1_11 = 127.75; [L31] unsigned char var_1_12 = 1; [L32] unsigned char var_1_13 = 1; [L33] unsigned char var_1_14 = 0; [L34] double var_1_15 = 15.2; [L35] double var_1_16 = 256.5; [L36] double var_1_17 = 256.5; [L37] double var_1_18 = 0.0; [L38] double var_1_19 = 9.7; [L39] unsigned long int var_1_20 = 10000000; [L40] unsigned long int var_1_21 = 4008920074; [L41] unsigned char var_1_23 = 0; [L42] unsigned char var_1_29 = 1; [L43] unsigned char var_1_30 = 0; [L44] signed long int var_1_31 = -32; [L45] float var_1_35 = 31.6; [L46] signed short int var_1_38 = -2; [L47] float var_1_40 = 7.2; [L48] signed short int var_1_43 = 25; [L49] signed long int var_1_44 = -2; [L50] signed short int last_1_var_1_1 = 32; [L51] unsigned char last_1_var_1_9 = 50; [L52] double last_1_var_1_11 = 127.75; [L53] double last_1_var_1_16 = 256.5; [L54] unsigned long int last_1_var_1_20 = 10000000; VAL [isInitial=0, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=1, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_4=39/5, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L196] isInitial = 1 [L197] FCALL initially() [L198] COND TRUE 1 [L199] CALL updateLastVariables() [L185] last_1_var_1_1 = var_1_1 [L186] last_1_var_1_9 = var_1_9 [L187] last_1_var_1_11 = var_1_11 [L188] last_1_var_1_16 = var_1_16 [L189] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=1, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_4=39/5, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L199] RET updateLastVariables() [L200] CALL updateVariables() [L138] var_1_2 = __VERIFIER_nondet_uchar() [L139] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_4=39/5, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_4=39/5, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L139] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_4=39/5, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L140] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_4=39/5, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_4=39/5, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L140] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_4=39/5, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L141] var_1_4 = __VERIFIER_nondet_float() [L142] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L142] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L143] CALL assume_abort_if_not(var_1_4 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L143] RET assume_abort_if_not(var_1_4 != 0.0F) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L144] var_1_6 = __VERIFIER_nondet_short() [L145] CALL assume_abort_if_not(var_1_6 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L145] RET assume_abort_if_not(var_1_6 >= -1) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L146] CALL assume_abort_if_not(var_1_6 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L146] RET assume_abort_if_not(var_1_6 <= 32766) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L147] var_1_7 = __VERIFIER_nondet_short() [L148] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L148] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L149] CALL assume_abort_if_not(var_1_7 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L149] RET assume_abort_if_not(var_1_7 <= 32766) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L150] var_1_10 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L151] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L152] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L152] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L153] var_1_12 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L154] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L155] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L155] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L156] var_1_13 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L157] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L158] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L158] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L159] var_1_14 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L160] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L161] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L161] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L162] var_1_15 = __VERIFIER_nondet_double() [L163] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L163] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L164] var_1_17 = __VERIFIER_nondet_double() [L165] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L165] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L166] var_1_18 = __VERIFIER_nondet_double() [L167] CALL assume_abort_if_not((var_1_18 >= 4611686.018427382800e+12F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L167] RET assume_abort_if_not((var_1_18 >= 4611686.018427382800e+12F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L168] var_1_19 = __VERIFIER_nondet_double() [L169] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L169] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L170] var_1_21 = __VERIFIER_nondet_ulong() [L171] CALL assume_abort_if_not(var_1_21 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=-2147483649, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=-2147483649, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L171] RET assume_abort_if_not(var_1_21 >= 2147483647) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=-2147483649, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L172] CALL assume_abort_if_not(var_1_21 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=-2147483649, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=-2147483649, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L172] RET assume_abort_if_not(var_1_21 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=-2147483649, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L173] var_1_29 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_29 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=-2147483649, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=-2147483649, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L174] RET assume_abort_if_not(var_1_29 >= 1) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=-2147483649, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L175] CALL assume_abort_if_not(var_1_29 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=-2147483649, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=-2147483649, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L175] RET assume_abort_if_not(var_1_29 <= 1) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=-2147483649, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L176] var_1_30 = __VERIFIER_nondet_uchar() [L177] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=-2147483649, var_1_23=0, var_1_29=1, var_1_2=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=-2147483649, var_1_23=0, var_1_29=1, var_1_2=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L177] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=-2147483649, var_1_23=0, var_1_29=1, var_1_2=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L178] CALL assume_abort_if_not(var_1_30 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=-2147483649, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=-2147483649, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L178] RET assume_abort_if_not(var_1_30 <= 0) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=-2147483649, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-2, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L179] var_1_44 = __VERIFIER_nondet_long() [L180] CALL assume_abort_if_not(var_1_44 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=-2147483649, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-1, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=-2147483649, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-1, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L180] RET assume_abort_if_not(var_1_44 >= -2147483647) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=-2147483649, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-1, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L181] CALL assume_abort_if_not(var_1_44 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=-2147483649, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-1, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=-2147483649, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-1, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L181] RET assume_abort_if_not(var_1_44 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=-2147483649, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-1, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L182] CALL assume_abort_if_not(var_1_44 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=-2147483649, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-1, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=-2147483649, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-1, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L182] RET assume_abort_if_not(var_1_44 != 0) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=-2147483649, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-1, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L200] RET updateVariables() [L201] CALL step() [L58] signed long int stepLocal_0 = (((var_1_7) < (last_1_var_1_1)) ? (var_1_7) : (last_1_var_1_1)); VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=-2147483649, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-1, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=50] [L59] COND FALSE !(last_1_var_1_11 < (last_1_var_1_11 + last_1_var_1_16)) [L66] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=-2147483649, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-1, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=2] [L68] unsigned long int stepLocal_1 = last_1_var_1_20; VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, stepLocal_1=10000000, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=-2147483649, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-1, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=2] [L69] COND FALSE !(((var_1_10 * last_1_var_1_9) + last_1_var_1_1) > stepLocal_1) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=-2147483649, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-1, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=2] [L72] COND TRUE (last_1_var_1_16 >= last_1_var_1_16) || ((var_1_2 && var_1_12) || (var_1_13 || var_1_14)) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, var_1_10=2, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=-2147483649, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-1, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=2] [L73] COND FALSE !(\read(var_1_2)) [L76] var_1_11 = var_1_15 VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=-2147483649, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-1, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=2] [L81] COND TRUE \read(var_1_13) [L82] var_1_20 = (((((var_1_9) > (128u)) ? (var_1_9) : (128u))) + var_1_9) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2, var_1_16=513/2, var_1_1=32, var_1_20=130, var_1_21=-2147483649, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-1, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=2] [L90] COND FALSE !((- var_1_16) <= var_1_4) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2, var_1_16=513/2, var_1_1=32, var_1_20=130, var_1_21=-2147483649, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-1, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=2] [L95] COND FALSE !(\read(var_1_2)) [L102] var_1_1 = var_1_9 VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2, var_1_16=513/2, var_1_1=2, var_1_20=130, var_1_21=-2147483649, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-1, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=2] [L104] COND TRUE var_1_1 <= (var_1_7 + var_1_10) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2, var_1_16=513/2, var_1_1=2, var_1_20=130, var_1_21=-2147483649, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-1, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=2] [L105] COND FALSE !(var_1_21 < var_1_10) [L108] var_1_23 = var_1_30 VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2, var_1_16=513/2, var_1_1=2, var_1_20=130, var_1_21=-2147483649, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-1, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=2] [L111] COND FALSE !(var_1_9 != var_1_1) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2, var_1_16=513/2, var_1_1=2, var_1_20=130, var_1_21=-2147483649, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_35=158/5, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-1, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=2] [L114] COND FALSE !(var_1_2 && var_1_29) [L117] var_1_35 = (var_1_19 + var_1_19) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2, var_1_16=513/2, var_1_1=2, var_1_20=130, var_1_21=-2147483649, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_38=-2, var_1_40=36/5, var_1_43=25, var_1_44=-1, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=2] [L119] var_1_38 = var_1_10 VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2, var_1_16=513/2, var_1_1=2, var_1_20=130, var_1_21=-2147483649, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_38=2, var_1_40=36/5, var_1_43=25, var_1_44=-1, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=2] [L120] COND FALSE !(\read(var_1_30)) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2, var_1_16=513/2, var_1_1=2, var_1_20=130, var_1_21=-2147483649, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_38=2, var_1_40=36/5, var_1_43=25, var_1_44=-1, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=2] [L127] COND TRUE (var_1_7 * var_1_9) > (~ var_1_9) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2, var_1_16=513/2, var_1_1=2, var_1_20=130, var_1_21=-2147483649, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_38=2, var_1_40=36/5, var_1_43=25, var_1_44=-1, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=2] [L128] COND TRUE var_1_19 == 0.25f [L129] var_1_40 = var_1_19 VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2, var_1_16=513/2, var_1_19=3, var_1_1=2, var_1_20=130, var_1_21=-2147483649, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_38=2, var_1_40=3, var_1_43=25, var_1_44=-1, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=2] [L133] COND TRUE ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) <= (2 / ((((var_1_44) < 0 ) ? -(var_1_44) : (var_1_44)))) [L134] var_1_43 = ((((var_1_9) > (var_1_9)) ? (var_1_9) : (var_1_9))) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, stepLocal_0=32, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2, var_1_16=513/2, var_1_19=3, var_1_1=2, var_1_20=130, var_1_21=-2147483649, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_38=2, var_1_40=3, var_1_43=2, var_1_44=-1, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=2] [L201] RET step() [L202] CALL, EXPR property() [L192-L193] return (((((var_1_2 ? (((var_1_11 / var_1_4) <= var_1_8) ? (var_1_1 == ((signed short int) (var_1_9 - var_1_9))) : (var_1_1 == ((signed short int) var_1_9))) : (var_1_1 == ((signed short int) var_1_9))) && (((- var_1_16) <= var_1_4) ? (((var_1_11 <= var_1_4) || var_1_2) ? (var_1_8 == ((float) 3.3f)) : 1) : 1)) && ((last_1_var_1_11 < (last_1_var_1_11 + last_1_var_1_16)) ? ((((((var_1_7) < (last_1_var_1_1)) ? (var_1_7) : (last_1_var_1_1))) > (var_1_6 * 1)) ? (var_1_9 == ((unsigned char) var_1_10)) : (var_1_9 == ((unsigned char) var_1_10))) : (var_1_9 == ((unsigned char) var_1_10)))) && (((last_1_var_1_16 >= last_1_var_1_16) || ((var_1_2 && var_1_12) || (var_1_13 || var_1_14))) ? (var_1_2 ? (var_1_11 == ((double) var_1_15)) : (var_1_11 == ((double) var_1_15))) : (var_1_11 == ((double) var_1_15)))) && ((((var_1_10 * last_1_var_1_9) + last_1_var_1_1) > last_1_var_1_20) ? (var_1_16 == ((double) (var_1_17 - (var_1_18 - var_1_19)))) : 1)) && (var_1_13 ? (var_1_20 == ((unsigned long int) (((((var_1_9) > (128u)) ? (var_1_9) : (128u))) + var_1_9))) : ((var_1_9 >= var_1_9) ? (var_1_20 == ((unsigned long int) (var_1_21 - var_1_9))) : (var_1_20 == ((unsigned long int) var_1_9)))) ; VAL [\result=0, isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2, var_1_16=513/2, var_1_19=3, var_1_1=2, var_1_20=130, var_1_21=-2147483649, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_38=2, var_1_40=3, var_1_43=2, var_1_44=-1, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=2] [L202] RET, EXPR property() [L202] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2, var_1_16=513/2, var_1_19=3, var_1_1=2, var_1_20=130, var_1_21=-2147483649, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_38=2, var_1_40=3, var_1_43=2, var_1_44=-1, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=511/4, last_1_var_1_16=513/2, last_1_var_1_1=32, last_1_var_1_20=10000000, last_1_var_1_9=50, var_1_10=2, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2, var_1_16=513/2, var_1_19=3, var_1_1=2, var_1_20=130, var_1_21=-2147483649, var_1_23=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-32, var_1_38=2, var_1_40=3, var_1_43=2, var_1_44=-1, var_1_6=-1, var_1_7=33, var_1_8=1283/5, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.1s, OverallIterations: 7, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 608 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 607 mSDsluCounter, 1854 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1138 mSDsCounter, 354 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1057 IncrementalHoareTripleChecker+Invalid, 1411 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 354 mSolverCounterUnsat, 716 mSDtfsCounter, 1057 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1292 GetRequests, 1232 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=241occurred in iteration=6, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 169 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 2044 NumberOfCodeBlocks, 2044 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1844 ConstructedInterpolants, 0 QuantifiedInterpolants, 4472 SizeOfPredicates, 11 NumberOfNonLiveVariables, 1294 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 15943/16240 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 02:51:21,895 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_fillercode_fillercodestructure_filler-pe-ci_file-60.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 0e3b66e9eccfd4fa8e4be46135bb01f9b94498d71482eaa706147ef592b066a9 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 02:51:24,324 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 02:51:24,406 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 02:51:24,413 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 02:51:24,415 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 02:51:24,447 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 02:51:24,447 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 02:51:24,448 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 02:51:24,448 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 02:51:24,449 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 02:51:24,449 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 02:51:24,450 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 02:51:24,450 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 02:51:24,452 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 02:51:24,452 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 02:51:24,453 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 02:51:24,453 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 02:51:24,453 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 02:51:24,453 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 02:51:24,454 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 02:51:24,454 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 02:51:24,457 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 02:51:24,458 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 02:51:24,458 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 02:51:24,458 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 02:51:24,458 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 02:51:24,459 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 02:51:24,459 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 02:51:24,459 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 02:51:24,459 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 02:51:24,460 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 02:51:24,460 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 02:51:24,460 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 02:51:24,460 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 02:51:24,460 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 02:51:24,461 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 02:51:24,461 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 02:51:24,462 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 02:51:24,462 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 02:51:24,462 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 02:51:24,463 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 02:51:24,463 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 02:51:24,463 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 02:51:24,463 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 02:51:24,464 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 -> 0e3b66e9eccfd4fa8e4be46135bb01f9b94498d71482eaa706147ef592b066a9 [2024-11-12 02:51:24,799 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 02:51:24,824 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 02:51:24,827 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 02:51:24,828 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 02:51:24,828 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 02:51:24,830 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-60.i [2024-11-12 02:51:26,273 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 02:51:26,492 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 02:51:26,493 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-60.i [2024-11-12 02:51:26,504 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c3c5095b/61d2e3ea5d5d413cab938ab579e16ef3/FLAG5210f410f [2024-11-12 02:51:26,520 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c3c5095b/61d2e3ea5d5d413cab938ab579e16ef3 [2024-11-12 02:51:26,523 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 02:51:26,525 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 02:51:26,527 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 02:51:26,527 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 02:51:26,533 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 02:51:26,534 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:51:26" (1/1) ... [2024-11-12 02:51:26,536 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b88c6c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:51:26, skipping insertion in model container [2024-11-12 02:51:26,537 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:51:26" (1/1) ... [2024-11-12 02:51:26,571 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 02:51:26,763 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_fillercode_fillercodestructure_filler-pe-ci_file-60.i[919,932] [2024-11-12 02:51:26,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 02:51:26,872 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 02:51:26,886 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_fillercode_fillercodestructure_filler-pe-ci_file-60.i[919,932] [2024-11-12 02:51:26,928 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 02:51:26,953 INFO L204 MainTranslator]: Completed translation [2024-11-12 02:51:26,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:51:26 WrapperNode [2024-11-12 02:51:26,954 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 02:51:26,955 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 02:51:26,955 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 02:51:26,955 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 02:51:26,962 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:51:26" (1/1) ... [2024-11-12 02:51:26,980 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:51:26" (1/1) ... [2024-11-12 02:51:27,014 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 195 [2024-11-12 02:51:27,014 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 02:51:27,015 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 02:51:27,015 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 02:51:27,015 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 02:51:27,032 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:51:26" (1/1) ... [2024-11-12 02:51:27,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:51:26" (1/1) ... [2024-11-12 02:51:27,039 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:51:26" (1/1) ... [2024-11-12 02:51:27,065 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 02:51:27,066 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:51:26" (1/1) ... [2024-11-12 02:51:27,066 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:51:26" (1/1) ... [2024-11-12 02:51:27,081 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:51:26" (1/1) ... [2024-11-12 02:51:27,085 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:51:26" (1/1) ... [2024-11-12 02:51:27,091 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:51:26" (1/1) ... [2024-11-12 02:51:27,093 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:51:26" (1/1) ... [2024-11-12 02:51:27,100 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 02:51:27,102 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 02:51:27,103 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 02:51:27,103 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 02:51:27,104 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:51:26" (1/1) ... [2024-11-12 02:51:27,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 02:51:27,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 02:51:27,137 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 02:51:27,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 02:51:27,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 02:51:27,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 02:51:27,201 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 02:51:27,201 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 02:51:27,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 02:51:27,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 02:51:27,293 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 02:51:27,296 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 02:51:47,293 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-12 02:51:47,293 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 02:51:47,306 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 02:51:47,307 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 02:51:47,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:51:47 BoogieIcfgContainer [2024-11-12 02:51:47,307 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 02:51:47,309 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 02:51:47,309 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 02:51:47,312 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 02:51:47,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:51:26" (1/3) ... [2024-11-12 02:51:47,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3efca891 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:51:47, skipping insertion in model container [2024-11-12 02:51:47,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:51:26" (2/3) ... [2024-11-12 02:51:47,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3efca891 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:51:47, skipping insertion in model container [2024-11-12 02:51:47,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:51:47" (3/3) ... [2024-11-12 02:51:47,315 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-60.i [2024-11-12 02:51:47,351 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 02:51:47,352 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 02:51:47,413 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 02:51:47,420 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;@b7e038a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 02:51:47,420 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 02:51:47,426 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 54 states have (on average 1.462962962962963) internal successors, (79), 55 states have internal predecessors, (79), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-12 02:51:47,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-12 02:51:47,439 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:51:47,440 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:51:47,441 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:51:47,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:51:47,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1229361647, now seen corresponding path program 1 times [2024-11-12 02:51:47,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 02:51:47,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [255111872] [2024-11-12 02:51:47,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:51:47,463 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 02:51:47,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 02:51:47,467 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 02:51:47,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 02:51:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:51:48,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 02:51:48,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 02:52:02,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-12 02:52:02,822 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 02:52:02,822 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 02:52:02,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [255111872] [2024-11-12 02:52:02,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [255111872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:52:02,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:52:02,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 02:52:02,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109498246] [2024-11-12 02:52:02,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:52:02,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 02:52:02,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 02:52:02,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 02:52:02,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 02:52:02,851 INFO L87 Difference]: Start difference. First operand has 86 states, 54 states have (on average 1.462962962962963) internal successors, (79), 55 states have internal predecessors, (79), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-12 02:52:04,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 02:52:09,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 02:52:13,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 02:52:17,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.30s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 02:52:21,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 02:52:23,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 02:52:25,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 02:52:29,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 02:52:33,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []