./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-46.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-46.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 599c2a7a15497ef5ed0f466f9aaac69b17733734231014f3393a37d8440286a6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:21:10,744 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:21:10,825 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 06:21:10,832 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:21:10,847 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:21:10,893 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:21:10,894 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:21:10,894 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:21:10,895 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:21:10,895 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:21:10,896 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:21:10,896 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:21:10,897 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:21:10,897 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:21:10,897 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:21:10,898 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:21:10,898 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:21:10,898 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:21:10,899 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 06:21:10,899 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:21:10,899 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:21:10,902 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:21:10,902 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:21:10,902 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:21:10,903 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:21:10,903 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:21:10,903 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:21:10,903 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:21:10,904 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:21:10,904 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:21:10,904 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:21:10,904 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:21:10,905 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:21:10,906 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:21:10,906 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:21:10,906 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:21:10,907 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 06:21:10,907 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 06:21:10,907 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:21:10,907 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:21:10,907 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:21:10,908 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:21:10,908 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 -> 599c2a7a15497ef5ed0f466f9aaac69b17733734231014f3393a37d8440286a6 [2024-11-10 06:21:11,165 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:21:11,192 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:21:11,196 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:21:11,197 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:21:11,198 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:21:11,199 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-ps-co_file-46.i [2024-11-10 06:21:12,735 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:21:12,965 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:21:12,966 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-46.i [2024-11-10 06:21:12,979 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08253089c/be379e4439c14682af15d44534abd0fb/FLAG8504a1562 [2024-11-10 06:21:12,992 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08253089c/be379e4439c14682af15d44534abd0fb [2024-11-10 06:21:12,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:21:12,996 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:21:12,997 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:21:12,998 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:21:13,004 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:21:13,005 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:21:12" (1/1) ... [2024-11-10 06:21:13,006 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@723b9133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:21:13, skipping insertion in model container [2024-11-10 06:21:13,006 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:21:12" (1/1) ... [2024-11-10 06:21:13,050 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:21:13,231 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-ps-co_file-46.i[919,932] [2024-11-10 06:21:13,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:21:13,325 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:21:13,338 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-ps-co_file-46.i[919,932] [2024-11-10 06:21:13,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:21:13,424 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:21:13,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:21:13 WrapperNode [2024-11-10 06:21:13,428 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:21:13,431 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:21:13,432 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:21:13,432 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:21:13,439 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:21:13" (1/1) ... [2024-11-10 06:21:13,452 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:21:13" (1/1) ... [2024-11-10 06:21:13,506 INFO L138 Inliner]: procedures = 26, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 259 [2024-11-10 06:21:13,507 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:21:13,508 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:21:13,508 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:21:13,508 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:21:13,520 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:21:13" (1/1) ... [2024-11-10 06:21:13,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:21:13" (1/1) ... [2024-11-10 06:21:13,529 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:21:13" (1/1) ... [2024-11-10 06:21:13,559 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 06:21:13,560 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:21:13" (1/1) ... [2024-11-10 06:21:13,560 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:21:13" (1/1) ... [2024-11-10 06:21:13,581 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:21:13" (1/1) ... [2024-11-10 06:21:13,587 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:21:13" (1/1) ... [2024-11-10 06:21:13,596 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:21:13" (1/1) ... [2024-11-10 06:21:13,599 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:21:13" (1/1) ... [2024-11-10 06:21:13,609 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:21:13,611 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:21:13,611 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:21:13,611 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:21:13,612 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:21:13" (1/1) ... [2024-11-10 06:21:13,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:21:13,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:21:13,649 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 06:21:13,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 06:21:13,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:21:13,705 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:21:13,706 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:21:13,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 06:21:13,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:21:13,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:21:13,813 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:21:13,816 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:21:14,348 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L195: havoc property_#t~bitwise26#1;havoc property_#t~bitwise27#1;havoc property_#t~short28#1; [2024-11-10 06:21:14,383 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-10 06:21:14,384 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:21:14,418 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:21:14,419 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:21:14,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:21:14 BoogieIcfgContainer [2024-11-10 06:21:14,419 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:21:14,425 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:21:14,427 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:21:14,430 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:21:14,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:21:12" (1/3) ... [2024-11-10 06:21:14,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66c4de19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:21:14, skipping insertion in model container [2024-11-10 06:21:14,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:21:13" (2/3) ... [2024-11-10 06:21:14,432 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66c4de19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:21:14, skipping insertion in model container [2024-11-10 06:21:14,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:21:14" (3/3) ... [2024-11-10 06:21:14,435 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-46.i [2024-11-10 06:21:14,454 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:21:14,455 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:21:14,538 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:21:14,547 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;@2e453033, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:21:14,548 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:21:14,554 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 74 states have (on average 1.4189189189189189) internal successors, (105), 75 states have internal predecessors, (105), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-10 06:21:14,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-10 06:21:14,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:21:14,574 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:21:14,574 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:21:14,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:21:14,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1493916762, now seen corresponding path program 1 times [2024-11-10 06:21:14,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:21:14,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685771308] [2024-11-10 06:21:14,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:21:14,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:21:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:15,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:21:15,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:15,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:21:15,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:15,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:21:15,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:15,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:21:15,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:15,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:21:15,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:15,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:21:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:15,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:21:15,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:15,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:21:15,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:15,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:21:15,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:15,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:21:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:15,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:21:15,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:15,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:21:15,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:15,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:21:15,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:15,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:21:15,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:15,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:21:15,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:15,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 06:21:15,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:15,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:21:15,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:15,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 06:21:15,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:15,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 06:21:15,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:15,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 06:21:15,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:15,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 06:21:15,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:15,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 06:21:15,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:15,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 06:21:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:15,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 06:21:15,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:15,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 06:21:15,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:15,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 06:21:15,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:15,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 06:21:15,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:15,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 06:21:15,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:15,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 06:21:15,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:15,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 06:21:15,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:15,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 06:21:15,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:15,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-10 06:21:15,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:15,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 06:21:15,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:15,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-10 06:21:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:15,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-10 06:21:15,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:15,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-10 06:21:15,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:21:15,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685771308] [2024-11-10 06:21:15,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685771308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:21:15,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:21:15,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:21:15,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030126178] [2024-11-10 06:21:15,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:21:15,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:21:15,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:21:15,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:21:15,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:21:15,313 INFO L87 Difference]: Start difference. First operand has 112 states, 74 states have (on average 1.4189189189189189) internal successors, (105), 75 states have internal predecessors, (105), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-10 06:21:15,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:21:15,378 INFO L93 Difference]: Finished difference Result 216 states and 378 transitions. [2024-11-10 06:21:15,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:21:15,382 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) Word has length 221 [2024-11-10 06:21:15,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:21:15,392 INFO L225 Difference]: With dead ends: 216 [2024-11-10 06:21:15,392 INFO L226 Difference]: Without dead ends: 107 [2024-11-10 06:21:15,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:21:15,405 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:21:15,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:21:15,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-10 06:21:15,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-10 06:21:15,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 70 states have internal predecessors, (96), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-10 06:21:15,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 166 transitions. [2024-11-10 06:21:15,461 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 166 transitions. Word has length 221 [2024-11-10 06:21:15,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:21:15,461 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 166 transitions. [2024-11-10 06:21:15,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-10 06:21:15,462 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 166 transitions. [2024-11-10 06:21:15,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-10 06:21:15,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:21:15,469 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:21:15,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 06:21:15,471 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:21:15,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:21:15,473 INFO L85 PathProgramCache]: Analyzing trace with hash 387343222, now seen corresponding path program 1 times [2024-11-10 06:21:15,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:21:15,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349962771] [2024-11-10 06:21:15,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:21:15,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:21:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:15,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:21:15,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:15,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:21:15,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:15,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:21:15,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:15,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:21:15,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:15,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:21:15,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:15,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:21:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:15,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:21:15,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:15,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:21:15,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:15,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:21:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:15,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:21:15,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:21:16,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:21:16,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:21:16,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:21:16,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:21:16,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 06:21:16,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:21:16,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 06:21:16,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 06:21:16,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 06:21:16,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 06:21:16,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 06:21:16,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 06:21:16,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 06:21:16,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 06:21:16,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 06:21:16,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 06:21:16,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 06:21:16,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 06:21:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 06:21:16,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 06:21:16,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-10 06:21:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 06:21:16,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-10 06:21:16,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-10 06:21:16,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-10 06:21:16,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:21:16,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349962771] [2024-11-10 06:21:16,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349962771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:21:16,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:21:16,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 06:21:16,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049683870] [2024-11-10 06:21:16,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:21:16,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 06:21:16,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:21:16,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 06:21:16,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:21:16,163 INFO L87 Difference]: Start difference. First operand 107 states and 166 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 06:21:16,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:21:16,261 INFO L93 Difference]: Finished difference Result 293 states and 461 transitions. [2024-11-10 06:21:16,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 06:21:16,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 222 [2024-11-10 06:21:16,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:21:16,271 INFO L225 Difference]: With dead ends: 293 [2024-11-10 06:21:16,274 INFO L226 Difference]: Without dead ends: 189 [2024-11-10 06:21:16,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:21:16,277 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 71 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:21:16,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 307 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:21:16,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-10 06:21:16,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 169. [2024-11-10 06:21:16,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 96 states have (on average 1.2708333333333333) internal successors, (122), 96 states have internal predecessors, (122), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-10 06:21:16,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 262 transitions. [2024-11-10 06:21:16,337 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 262 transitions. Word has length 222 [2024-11-10 06:21:16,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:21:16,340 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 262 transitions. [2024-11-10 06:21:16,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 06:21:16,341 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 262 transitions. [2024-11-10 06:21:16,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-10 06:21:16,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:21:16,349 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:21:16,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 06:21:16,352 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:21:16,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:21:16,353 INFO L85 PathProgramCache]: Analyzing trace with hash 718085175, now seen corresponding path program 1 times [2024-11-10 06:21:16,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:21:16,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859936204] [2024-11-10 06:21:16,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:21:16,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:21:16,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:21:16,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:21:16,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:21:16,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:21:16,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:21:16,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:21:16,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:21:16,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:21:16,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:21:16,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:21:16,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:21:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:21:16,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:21:16,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:21:16,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:21:16,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 06:21:16,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:21:16,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 06:21:16,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 06:21:16,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 06:21:16,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 06:21:16,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 06:21:16,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 06:21:16,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 06:21:16,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 06:21:16,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 06:21:16,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 06:21:16,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 06:21:16,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 06:21:16,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 06:21:16,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 06:21:16,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-10 06:21:16,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 06:21:16,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-10 06:21:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-10 06:21:16,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:16,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-10 06:21:16,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:21:16,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859936204] [2024-11-10 06:21:16,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859936204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:21:16,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:21:16,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 06:21:16,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875509221] [2024-11-10 06:21:16,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:21:16,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 06:21:16,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:21:16,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 06:21:16,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 06:21:16,994 INFO L87 Difference]: Start difference. First operand 169 states and 262 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 06:21:17,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:21:17,511 INFO L93 Difference]: Finished difference Result 526 states and 810 transitions. [2024-11-10 06:21:17,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 06:21:17,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 223 [2024-11-10 06:21:17,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:21:17,520 INFO L225 Difference]: With dead ends: 526 [2024-11-10 06:21:17,521 INFO L226 Difference]: Without dead ends: 422 [2024-11-10 06:21:17,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:21:17,523 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 402 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 06:21:17,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 467 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 06:21:17,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2024-11-10 06:21:17,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 411. [2024-11-10 06:21:17,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 261 states have (on average 1.3448275862068966) internal successors, (351), 263 states have internal predecessors, (351), 143 states have call successors, (143), 6 states have call predecessors, (143), 6 states have return successors, (143), 141 states have call predecessors, (143), 143 states have call successors, (143) [2024-11-10 06:21:17,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 637 transitions. [2024-11-10 06:21:17,632 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 637 transitions. Word has length 223 [2024-11-10 06:21:17,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:21:17,633 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 637 transitions. [2024-11-10 06:21:17,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 06:21:17,634 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 637 transitions. [2024-11-10 06:21:17,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-10 06:21:17,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:21:17,639 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:21:17,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 06:21:17,640 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:21:17,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:21:17,640 INFO L85 PathProgramCache]: Analyzing trace with hash -278987178, now seen corresponding path program 1 times [2024-11-10 06:21:17,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:21:17,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498240991] [2024-11-10 06:21:17,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:21:17,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:21:17,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:36,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:21:36,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:36,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:21:36,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:36,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:21:36,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:36,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:21:36,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:36,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:21:36,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:36,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:21:36,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:36,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:21:36,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:36,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 06:21:36,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:36,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:21:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:36,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 06:21:36,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:36,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 06:21:36,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:36,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 06:21:36,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:36,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 06:21:36,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:36,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 06:21:36,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:36,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 06:21:36,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:36,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 06:21:36,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:36,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 06:21:36,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:36,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 06:21:36,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:36,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 06:21:36,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:36,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 06:21:36,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:36,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 06:21:36,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:36,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 06:21:36,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:36,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 06:21:36,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:36,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 06:21:36,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:36,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 06:21:36,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:36,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 06:21:36,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:36,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 06:21:36,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:36,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 06:21:36,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:36,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-10 06:21:36,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:36,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 06:21:36,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:36,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-10 06:21:36,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:36,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-10 06:21:36,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:36,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-10 06:21:36,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:36,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-10 06:21:36,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:36,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-10 06:21:36,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:21:36,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-10 06:21:36,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:21:36,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498240991] [2024-11-10 06:21:36,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498240991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:21:36,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:21:36,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 06:21:36,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630393250] [2024-11-10 06:21:36,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:21:36,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 06:21:36,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:21:36,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 06:21:36,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 06:21:36,963 INFO L87 Difference]: Start difference. First operand 411 states and 637 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 06:21:39,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:21:39,773 INFO L93 Difference]: Finished difference Result 1146 states and 1734 transitions. [2024-11-10 06:21:39,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 06:21:39,774 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 223 [2024-11-10 06:21:39,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:21:39,786 INFO L225 Difference]: With dead ends: 1146 [2024-11-10 06:21:39,787 INFO L226 Difference]: Without dead ends: 804 [2024-11-10 06:21:39,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-10 06:21:39,790 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 256 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:21:39,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 537 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-10 06:21:39,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2024-11-10 06:21:39,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 651. [2024-11-10 06:21:39,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 461 states have (on average 1.386117136659436) internal successors, (639), 467 states have internal predecessors, (639), 175 states have call successors, (175), 14 states have call predecessors, (175), 14 states have return successors, (175), 169 states have call predecessors, (175), 175 states have call successors, (175) [2024-11-10 06:21:39,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 989 transitions. [2024-11-10 06:21:39,868 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 989 transitions. Word has length 223 [2024-11-10 06:21:39,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:21:39,869 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 989 transitions. [2024-11-10 06:21:39,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 06:21:39,870 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 989 transitions. [2024-11-10 06:21:39,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-10 06:21:39,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:21:39,873 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:21:39,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 06:21:39,874 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:21:39,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:21:39,874 INFO L85 PathProgramCache]: Analyzing trace with hash -789521355, now seen corresponding path program 1 times [2024-11-10 06:21:39,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:21:39,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895232834] [2024-11-10 06:21:39,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:21:39,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:21:40,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 06:21:40,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1696412783] [2024-11-10 06:21:40,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:21:40,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:21:40,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:21:40,043 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 06:21:40,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 06:21:40,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:21:40,239 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 06:21:40,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:21:40,559 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 06:21:40,559 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 06:21:40,561 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 06:21:40,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 06:21:40,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:21:40,768 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-10 06:21:40,939 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 06:21:40,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:21:40 BoogieIcfgContainer [2024-11-10 06:21:40,946 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 06:21:40,946 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 06:21:40,947 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 06:21:40,947 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 06:21:40,947 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:21:14" (3/4) ... [2024-11-10 06:21:40,950 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 06:21:40,951 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 06:21:40,954 INFO L158 Benchmark]: Toolchain (without parser) took 27955.86ms. Allocated memory was 184.5MB in the beginning and 398.5MB in the end (delta: 213.9MB). Free memory was 155.0MB in the beginning and 279.4MB in the end (delta: -124.4MB). Peak memory consumption was 89.5MB. Max. memory is 16.1GB. [2024-11-10 06:21:40,954 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 134.2MB. Free memory was 98.3MB in the beginning and 98.3MB in the end (delta: 29.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:21:40,954 INFO L158 Benchmark]: CACSL2BoogieTranslator took 430.78ms. Allocated memory is still 184.5MB. Free memory was 154.8MB in the beginning and 138.2MB in the end (delta: 16.6MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. [2024-11-10 06:21:40,955 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.91ms. Allocated memory is still 184.5MB. Free memory was 138.2MB in the beginning and 131.8MB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 06:21:40,955 INFO L158 Benchmark]: Boogie Preprocessor took 102.32ms. Allocated memory is still 184.5MB. Free memory was 131.8MB in the beginning and 123.5MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-10 06:21:40,955 INFO L158 Benchmark]: IcfgBuilder took 808.43ms. Allocated memory is still 184.5MB. Free memory was 123.5MB in the beginning and 86.8MB in the end (delta: 36.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-10 06:21:40,956 INFO L158 Benchmark]: TraceAbstraction took 26520.53ms. Allocated memory was 184.5MB in the beginning and 398.5MB in the end (delta: 213.9MB). Free memory was 85.7MB in the beginning and 279.4MB in the end (delta: -193.7MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. [2024-11-10 06:21:40,956 INFO L158 Benchmark]: Witness Printer took 5.11ms. Allocated memory is still 398.5MB. Free memory is still 279.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:21:40,958 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 134.2MB. Free memory was 98.3MB in the beginning and 98.3MB in the end (delta: 29.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 430.78ms. Allocated memory is still 184.5MB. Free memory was 154.8MB in the beginning and 138.2MB in the end (delta: 16.6MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.91ms. Allocated memory is still 184.5MB. Free memory was 138.2MB in the beginning and 131.8MB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 102.32ms. Allocated memory is still 184.5MB. Free memory was 131.8MB in the beginning and 123.5MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 808.43ms. Allocated memory is still 184.5MB. Free memory was 123.5MB in the beginning and 86.8MB in the end (delta: 36.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 26520.53ms. Allocated memory was 184.5MB in the beginning and 398.5MB in the end (delta: 213.9MB). Free memory was 85.7MB in the beginning and 279.4MB in the end (delta: -193.7MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. * Witness Printer took 5.11ms. Allocated memory is still 398.5MB. Free memory is still 279.4MB. 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 156, overapproximation of someBinaryDOUBLEComparisonOperation at line 195. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 16; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 0; [L25] unsigned char var_1_4 = 128; [L26] unsigned char var_1_5 = 10; [L27] unsigned short int var_1_6 = 10; [L28] unsigned short int var_1_7 = 52077; [L29] unsigned short int var_1_8 = 47248; [L30] unsigned short int var_1_9 = 50; [L31] float var_1_11 = 63.75; [L32] signed long int var_1_12 = 100000; [L33] unsigned short int var_1_13 = 8; [L34] signed long int var_1_14 = 2; [L35] signed long int var_1_15 = 32; [L36] double var_1_17 = 127.5; [L37] double var_1_18 = 32.75; [L38] signed char var_1_19 = 0; [L39] unsigned long int var_1_20 = 128; [L40] unsigned long int var_1_21 = 32; [L41] unsigned char var_1_23 = 0; [L42] unsigned char var_1_24 = 0; [L43] unsigned char var_1_25 = 0; [L44] unsigned char var_1_26 = 1; [L45] unsigned char var_1_27 = 16; [L46] unsigned char var_1_28 = 128; [L47] signed long int var_1_29 = 5; [L48] unsigned char var_1_31 = 128; [L49] unsigned short int var_1_32 = 0; [L50] signed char var_1_33 = 50; [L51] signed char var_1_34 = 64; [L52] signed char var_1_35 = 1; [L53] signed char var_1_36 = 5; [L54] unsigned short int last_1_var_1_13 = 8; [L55] double last_1_var_1_17 = 127.5; VAL [isInitial=0, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L199] isInitial = 1 [L200] FCALL initially() [L201] COND TRUE 1 [L202] CALL updateLastVariables() [L191] last_1_var_1_13 = var_1_13 [L192] last_1_var_1_17 = var_1_17 VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L202] RET updateLastVariables() [L203] CALL updateVariables() [L136] var_1_2 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L137] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L138] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L138] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L139] var_1_3 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L140] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L141] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L141] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L142] var_1_4 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_4 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L143] RET assume_abort_if_not(var_1_4 >= 127) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L144] CALL assume_abort_if_not(var_1_4 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L144] RET assume_abort_if_not(var_1_4 <= 254) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L145] var_1_5 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L146] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L147] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L147] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L148] var_1_7 = __VERIFIER_nondet_ushort() [L149] CALL assume_abort_if_not(var_1_7 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=47248, var_1_9=50] [L149] RET assume_abort_if_not(var_1_7 >= 32767) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=47248, var_1_9=50] [L150] CALL assume_abort_if_not(var_1_7 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=47248, var_1_9=50] [L150] RET assume_abort_if_not(var_1_7 <= 65534) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=47248, var_1_9=50] [L151] var_1_8 = __VERIFIER_nondet_ushort() [L152] CALL assume_abort_if_not(var_1_8 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L152] RET assume_abort_if_not(var_1_8 >= 32767) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L153] CALL assume_abort_if_not(var_1_8 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L153] RET assume_abort_if_not(var_1_8 <= 65534) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L154] var_1_11 = __VERIFIER_nondet_float() [L155] CALL assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L155] RET assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L156] CALL assume_abort_if_not(var_1_11 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L156] RET assume_abort_if_not(var_1_11 != 0.0F) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L157] var_1_14 = __VERIFIER_nondet_long() [L158] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L158] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L159] CALL assume_abort_if_not(var_1_14 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L159] RET assume_abort_if_not(var_1_14 <= 32) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L160] var_1_15 = __VERIFIER_nondet_long() [L161] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L161] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L162] CALL assume_abort_if_not(var_1_15 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L162] RET assume_abort_if_not(var_1_15 <= 32) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L163] var_1_18 = __VERIFIER_nondet_double() [L164] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L164] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L165] var_1_24 = __VERIFIER_nondet_uchar() [L166] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L166] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L167] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L167] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L168] var_1_25 = __VERIFIER_nondet_uchar() [L169] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L169] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L170] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L170] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L171] var_1_26 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_26 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L172] RET assume_abort_if_not(var_1_26 >= 1) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L173] CALL assume_abort_if_not(var_1_26 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L173] RET assume_abort_if_not(var_1_26 <= 1) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=128, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L174] var_1_28 = __VERIFIER_nondet_uchar() [L175] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L175] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L176] CALL assume_abort_if_not(var_1_28 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=1, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=1, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L176] RET assume_abort_if_not(var_1_28 <= 254) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=1, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=0, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L177] var_1_32 = __VERIFIER_nondet_ushort() [L178] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=1, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=1, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L178] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=1, var_1_29=5, var_1_2=1, var_1_31=128, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L179] CALL assume_abort_if_not(var_1_32 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=1, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=-65535, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=1, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=-65535, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L179] RET assume_abort_if_not(var_1_32 <= 32) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=1, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=-65535, var_1_33=50, var_1_34=64, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L180] var_1_34 = __VERIFIER_nondet_char() [L181] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=1, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=-65535, var_1_33=50, var_1_34=0, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=1, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=-65535, var_1_33=50, var_1_34=0, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L181] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=1, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=-65535, var_1_33=50, var_1_34=0, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L182] CALL assume_abort_if_not(var_1_34 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=1, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=-65535, var_1_33=50, var_1_34=0, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=1, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=-65535, var_1_33=50, var_1_34=0, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L182] RET assume_abort_if_not(var_1_34 <= 126) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=1, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=-65535, var_1_33=50, var_1_34=0, var_1_35=1, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L183] var_1_35 = __VERIFIER_nondet_char() [L184] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=1, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=-65535, var_1_33=50, var_1_34=0, var_1_35=0, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=1, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=-65535, var_1_33=50, var_1_34=0, var_1_35=0, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L184] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=1, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=-65535, var_1_33=50, var_1_34=0, var_1_35=0, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L185] CALL assume_abort_if_not(var_1_35 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=1, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=-65535, var_1_33=50, var_1_34=0, var_1_35=0, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=1, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=-65535, var_1_33=50, var_1_34=0, var_1_35=0, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L185] RET assume_abort_if_not(var_1_35 <= 63) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=1, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=-65535, var_1_33=50, var_1_34=0, var_1_35=0, var_1_36=5, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L186] var_1_36 = __VERIFIER_nondet_char() [L187] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=1, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=-65535, var_1_33=50, var_1_34=0, var_1_35=0, var_1_36=0, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=1, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=-65535, var_1_33=50, var_1_34=0, var_1_35=0, var_1_36=0, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L187] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=1, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=-65535, var_1_33=50, var_1_34=0, var_1_35=0, var_1_36=0, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L188] CALL assume_abort_if_not(var_1_36 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=1, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=-65535, var_1_33=50, var_1_34=0, var_1_35=0, var_1_36=0, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=1, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=-65535, var_1_33=50, var_1_34=0, var_1_35=0, var_1_36=0, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L188] RET assume_abort_if_not(var_1_36 <= 63) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=32, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=1, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=-65535, var_1_33=50, var_1_34=0, var_1_35=0, var_1_36=0, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L203] RET updateVariables() [L204] CALL step() [L59] var_1_21 = ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1))) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=16, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=1, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=-65535, var_1_33=50, var_1_34=0, var_1_35=0, var_1_36=0, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L60] COND TRUE var_1_12 > var_1_13 VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=16, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=1, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=-65535, var_1_33=50, var_1_34=0, var_1_35=0, var_1_36=0, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L61] COND TRUE var_1_13 < var_1_12 [L62] var_1_23 = (var_1_24 && var_1_25) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=16, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=16, var_1_28=1, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=-65535, var_1_33=50, var_1_34=0, var_1_35=0, var_1_36=0, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L67] var_1_27 = var_1_28 VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=16, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=5, var_1_2=1, var_1_31=128, var_1_32=-65535, var_1_33=50, var_1_34=0, var_1_35=0, var_1_36=0, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L68] COND TRUE var_1_6 != (var_1_6 + var_1_28) [L69] var_1_29 = ((((var_1_28) > (((((((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6)))) < (var_1_1)) ? (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6)))) : (var_1_1))))) ? (var_1_28) : (((((((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6)))) < (var_1_1)) ? (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6)))) : (var_1_1)))))) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=16, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=10, var_1_2=1, var_1_31=128, var_1_32=-65535, var_1_33=50, var_1_34=0, var_1_35=0, var_1_36=0, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L73] COND FALSE !((-25 + (var_1_9 + var_1_9)) <= var_1_9) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=16, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=10, var_1_2=1, var_1_31=128, var_1_32=-65535, var_1_33=50, var_1_34=0, var_1_35=0, var_1_36=0, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L80] COND FALSE !(var_1_24 || (var_1_25 && var_1_23)) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=16, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=10, var_1_2=1, var_1_31=128, var_1_32=-65535, var_1_33=50, var_1_34=0, var_1_35=0, var_1_36=0, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L87] COND FALSE !((! (! var_1_23)) && (((((var_1_32) < 0 ) ? -(var_1_32) : (var_1_32))) <= var_1_34)) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=16, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=10, var_1_2=1, var_1_31=128, var_1_32=-65535, var_1_33=50, var_1_34=0, var_1_35=0, var_1_36=0, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L91] COND FALSE !(-100000 >= last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=16, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=10, var_1_2=1, var_1_31=128, var_1_32=-65535, var_1_33=50, var_1_34=0, var_1_35=0, var_1_36=0, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L94] COND FALSE !((last_1_var_1_17 / var_1_11) == 999999.6f) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=16, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=10, var_1_2=1, var_1_31=128, var_1_32=-65535, var_1_33=50, var_1_34=0, var_1_35=0, var_1_36=0, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L98] unsigned char stepLocal_0 = var_1_3; VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, stepLocal_0=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_21=16, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=10, var_1_2=1, var_1_31=128, var_1_32=-65535, var_1_33=50, var_1_34=0, var_1_35=0, var_1_36=0, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L99] COND TRUE var_1_2 && stepLocal_0 [L100] var_1_1 = (var_1_4 - var_1_5) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=254, var_1_20=128, var_1_21=16, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=10, var_1_2=1, var_1_31=128, var_1_32=-65535, var_1_33=50, var_1_34=0, var_1_35=0, var_1_36=0, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L104] COND FALSE !(var_1_1 <= (var_1_5 * var_1_4)) [L111] var_1_6 = var_1_5 VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=254, var_1_20=128, var_1_21=16, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=10, var_1_2=1, var_1_31=128, var_1_32=-65535, var_1_33=50, var_1_34=0, var_1_35=0, var_1_36=0, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50] [L113] var_1_17 = var_1_18 [L114] var_1_19 = 5 [L115] var_1_20 = var_1_15 VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=0, var_1_21=16, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=10, var_1_2=1, var_1_31=128, var_1_32=-65535, var_1_33=50, var_1_34=0, var_1_35=0, var_1_36=0, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50] [L116] COND FALSE !(var_1_1 < var_1_20) [L123] var_1_12 = var_1_6 VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=0, var_1_21=16, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=10, var_1_2=1, var_1_31=128, var_1_32=-65535, var_1_33=50, var_1_34=0, var_1_35=0, var_1_36=0, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50] [L125] EXPR -4 >> ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15))) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=0, var_1_21=16, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=10, var_1_2=1, var_1_31=128, var_1_32=-65535, var_1_33=50, var_1_34=0, var_1_35=0, var_1_36=0, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50] [L125] EXPR var_1_7 | ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=0, var_1_21=16, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=10, var_1_2=1, var_1_31=128, var_1_32=-65535, var_1_33=50, var_1_34=0, var_1_35=0, var_1_36=0, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50] [L125] COND FALSE !((-4 >> ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_7 | ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))))) [L132] var_1_13 = var_1_1 VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=254, var_1_14=1, var_1_15=0, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=0, var_1_21=16, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=10, var_1_2=1, var_1_31=128, var_1_32=-65535, var_1_33=50, var_1_34=0, var_1_35=0, var_1_36=0, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50] [L204] RET step() [L205] CALL, EXPR property() [L195] EXPR (((((var_1_2 && var_1_3) ? (var_1_1 == ((unsigned char) (var_1_4 - var_1_5))) : (var_1_1 == ((unsigned char) (var_1_4 - var_1_5)))) && ((var_1_1 <= (var_1_5 * var_1_4)) ? (var_1_2 ? (var_1_6 == ((unsigned short int) (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))) - var_1_5))) : (var_1_6 == ((unsigned short int) var_1_5))) : (var_1_6 == ((unsigned short int) var_1_5)))) && ((-100000 >= last_1_var_1_13) ? (var_1_9 == ((unsigned short int) (((((last_1_var_1_13 + var_1_5)) > (64)) ? ((last_1_var_1_13 + var_1_5)) : (64))))) : (((last_1_var_1_17 / var_1_11) == 999999.6f) ? (var_1_9 == ((unsigned short int) var_1_7)) : 1))) && ((var_1_1 < var_1_20) ? ((var_1_5 == (~ (var_1_1 + var_1_20))) ? (var_1_12 == ((signed long int) (((((var_1_5) > (((((-1) < (var_1_1)) ? (-1) : (var_1_1))))) ? (var_1_5) : (((((-1) < (var_1_1)) ? (-1) : (var_1_1)))))) - 1000))) : (var_1_12 == ((signed long int) ((((var_1_20) < (var_1_8)) ? (var_1_20) : (var_1_8)))))) : (var_1_12 == ((signed long int) var_1_6)))) && (((-4 >> ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_7 | ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))))) ? (var_1_3 ? (var_1_13 == ((unsigned short int) var_1_6)) : (var_1_13 == ((unsigned short int) var_1_4))) : (var_1_13 == ((unsigned short int) var_1_1))) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=254, var_1_14=1, var_1_15=0, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=0, var_1_21=16, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=10, var_1_2=1, var_1_31=128, var_1_32=-65535, var_1_33=50, var_1_34=0, var_1_35=0, var_1_36=0, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50] [L195-L196] return ((((((((var_1_2 && var_1_3) ? (var_1_1 == ((unsigned char) (var_1_4 - var_1_5))) : (var_1_1 == ((unsigned char) (var_1_4 - var_1_5)))) && ((var_1_1 <= (var_1_5 * var_1_4)) ? (var_1_2 ? (var_1_6 == ((unsigned short int) (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))) - var_1_5))) : (var_1_6 == ((unsigned short int) var_1_5))) : (var_1_6 == ((unsigned short int) var_1_5)))) && ((-100000 >= last_1_var_1_13) ? (var_1_9 == ((unsigned short int) (((((last_1_var_1_13 + var_1_5)) > (64)) ? ((last_1_var_1_13 + var_1_5)) : (64))))) : (((last_1_var_1_17 / var_1_11) == 999999.6f) ? (var_1_9 == ((unsigned short int) var_1_7)) : 1))) && ((var_1_1 < var_1_20) ? ((var_1_5 == (~ (var_1_1 + var_1_20))) ? (var_1_12 == ((signed long int) (((((var_1_5) > (((((-1) < (var_1_1)) ? (-1) : (var_1_1))))) ? (var_1_5) : (((((-1) < (var_1_1)) ? (-1) : (var_1_1)))))) - 1000))) : (var_1_12 == ((signed long int) ((((var_1_20) < (var_1_8)) ? (var_1_20) : (var_1_8)))))) : (var_1_12 == ((signed long int) var_1_6)))) && (((-4 >> ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_7 | ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))))) ? (var_1_3 ? (var_1_13 == ((unsigned short int) var_1_6)) : (var_1_13 == ((unsigned short int) var_1_4))) : (var_1_13 == ((unsigned short int) var_1_1)))) && (var_1_17 == ((double) var_1_18))) && (var_1_19 == ((signed char) 5))) && (var_1_20 == ((unsigned long int) var_1_15)) ; [L205] RET, EXPR property() [L205] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=254, var_1_14=1, var_1_15=0, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=0, var_1_21=16, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=10, var_1_2=1, var_1_31=128, var_1_32=-65535, var_1_33=50, var_1_34=0, var_1_35=0, var_1_36=0, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=254, var_1_14=1, var_1_15=0, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=0, var_1_21=16, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=10, var_1_2=1, var_1_31=128, var_1_32=-65535, var_1_33=50, var_1_34=0, var_1_35=0, var_1_36=0, var_1_3=1, var_1_4=-2, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 112 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.3s, OverallIterations: 5, TraceHistogramMax: 35, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 729 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 729 mSDsluCounter, 1471 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 802 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 354 IncrementalHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 669 mSDtfsCounter, 354 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 336 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=651occurred in iteration=4, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 4 MinimizatonAttempts, 184 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 20.8s InterpolantComputationTime, 1335 NumberOfCodeBlocks, 1335 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 885 ConstructedInterpolants, 0 QuantifiedInterpolants, 2692 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 9520/9520 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 06:21:41,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-46.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 599c2a7a15497ef5ed0f466f9aaac69b17733734231014f3393a37d8440286a6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:21:43,638 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:21:43,725 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 06:21:43,730 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:21:43,733 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:21:43,769 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:21:43,770 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:21:43,770 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:21:43,771 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:21:43,777 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:21:43,777 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:21:43,777 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:21:43,778 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:21:43,778 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:21:43,778 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:21:43,779 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:21:43,779 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:21:43,779 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:21:43,779 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:21:43,780 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:21:43,780 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:21:43,782 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:21:43,782 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:21:43,782 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 06:21:43,782 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 06:21:43,783 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:21:43,783 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 06:21:43,783 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:21:43,783 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:21:43,783 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:21:43,784 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:21:43,784 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:21:43,784 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:21:43,784 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:21:43,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:21:43,785 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:21:43,786 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:21:43,786 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:21:43,787 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 06:21:43,787 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 06:21:43,787 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:21:43,787 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:21:43,787 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:21:43,788 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:21:43,788 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 -> 599c2a7a15497ef5ed0f466f9aaac69b17733734231014f3393a37d8440286a6 [2024-11-10 06:21:44,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:21:44,165 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:21:44,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:21:44,171 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:21:44,172 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:21:44,174 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-ps-co_file-46.i [2024-11-10 06:21:46,096 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:21:46,363 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:21:46,367 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-46.i [2024-11-10 06:21:46,386 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38a9d10c3/c8893712502d44a0bd8cc44a9ac83f39/FLAGca892223b [2024-11-10 06:21:46,407 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38a9d10c3/c8893712502d44a0bd8cc44a9ac83f39 [2024-11-10 06:21:46,413 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:21:46,414 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:21:46,415 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:21:46,417 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:21:46,422 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:21:46,423 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:21:46" (1/1) ... [2024-11-10 06:21:46,424 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b262c18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:21:46, skipping insertion in model container [2024-11-10 06:21:46,424 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:21:46" (1/1) ... [2024-11-10 06:21:46,460 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:21:46,667 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-ps-co_file-46.i[919,932] [2024-11-10 06:21:46,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:21:46,816 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:21:46,829 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-ps-co_file-46.i[919,932] [2024-11-10 06:21:46,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:21:46,919 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:21:46,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:21:46 WrapperNode [2024-11-10 06:21:46,920 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:21:46,921 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:21:46,921 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:21:46,921 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:21:46,928 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:21:46" (1/1) ... [2024-11-10 06:21:46,948 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:21:46" (1/1) ... [2024-11-10 06:21:46,997 INFO L138 Inliner]: procedures = 27, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 203 [2024-11-10 06:21:46,997 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:21:46,998 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:21:46,998 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:21:46,998 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:21:47,010 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:21:46" (1/1) ... [2024-11-10 06:21:47,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:21:46" (1/1) ... [2024-11-10 06:21:47,019 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:21:46" (1/1) ... [2024-11-10 06:21:47,043 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 06:21:47,046 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:21:46" (1/1) ... [2024-11-10 06:21:47,047 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:21:46" (1/1) ... [2024-11-10 06:21:47,058 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:21:46" (1/1) ... [2024-11-10 06:21:47,059 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:21:46" (1/1) ... [2024-11-10 06:21:47,061 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:21:46" (1/1) ... [2024-11-10 06:21:47,063 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:21:46" (1/1) ... [2024-11-10 06:21:47,066 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:21:47,067 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:21:47,067 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:21:47,068 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:21:47,068 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:21:46" (1/1) ... [2024-11-10 06:21:47,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:21:47,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:21:47,123 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 06:21:47,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 06:21:47,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:21:47,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 06:21:47,174 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:21:47,174 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:21:47,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:21:47,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:21:47,274 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:21:47,277 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:22:01,137 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-10 06:22:01,137 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:22:01,157 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:22:01,157 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:22:01,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:22:01 BoogieIcfgContainer [2024-11-10 06:22:01,158 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:22:01,160 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:22:01,161 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:22:01,164 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:22:01,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:21:46" (1/3) ... [2024-11-10 06:22:01,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73719f54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:22:01, skipping insertion in model container [2024-11-10 06:22:01,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:21:46" (2/3) ... [2024-11-10 06:22:01,168 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73719f54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:22:01, skipping insertion in model container [2024-11-10 06:22:01,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:22:01" (3/3) ... [2024-11-10 06:22:01,170 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-46.i [2024-11-10 06:22:01,195 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:22:01,196 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:22:01,288 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:22:01,300 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;@530804a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:22:01,300 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:22:01,306 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 58 states have internal predecessors, (79), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-10 06:22:01,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-10 06:22:01,327 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:22:01,328 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:22:01,329 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:22:01,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:22:01,336 INFO L85 PathProgramCache]: Analyzing trace with hash 2025638552, now seen corresponding path program 1 times [2024-11-10 06:22:01,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:22:01,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1484000277] [2024-11-10 06:22:01,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:22:01,355 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 06:22:01,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:22:01,359 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 06:22:01,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 06:22:02,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:02,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 06:22:02,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:22:02,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 648 proven. 0 refuted. 0 times theorem prover too weak. 1732 trivial. 0 not checked. [2024-11-10 06:22:02,409 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:22:02,410 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:22:02,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1484000277] [2024-11-10 06:22:02,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1484000277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:22:02,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:22:02,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:22:02,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139366356] [2024-11-10 06:22:02,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:22:02,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:22:02,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:22:02,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:22:02,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:22:02,464 INFO L87 Difference]: Start difference. First operand has 95 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 58 states have internal predecessors, (79), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-10 06:22:02,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:22:02,501 INFO L93 Difference]: Finished difference Result 181 states and 324 transitions. [2024-11-10 06:22:02,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:22:02,507 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 217 [2024-11-10 06:22:02,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:22:02,519 INFO L225 Difference]: With dead ends: 181 [2024-11-10 06:22:02,519 INFO L226 Difference]: Without dead ends: 89 [2024-11-10 06:22:02,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:22:02,530 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:22:02,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:22:02,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-10 06:22:02,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-10 06:22:02,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 52 states have internal predecessors, (67), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-10 06:22:02,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 137 transitions. [2024-11-10 06:22:02,597 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 137 transitions. Word has length 217 [2024-11-10 06:22:02,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:22:02,598 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 137 transitions. [2024-11-10 06:22:02,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-10 06:22:02,599 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 137 transitions. [2024-11-10 06:22:02,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-10 06:22:02,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:22:02,605 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:22:02,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 06:22:02,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 06:22:02,807 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:22:02,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:22:02,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1028879346, now seen corresponding path program 1 times [2024-11-10 06:22:02,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:22:02,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1543081141] [2024-11-10 06:22:02,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:22:02,811 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 06:22:02,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:22:02,815 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 06:22:02,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 06:22:03,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:03,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 06:22:03,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:22:09,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-10 06:22:09,100 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:22:09,101 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:22:09,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1543081141] [2024-11-10 06:22:09,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1543081141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:22:09,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:22:09,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:22:09,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205354476] [2024-11-10 06:22:09,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:22:09,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 06:22:09,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:22:09,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 06:22:09,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:22:09,108 INFO L87 Difference]: Start difference. First operand 89 states and 137 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 06:22:13,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 06:22:13,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:22:13,708 INFO L93 Difference]: Finished difference Result 253 states and 397 transitions. [2024-11-10 06:22:13,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 06:22:13,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 218 [2024-11-10 06:22:13,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:22:13,716 INFO L225 Difference]: With dead ends: 253 [2024-11-10 06:22:13,716 INFO L226 Difference]: Without dead ends: 167 [2024-11-10 06:22:13,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:22:13,723 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 27 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-10 06:22:13,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 261 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2024-11-10 06:22:13,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-10 06:22:13,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 151. [2024-11-10 06:22:13,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 78 states have (on average 1.1923076923076923) internal successors, (93), 78 states have internal predecessors, (93), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-10 06:22:13,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 233 transitions. [2024-11-10 06:22:13,769 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 233 transitions. Word has length 218 [2024-11-10 06:22:13,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:22:13,771 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 233 transitions. [2024-11-10 06:22:13,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-10 06:22:13,772 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 233 transitions. [2024-11-10 06:22:13,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-10 06:22:13,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:22:13,778 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:22:13,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 06:22:13,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 06:22:13,980 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:22:13,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:22:13,981 INFO L85 PathProgramCache]: Analyzing trace with hash 716317778, now seen corresponding path program 1 times [2024-11-10 06:22:13,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:22:13,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1788352964] [2024-11-10 06:22:13,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:22:13,983 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 06:22:13,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:22:13,985 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 06:22:13,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 06:22:14,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:22:14,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-10 06:22:14,965 INFO L278 TraceCheckSpWp]: Computing forward predicates...