./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-35.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-35.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 19520942352997fcf297d8ad079cb9fafb5c7d1c5c429124759a57b39998961b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 02:41:24,851 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 02:41:24,906 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 02:41:24,910 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 02:41:24,911 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 02:41:24,928 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 02:41:24,929 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 02:41:24,929 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 02:41:24,930 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 02:41:24,930 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 02:41:24,930 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 02:41:24,930 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 02:41:24,931 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 02:41:24,931 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 02:41:24,932 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 02:41:24,933 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 02:41:24,934 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 02:41:24,934 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 02:41:24,935 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 02:41:24,935 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 02:41:24,935 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 02:41:24,935 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 02:41:24,936 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 02:41:24,936 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 02:41:24,936 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 02:41:24,936 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 02:41:24,937 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 02:41:24,937 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 02:41:24,937 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 02:41:24,937 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 02:41:24,937 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 02:41:24,938 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 02:41:24,938 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:41:24,938 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 02:41:24,938 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 02:41:24,938 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 02:41:24,939 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 02:41:24,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 02:41:24,939 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 02:41:24,939 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 02:41:24,940 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 02:41:24,942 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 02:41:24,943 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 -> 19520942352997fcf297d8ad079cb9fafb5c7d1c5c429124759a57b39998961b [2024-10-13 02:41:25,165 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 02:41:25,186 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 02:41:25,188 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 02:41:25,188 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 02:41:25,189 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 02:41:25,189 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-35.i [2024-10-13 02:41:26,403 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 02:41:26,567 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 02:41:26,568 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-35.i [2024-10-13 02:41:26,576 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ad4b2556/c725159a0bec449bbd78fdf1f938b602/FLAG0db449182 [2024-10-13 02:41:26,586 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ad4b2556/c725159a0bec449bbd78fdf1f938b602 [2024-10-13 02:41:26,588 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 02:41:26,589 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 02:41:26,590 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 02:41:26,590 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 02:41:26,595 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 02:41:26,595 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:41:26" (1/1) ... [2024-10-13 02:41:26,597 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a5d5af6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:41:26, skipping insertion in model container [2024-10-13 02:41:26,598 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:41:26" (1/1) ... [2024-10-13 02:41:26,621 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 02:41:26,790 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-35.i[919,932] [2024-10-13 02:41:26,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:41:26,873 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 02:41:26,882 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-35.i[919,932] [2024-10-13 02:41:26,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:41:26,924 INFO L204 MainTranslator]: Completed translation [2024-10-13 02:41:26,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:41:26 WrapperNode [2024-10-13 02:41:26,925 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 02:41:26,926 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 02:41:26,926 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 02:41:26,927 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 02:41:26,931 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:41:26" (1/1) ... [2024-10-13 02:41:26,940 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:41:26" (1/1) ... [2024-10-13 02:41:26,968 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 243 [2024-10-13 02:41:26,968 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 02:41:26,969 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 02:41:26,971 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 02:41:26,971 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 02:41:26,980 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:41:26" (1/1) ... [2024-10-13 02:41:26,980 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:41:26" (1/1) ... [2024-10-13 02:41:26,987 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:41:26" (1/1) ... [2024-10-13 02:41:27,008 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 02:41:27,009 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:41:26" (1/1) ... [2024-10-13 02:41:27,009 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:41:26" (1/1) ... [2024-10-13 02:41:27,017 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:41:26" (1/1) ... [2024-10-13 02:41:27,020 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:41:26" (1/1) ... [2024-10-13 02:41:27,022 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:41:26" (1/1) ... [2024-10-13 02:41:27,024 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:41:26" (1/1) ... [2024-10-13 02:41:27,032 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 02:41:27,033 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 02:41:27,033 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 02:41:27,033 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 02:41:27,034 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:41:26" (1/1) ... [2024-10-13 02:41:27,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:41:27,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:41:27,060 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-10-13 02:41:27,062 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-10-13 02:41:27,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 02:41:27,094 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 02:41:27,094 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 02:41:27,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 02:41:27,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 02:41:27,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 02:41:27,165 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 02:41:27,167 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 02:41:27,496 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-13 02:41:27,497 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 02:41:27,528 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 02:41:27,529 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 02:41:27,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:41:27 BoogieIcfgContainer [2024-10-13 02:41:27,529 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 02:41:27,531 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 02:41:27,531 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 02:41:27,533 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 02:41:27,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:41:26" (1/3) ... [2024-10-13 02:41:27,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d5a883f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:41:27, skipping insertion in model container [2024-10-13 02:41:27,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:41:26" (2/3) ... [2024-10-13 02:41:27,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d5a883f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:41:27, skipping insertion in model container [2024-10-13 02:41:27,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:41:27" (3/3) ... [2024-10-13 02:41:27,536 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-35.i [2024-10-13 02:41:27,551 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 02:41:27,551 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 02:41:27,595 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 02:41:27,600 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;@60c6545d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 02:41:27,600 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 02:41:27,603 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 64 states have internal predecessors, (92), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 02:41:27,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-13 02:41:27,613 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:41:27,614 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:41:27,614 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:41:27,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:41:27,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1471081478, now seen corresponding path program 1 times [2024-10-13 02:41:27,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:41:27,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935167591] [2024-10-13 02:41:27,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:41:27,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:41:27,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:28,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:41:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:28,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:41:28,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:28,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:41:28,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:28,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:41:28,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:28,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:41:28,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:28,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:41:28,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:28,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:41:28,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:28,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:41:28,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:28,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:41:28,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:28,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:41:28,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:28,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:41:28,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:28,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 02:41:28,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:28,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 02:41:28,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:28,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 02:41:28,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:28,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:41:28,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:28,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 02:41:28,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:28,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:41:28,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:28,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 02:41:28,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:28,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:41:28,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:28,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 02:41:28,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:28,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:41:28,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:28,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 02:41:28,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:28,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 02:41:28,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:28,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 02:41:28,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:28,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 02:41:28,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:28,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 02:41:28,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:28,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-13 02:41:28,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:28,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 02:41:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:28,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-13 02:41:28,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:41:28,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935167591] [2024-10-13 02:41:28,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935167591] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:41:28,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:41:28,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 02:41:28,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857180202] [2024-10-13 02:41:28,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:41:28,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 02:41:28,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:41:28,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 02:41:28,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:41:28,557 INFO L87 Difference]: Start difference. First operand has 94 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 64 states have internal predecessors, (92), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 02:41:28,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:41:28,801 INFO L93 Difference]: Finished difference Result 293 states and 521 transitions. [2024-10-13 02:41:28,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 02:41:28,804 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 184 [2024-10-13 02:41:28,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:41:28,811 INFO L225 Difference]: With dead ends: 293 [2024-10-13 02:41:28,812 INFO L226 Difference]: Without dead ends: 200 [2024-10-13 02:41:28,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 02:41:28,821 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 134 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 02:41:28,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 505 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 02:41:28,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-10-13 02:41:28,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 179. [2024-10-13 02:41:28,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 120 states have (on average 1.375) internal successors, (165), 120 states have internal predecessors, (165), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-13 02:41:28,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 277 transitions. [2024-10-13 02:41:28,887 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 277 transitions. Word has length 184 [2024-10-13 02:41:28,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:41:28,890 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 277 transitions. [2024-10-13 02:41:28,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 02:41:28,890 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 277 transitions. [2024-10-13 02:41:28,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-13 02:41:28,894 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:41:28,894 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:41:28,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 02:41:28,895 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:41:28,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:41:28,895 INFO L85 PathProgramCache]: Analyzing trace with hash -498222247, now seen corresponding path program 1 times [2024-10-13 02:41:28,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:41:28,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690621039] [2024-10-13 02:41:28,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:41:28,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:41:28,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:41:29,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:41:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:41:29,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:41:29,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:41:29,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:41:29,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:41:29,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:41:29,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:41:29,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:41:29,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:41:29,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 02:41:29,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 02:41:29,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 02:41:29,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:41:29,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 02:41:29,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:41:29,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 02:41:29,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:41:29,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 02:41:29,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:41:29,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 02:41:29,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 02:41:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 02:41:29,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 02:41:29,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 02:41:29,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-13 02:41:29,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 02:41:29,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-13 02:41:29,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:41:29,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690621039] [2024-10-13 02:41:29,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690621039] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:41:29,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:41:29,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 02:41:29,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344625809] [2024-10-13 02:41:29,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:41:29,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 02:41:29,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:41:29,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 02:41:29,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 02:41:29,303 INFO L87 Difference]: Start difference. First operand 179 states and 277 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 02:41:29,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:41:29,431 INFO L93 Difference]: Finished difference Result 561 states and 864 transitions. [2024-10-13 02:41:29,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 02:41:29,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 185 [2024-10-13 02:41:29,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:41:29,438 INFO L225 Difference]: With dead ends: 561 [2024-10-13 02:41:29,439 INFO L226 Difference]: Without dead ends: 383 [2024-10-13 02:41:29,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 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-10-13 02:41:29,442 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 137 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:41:29,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 420 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 02:41:29,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-10-13 02:41:29,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 355. [2024-10-13 02:41:29,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 238 states have (on average 1.3697478991596639) internal successors, (326), 238 states have internal predecessors, (326), 112 states have call successors, (112), 4 states have call predecessors, (112), 4 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2024-10-13 02:41:29,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 550 transitions. [2024-10-13 02:41:29,501 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 550 transitions. Word has length 185 [2024-10-13 02:41:29,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:41:29,502 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 550 transitions. [2024-10-13 02:41:29,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 02:41:29,502 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 550 transitions. [2024-10-13 02:41:29,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-13 02:41:29,507 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:41:29,508 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:41:29,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 02:41:29,508 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:41:29,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:41:29,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1802600343, now seen corresponding path program 1 times [2024-10-13 02:41:29,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:41:29,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757155146] [2024-10-13 02:41:29,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:41:29,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:41:29,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:41:29,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:41:29,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:41:29,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:41:29,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:41:29,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:41:29,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:41:29,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:41:29,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:41:29,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:41:29,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:41:29,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 02:41:29,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 02:41:29,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 02:41:29,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:41:29,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 02:41:29,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:41:29,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 02:41:29,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:41:29,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 02:41:29,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:41:29,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 02:41:29,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 02:41:29,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 02:41:29,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 02:41:29,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 02:41:29,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-13 02:41:29,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 02:41:29,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:29,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-13 02:41:29,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:41:29,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757155146] [2024-10-13 02:41:29,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757155146] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:41:29,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:41:29,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 02:41:29,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499824379] [2024-10-13 02:41:29,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:41:29,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 02:41:29,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:41:29,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 02:41:29,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 02:41:29,730 INFO L87 Difference]: Start difference. First operand 355 states and 550 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 02:41:30,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:41:30,020 INFO L93 Difference]: Finished difference Result 1249 states and 1929 transitions. [2024-10-13 02:41:30,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 02:41:30,021 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 185 [2024-10-13 02:41:30,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:41:30,031 INFO L225 Difference]: With dead ends: 1249 [2024-10-13 02:41:30,031 INFO L226 Difference]: Without dead ends: 895 [2024-10-13 02:41:30,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 02:41:30,034 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 192 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 02:41:30,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 511 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 02:41:30,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2024-10-13 02:41:30,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 859. [2024-10-13 02:41:30,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 594 states have (on average 1.3703703703703705) internal successors, (814), 598 states have internal predecessors, (814), 252 states have call successors, (252), 12 states have call predecessors, (252), 12 states have return successors, (252), 248 states have call predecessors, (252), 252 states have call successors, (252) [2024-10-13 02:41:30,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1318 transitions. [2024-10-13 02:41:30,092 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1318 transitions. Word has length 185 [2024-10-13 02:41:30,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:41:30,093 INFO L471 AbstractCegarLoop]: Abstraction has 859 states and 1318 transitions. [2024-10-13 02:41:30,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 02:41:30,093 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1318 transitions. [2024-10-13 02:41:30,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-13 02:41:30,095 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:41:30,095 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:41:30,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 02:41:30,096 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:41:30,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:41:30,096 INFO L85 PathProgramCache]: Analyzing trace with hash 2060765781, now seen corresponding path program 1 times [2024-10-13 02:41:30,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:41:30,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531394130] [2024-10-13 02:41:30,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:41:30,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:41:30,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:41:30,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:41:30,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:41:30,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:41:30,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:41:30,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:41:30,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:41:30,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:41:30,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:41:30,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:41:30,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:41:30,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 02:41:30,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 02:41:30,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 02:41:30,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:41:30,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 02:41:30,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:41:30,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 02:41:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:41:30,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 02:41:30,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:41:30,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 02:41:30,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 02:41:30,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 02:41:30,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 02:41:30,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 02:41:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-13 02:41:30,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 02:41:30,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-13 02:41:30,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:41:30,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531394130] [2024-10-13 02:41:30,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531394130] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:41:30,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:41:30,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 02:41:30,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586640438] [2024-10-13 02:41:30,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:41:30,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 02:41:30,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:41:30,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 02:41:30,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:41:30,359 INFO L87 Difference]: Start difference. First operand 859 states and 1318 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 02:41:30,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:41:30,620 INFO L93 Difference]: Finished difference Result 1393 states and 2105 transitions. [2024-10-13 02:41:30,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 02:41:30,621 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 185 [2024-10-13 02:41:30,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:41:30,629 INFO L225 Difference]: With dead ends: 1393 [2024-10-13 02:41:30,630 INFO L226 Difference]: Without dead ends: 963 [2024-10-13 02:41:30,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 02:41:30,633 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 101 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 02:41:30,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 471 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 02:41:30,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2024-10-13 02:41:30,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 799. [2024-10-13 02:41:30,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 562 states have (on average 1.3772241992882561) internal successors, (774), 562 states have internal predecessors, (774), 224 states have call successors, (224), 12 states have call predecessors, (224), 12 states have return successors, (224), 224 states have call predecessors, (224), 224 states have call successors, (224) [2024-10-13 02:41:30,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1222 transitions. [2024-10-13 02:41:30,703 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1222 transitions. Word has length 185 [2024-10-13 02:41:30,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:41:30,704 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 1222 transitions. [2024-10-13 02:41:30,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 02:41:30,704 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1222 transitions. [2024-10-13 02:41:30,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-13 02:41:30,707 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:41:30,707 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:41:30,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 02:41:30,707 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:41:30,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:41:30,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1251419155, now seen corresponding path program 1 times [2024-10-13 02:41:30,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:41:30,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49837597] [2024-10-13 02:41:30,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:41:30,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:41:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:41:30,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:41:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:41:30,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:41:30,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:41:30,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:41:30,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:41:30,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:41:30,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:41:30,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:41:30,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:41:30,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 02:41:30,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 02:41:30,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 02:41:30,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:41:30,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 02:41:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:41:30,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 02:41:30,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:41:30,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 02:41:30,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:41:30,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 02:41:30,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 02:41:30,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 02:41:30,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 02:41:30,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 02:41:30,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-13 02:41:30,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 02:41:30,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:30,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 54 proven. 27 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-13 02:41:30,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:41:30,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49837597] [2024-10-13 02:41:30,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49837597] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 02:41:30,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269308637] [2024-10-13 02:41:30,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:41:30,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:41:30,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:41:30,957 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-10-13 02:41:30,958 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-10-13 02:41:31,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:31,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 02:41:31,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:41:31,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 711 proven. 27 refuted. 0 times theorem prover too weak. 774 trivial. 0 not checked. [2024-10-13 02:41:31,169 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:41:31,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 54 proven. 27 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-13 02:41:31,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269308637] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 02:41:31,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 02:41:31,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-10-13 02:41:31,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330714646] [2024-10-13 02:41:31,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 02:41:31,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 02:41:31,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:41:31,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 02:41:31,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 02:41:31,320 INFO L87 Difference]: Start difference. First operand 799 states and 1222 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) [2024-10-13 02:41:31,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:41:31,556 INFO L93 Difference]: Finished difference Result 1653 states and 2491 transitions. [2024-10-13 02:41:31,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 02:41:31,557 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) Word has length 185 [2024-10-13 02:41:31,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:41:31,561 INFO L225 Difference]: With dead ends: 1653 [2024-10-13 02:41:31,561 INFO L226 Difference]: Without dead ends: 855 [2024-10-13 02:41:31,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 422 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-10-13 02:41:31,563 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 299 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 02:41:31,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 235 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 02:41:31,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2024-10-13 02:41:31,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 831. [2024-10-13 02:41:31,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 586 states have (on average 1.341296928327645) internal successors, (786), 586 states have internal predecessors, (786), 224 states have call successors, (224), 20 states have call predecessors, (224), 20 states have return successors, (224), 224 states have call predecessors, (224), 224 states have call successors, (224) [2024-10-13 02:41:31,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1234 transitions. [2024-10-13 02:41:31,619 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1234 transitions. Word has length 185 [2024-10-13 02:41:31,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:41:31,620 INFO L471 AbstractCegarLoop]: Abstraction has 831 states and 1234 transitions. [2024-10-13 02:41:31,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) [2024-10-13 02:41:31,620 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1234 transitions. [2024-10-13 02:41:31,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-13 02:41:31,621 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:41:31,622 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:41:31,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 02:41:31,822 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-10-13 02:41:31,823 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:41:31,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:41:31,823 INFO L85 PathProgramCache]: Analyzing trace with hash -554019179, now seen corresponding path program 1 times [2024-10-13 02:41:31,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:41:31,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313303307] [2024-10-13 02:41:31,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:41:31,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:41:31,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 02:41:31,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2039602295] [2024-10-13 02:41:31,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:41:31,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:41:31,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:41:31,911 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 02:41:31,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 02:41:32,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 02:41:32,019 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 02:41:32,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 02:41:32,138 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 02:41:32,138 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 02:41:32,139 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 02:41:32,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 02:41:32,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-13 02:41:32,344 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-13 02:41:32,470 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 02:41:32,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 02:41:32 BoogieIcfgContainer [2024-10-13 02:41:32,472 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 02:41:32,473 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 02:41:32,473 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 02:41:32,473 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 02:41:32,473 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:41:27" (3/4) ... [2024-10-13 02:41:32,475 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 02:41:32,476 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 02:41:32,477 INFO L158 Benchmark]: Toolchain (without parser) took 5887.64ms. Allocated memory was 140.5MB in the beginning and 268.4MB in the end (delta: 127.9MB). Free memory was 68.9MB in the beginning and 218.2MB in the end (delta: -149.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 02:41:32,477 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 140.5MB. Free memory is still 92.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 02:41:32,477 INFO L158 Benchmark]: CACSL2BoogieTranslator took 334.94ms. Allocated memory was 140.5MB in the beginning and 178.3MB in the end (delta: 37.7MB). Free memory was 68.7MB in the beginning and 140.3MB in the end (delta: -71.6MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2024-10-13 02:41:32,477 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.67ms. Allocated memory is still 178.3MB. Free memory was 140.3MB in the beginning and 136.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 02:41:32,479 INFO L158 Benchmark]: Boogie Preprocessor took 63.18ms. Allocated memory is still 178.3MB. Free memory was 136.2MB in the beginning and 132.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 02:41:32,479 INFO L158 Benchmark]: RCFGBuilder took 496.70ms. Allocated memory is still 178.3MB. Free memory was 132.0MB in the beginning and 99.8MB in the end (delta: 32.2MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-13 02:41:32,479 INFO L158 Benchmark]: TraceAbstraction took 4941.75ms. Allocated memory was 178.3MB in the beginning and 268.4MB in the end (delta: 90.2MB). Free memory was 99.2MB in the beginning and 218.2MB in the end (delta: -119.0MB). Peak memory consumption was 124.8MB. Max. memory is 16.1GB. [2024-10-13 02:41:32,479 INFO L158 Benchmark]: Witness Printer took 3.54ms. Allocated memory is still 268.4MB. Free memory is still 218.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 02:41:32,481 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.09ms. Allocated memory is still 140.5MB. Free memory is still 92.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 334.94ms. Allocated memory was 140.5MB in the beginning and 178.3MB in the end (delta: 37.7MB). Free memory was 68.7MB in the beginning and 140.3MB in the end (delta: -71.6MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.67ms. Allocated memory is still 178.3MB. Free memory was 140.3MB in the beginning and 136.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.18ms. Allocated memory is still 178.3MB. Free memory was 136.2MB in the beginning and 132.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 496.70ms. Allocated memory is still 178.3MB. Free memory was 132.0MB in the beginning and 99.8MB in the end (delta: 32.2MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 4941.75ms. Allocated memory was 178.3MB in the beginning and 268.4MB in the end (delta: 90.2MB). Free memory was 99.2MB in the beginning and 218.2MB in the end (delta: -119.0MB). Peak memory consumption was 124.8MB. Max. memory is 16.1GB. * Witness Printer took 3.54ms. Allocated memory is still 268.4MB. Free memory is still 218.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 191, overapproximation of someBinaryDOUBLEComparisonOperation at line 191, overapproximation of someUnaryFLOAToperation at line 125, overapproximation of someBinaryArithmeticFLOAToperation at line 125. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_3 = 1; [L24] unsigned char var_1_4 = 0; [L25] unsigned char var_1_5 = 0; [L26] unsigned short int var_1_6 = 25; [L27] double var_1_9 = 999.625; [L28] unsigned short int var_1_11 = 5; [L29] signed short int var_1_12 = 2; [L30] signed long int var_1_13 = -256; [L31] double var_1_14 = 127.75; [L32] double var_1_15 = 9.75; [L33] float var_1_16 = 32.8; [L34] float var_1_17 = 32.5; [L35] float var_1_18 = 1.75; [L36] float var_1_19 = 1000000000000000.4; [L37] float var_1_20 = 0.875; [L38] unsigned char var_1_21 = 0; [L39] unsigned char var_1_22 = 0; [L40] signed short int var_1_23 = 64; [L41] signed short int var_1_24 = 25; [L42] signed short int var_1_25 = 0; [L43] float var_1_26 = 128.2; [L44] signed long int var_1_28 = -100000; [L45] signed char var_1_30 = -25; [L46] signed char var_1_33 = 32; [L47] signed char var_1_34 = -4; [L48] unsigned long int var_1_35 = 1; [L49] double var_1_39 = 7.75; [L50] float var_1_41 = 255.2; [L51] unsigned char var_1_42 = 25; [L52] unsigned char var_1_43 = 64; [L53] unsigned char var_1_44 = 1; [L54] float var_1_45 = 255.5; [L55] float var_1_46 = 10.55; [L56] signed short int last_1_var_1_12 = 2; [L57] signed long int last_1_var_1_13 = -256; [L58] double last_1_var_1_14 = 127.75; [L59] unsigned char last_1_var_1_21 = 0; [L195] isInitial = 1 [L196] FCALL initially() [L197] COND TRUE 1 [L198] CALL updateLastVariables() [L185] last_1_var_1_12 = var_1_12 [L186] last_1_var_1_13 = var_1_13 [L187] last_1_var_1_14 = var_1_14 [L188] last_1_var_1_21 = var_1_21 [L198] RET updateLastVariables() [L199] CALL updateVariables() [L138] var_1_3 = __VERIFIER_nondet_uchar() [L139] CALL assume_abort_if_not(var_1_3 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L139] RET assume_abort_if_not(var_1_3 >= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L140] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L140] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L141] var_1_4 = __VERIFIER_nondet_uchar() [L142] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L142] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L143] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L143] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L144] var_1_5 = __VERIFIER_nondet_uchar() [L145] CALL assume_abort_if_not(var_1_5 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L145] RET assume_abort_if_not(var_1_5 >= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L146] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L146] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L147] var_1_9 = __VERIFIER_nondet_double() [L148] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L148] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L149] var_1_11 = __VERIFIER_nondet_ushort() [L150] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L150] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L151] CALL assume_abort_if_not(var_1_11 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L151] RET assume_abort_if_not(var_1_11 <= 65534) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L152] var_1_15 = __VERIFIER_nondet_double() [L153] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L153] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L154] var_1_17 = __VERIFIER_nondet_float() [L155] CALL assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L155] RET assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L156] var_1_18 = __VERIFIER_nondet_float() [L157] CALL assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L157] RET assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L158] var_1_19 = __VERIFIER_nondet_float() [L159] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L159] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L160] var_1_20 = __VERIFIER_nondet_float() [L161] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L161] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L162] var_1_22 = __VERIFIER_nondet_uchar() [L163] CALL assume_abort_if_not(var_1_22 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L163] RET assume_abort_if_not(var_1_22 >= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L164] CALL assume_abort_if_not(var_1_22 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L164] RET assume_abort_if_not(var_1_22 <= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L165] var_1_24 = __VERIFIER_nondet_short() [L166] CALL assume_abort_if_not(var_1_24 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L166] RET assume_abort_if_not(var_1_24 >= -1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L167] CALL assume_abort_if_not(var_1_24 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L167] RET assume_abort_if_not(var_1_24 <= 32766) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L168] var_1_25 = __VERIFIER_nondet_short() [L169] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L169] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L170] CALL assume_abort_if_not(var_1_25 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L170] RET assume_abort_if_not(var_1_25 <= 32766) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L171] var_1_33 = __VERIFIER_nondet_char() [L172] CALL assume_abort_if_not(var_1_33 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=24, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=24, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L172] RET assume_abort_if_not(var_1_33 >= -126) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=24, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L173] CALL assume_abort_if_not(var_1_33 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=24, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=24, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L173] RET assume_abort_if_not(var_1_33 <= 126) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=24, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L174] var_1_34 = __VERIFIER_nondet_char() [L175] CALL assume_abort_if_not(var_1_34 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L175] RET assume_abort_if_not(var_1_34 >= -63) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L176] CALL assume_abort_if_not(var_1_34 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L176] RET assume_abort_if_not(var_1_34 <= 63) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L177] var_1_43 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_43 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L178] RET assume_abort_if_not(var_1_43 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L179] CALL assume_abort_if_not(var_1_43 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L179] RET assume_abort_if_not(var_1_43 <= 254) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L180] var_1_44 = __VERIFIER_nondet_uchar() [L181] CALL assume_abort_if_not(var_1_44 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L181] RET assume_abort_if_not(var_1_44 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L182] CALL assume_abort_if_not(var_1_44 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L182] RET assume_abort_if_not(var_1_44 <= 254) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L199] RET updateVariables() [L200] CALL step() [L63] var_1_26 = var_1_18 [L64] var_1_28 = var_1_6 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=2, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_28=25, var_1_30=-25, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L65] COND FALSE !(var_1_20 <= var_1_18) [L70] var_1_30 = (50 + var_1_34) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=2, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_28=25, var_1_30=0, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L72] COND FALSE !(! var_1_22) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=2, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_28=25, var_1_30=0, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L79] COND TRUE 32u >= (((((var_1_6) > (var_1_11)) ? (var_1_6) : (var_1_11))) % 16u) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=2, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_28=25, var_1_30=0, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L80] COND FALSE !((-5 > var_1_25) && (var_1_6 <= ((((var_1_34) > (var_1_12)) ? (var_1_34) : (var_1_12))))) [L83] var_1_39 = ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=2, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_28=25, var_1_30=0, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=3, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L90] var_1_41 = ((((((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) < (var_1_20)) ? (((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) : (var_1_20))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=2, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_28=25, var_1_30=0, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=3, var_1_3=1, var_1_41=4, var_1_42=25, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L91] EXPR var_1_11 | var_1_6 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=2, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_28=25, var_1_30=0, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=3, var_1_3=1, var_1_41=4, var_1_42=25, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L91] COND TRUE var_1_33 < (var_1_11 | var_1_6) [L92] var_1_42 = ((((var_1_43) < (var_1_44)) ? (var_1_43) : (var_1_44))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=2, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_28=25, var_1_30=0, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=3, var_1_3=1, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L94] var_1_45 = 2.71f [L95] var_1_46 = var_1_17 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=5, var_1_18=2, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_28=25, var_1_30=0, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=3, var_1_3=1, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=5, var_1_4=0, var_1_5=1, var_1_6=25] [L96] COND FALSE !(\read(last_1_var_1_21)) [L99] var_1_1 = (var_1_3 && var_1_5) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=5, var_1_18=2, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_28=25, var_1_30=0, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=3, var_1_3=1, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=5, var_1_4=0, var_1_5=1, var_1_6=25] [L101] COND FALSE !(var_1_18 > var_1_9) [L104] var_1_23 = (last_1_var_1_13 + 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=5, var_1_18=2, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_28=25, var_1_30=0, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=3, var_1_3=1, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=5, var_1_4=0, var_1_5=1, var_1_6=25] [L106] signed long int stepLocal_0 = last_1_var_1_12; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, stepLocal_0=2, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=5, var_1_18=2, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_28=25, var_1_30=0, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=3, var_1_3=1, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=5, var_1_4=0, var_1_5=1, var_1_6=25] [L107] COND TRUE last_1_var_1_12 >= stepLocal_0 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=5, var_1_18=2, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_28=25, var_1_30=0, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=3, var_1_3=1, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=5, var_1_4=0, var_1_5=1, var_1_6=25] [L108] COND TRUE (var_1_9 - 1.00000000000025E12) >= last_1_var_1_14 [L109] var_1_6 = 200 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=5, var_1_18=2, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_28=25, var_1_30=0, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=3, var_1_3=1, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=5, var_1_4=0, var_1_5=1, var_1_6=200] [L116] unsigned short int stepLocal_1 = var_1_6; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, stepLocal_1=200, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=5, var_1_18=2, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_28=25, var_1_30=0, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=3, var_1_3=1, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=5, var_1_4=0, var_1_5=1, var_1_6=200] [L117] COND FALSE !(var_1_11 > stepLocal_1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=5, var_1_18=2, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_28=25, var_1_30=0, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=3, var_1_3=1, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=5, var_1_4=0, var_1_5=1, var_1_6=200] [L120] EXPR var_1_11 >> var_1_6 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=5, var_1_18=2, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_28=25, var_1_30=0, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=3, var_1_3=1, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=5, var_1_4=0, var_1_5=1, var_1_6=200] [L120] COND TRUE (var_1_12 + var_1_23) < ((var_1_11 >> var_1_6) * var_1_12) [L121] var_1_14 = var_1_15 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=6, var_1_15=6, var_1_16=164/5, var_1_17=5, var_1_18=2, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_28=25, var_1_30=0, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=3, var_1_3=1, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=5, var_1_4=0, var_1_5=1, var_1_6=200] [L125] var_1_16 = (((((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) < 0 ) ? -((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) : ((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))))) [L126] unsigned short int stepLocal_3 = var_1_11; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, stepLocal_3=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=6, var_1_15=6, var_1_16=7, var_1_17=5, var_1_18=2, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_28=25, var_1_30=0, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=3, var_1_3=1, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=5, var_1_4=0, var_1_5=1, var_1_6=200] [L127] COND FALSE !(stepLocal_3 == var_1_6) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=6, var_1_15=6, var_1_16=7, var_1_17=5, var_1_18=2, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_28=25, var_1_30=0, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=3, var_1_3=1, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=5, var_1_4=0, var_1_5=1, var_1_6=200] [L130] unsigned short int stepLocal_2 = var_1_6; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, stepLocal_2=200, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=6, var_1_15=6, var_1_16=7, var_1_17=5, var_1_18=2, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_28=25, var_1_30=0, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=3, var_1_3=1, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=5, var_1_4=0, var_1_5=1, var_1_6=200] [L131] COND FALSE !(stepLocal_2 == var_1_12) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=6, var_1_15=6, var_1_16=7, var_1_17=5, var_1_18=2, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_28=25, var_1_30=0, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=3, var_1_3=1, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=5, var_1_4=0, var_1_5=1, var_1_6=200] [L200] RET step() [L201] CALL, EXPR property() [L191] EXPR ((((last_1_var_1_21 ? (var_1_1 == ((unsigned char) ((! var_1_3) || var_1_4))) : (var_1_1 == ((unsigned char) (var_1_3 && var_1_5)))) && ((last_1_var_1_12 >= last_1_var_1_12) ? (((var_1_9 - 1.00000000000025E12) >= last_1_var_1_14) ? (var_1_6 == ((unsigned short int) 200)) : (var_1_6 == ((unsigned short int) var_1_11))) : (var_1_6 == ((unsigned short int) var_1_11)))) && ((var_1_11 > var_1_6) ? (var_1_12 == ((signed short int) 32)) : 1)) && ((var_1_6 == var_1_12) ? ((! var_1_3) ? (var_1_13 == ((signed long int) ((last_1_var_1_13 + var_1_6) + (var_1_11 - var_1_23)))) : 1) : 1)) && (((var_1_12 + var_1_23) < ((var_1_11 >> var_1_6) * var_1_12)) ? (var_1_14 == ((double) var_1_15)) : (var_1_14 == ((double) var_1_15))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=6, var_1_15=6, var_1_16=7, var_1_17=5, var_1_18=2, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_28=25, var_1_30=0, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=3, var_1_3=1, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=5, var_1_4=0, var_1_5=1, var_1_6=200] [L191-L192] return (((((((last_1_var_1_21 ? (var_1_1 == ((unsigned char) ((! var_1_3) || var_1_4))) : (var_1_1 == ((unsigned char) (var_1_3 && var_1_5)))) && ((last_1_var_1_12 >= last_1_var_1_12) ? (((var_1_9 - 1.00000000000025E12) >= last_1_var_1_14) ? (var_1_6 == ((unsigned short int) 200)) : (var_1_6 == ((unsigned short int) var_1_11))) : (var_1_6 == ((unsigned short int) var_1_11)))) && ((var_1_11 > var_1_6) ? (var_1_12 == ((signed short int) 32)) : 1)) && ((var_1_6 == var_1_12) ? ((! var_1_3) ? (var_1_13 == ((signed long int) ((last_1_var_1_13 + var_1_6) + (var_1_11 - var_1_23)))) : 1) : 1)) && (((var_1_12 + var_1_23) < ((var_1_11 >> var_1_6) * var_1_12)) ? (var_1_14 == ((double) var_1_15)) : (var_1_14 == ((double) var_1_15)))) && (var_1_16 == ((float) (((((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) < 0 ) ? -((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) : ((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20))))))))) && ((var_1_11 == var_1_6) ? (var_1_21 == ((unsigned char) ((var_1_5 || var_1_3) && (var_1_1 || var_1_22)))) : 1)) && ((var_1_18 > var_1_9) ? (var_1_23 == ((signed short int) (((((var_1_24 - var_1_25)) > (last_1_var_1_13)) ? ((var_1_24 - var_1_25)) : (last_1_var_1_13))))) : (var_1_23 == ((signed short int) (last_1_var_1_13 + 1)))) ; [L201] RET, EXPR property() [L201] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=6, var_1_15=6, var_1_16=7, var_1_17=5, var_1_18=2, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_28=25, var_1_30=0, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=3, var_1_3=1, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=5, var_1_4=0, var_1_5=1, var_1_6=200] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=6, var_1_15=6, var_1_16=7, var_1_17=5, var_1_18=2, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_28=25, var_1_30=0, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=3, var_1_3=1, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=5, var_1_4=0, var_1_5=1, var_1_6=200] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.8s, OverallIterations: 6, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 881 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 863 mSDsluCounter, 2142 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1332 mSDsCounter, 321 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 669 IncrementalHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 321 mSolverCounterUnsat, 810 mSDtfsCounter, 669 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 683 GetRequests, 659 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=859occurred in iteration=3, InterpolantAutomatonStates: 26, 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, 5 MinimizatonAttempts, 273 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1479 NumberOfCodeBlocks, 1479 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1287 ConstructedInterpolants, 0 QuantifiedInterpolants, 1911 SizeOfPredicates, 0 NumberOfNonLiveVariables, 443 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 10503/10584 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 02:41:32,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-35.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 19520942352997fcf297d8ad079cb9fafb5c7d1c5c429124759a57b39998961b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 02:41:34,330 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 02:41:34,388 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 02:41:34,394 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 02:41:34,395 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 02:41:34,417 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 02:41:34,419 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 02:41:34,419 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 02:41:34,420 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 02:41:34,420 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 02:41:34,420 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 02:41:34,420 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 02:41:34,421 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 02:41:34,421 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 02:41:34,421 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 02:41:34,422 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 02:41:34,422 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 02:41:34,424 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 02:41:34,424 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 02:41:34,424 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 02:41:34,426 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 02:41:34,427 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 02:41:34,427 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 02:41:34,427 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 02:41:34,429 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 02:41:34,429 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 02:41:34,429 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 02:41:34,429 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 02:41:34,430 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 02:41:34,430 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 02:41:34,430 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 02:41:34,430 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 02:41:34,430 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 02:41:34,431 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 02:41:34,431 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:41:34,432 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 02:41:34,432 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 02:41:34,432 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 02:41:34,432 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 02:41:34,433 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 02:41:34,433 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 02:41:34,433 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 02:41:34,433 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 02:41:34,433 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 02:41:34,434 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 02:41:34,434 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 -> 19520942352997fcf297d8ad079cb9fafb5c7d1c5c429124759a57b39998961b [2024-10-13 02:41:34,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 02:41:34,744 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 02:41:34,748 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 02:41:34,749 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 02:41:34,749 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 02:41:34,752 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-35.i [2024-10-13 02:41:36,030 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 02:41:36,213 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 02:41:36,213 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-35.i [2024-10-13 02:41:36,225 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8715232c/d9fa3b80237f4721aeff17308f31e8d0/FLAG87d8daf7b [2024-10-13 02:41:36,240 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8715232c/d9fa3b80237f4721aeff17308f31e8d0 [2024-10-13 02:41:36,242 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 02:41:36,243 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 02:41:36,245 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 02:41:36,246 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 02:41:36,250 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 02:41:36,250 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:41:36" (1/1) ... [2024-10-13 02:41:36,251 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d7a4b07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:41:36, skipping insertion in model container [2024-10-13 02:41:36,251 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:41:36" (1/1) ... [2024-10-13 02:41:36,275 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 02:41:36,414 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-35.i[919,932] [2024-10-13 02:41:36,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:41:36,505 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 02:41:36,527 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-35.i[919,932] [2024-10-13 02:41:36,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:41:36,595 INFO L204 MainTranslator]: Completed translation [2024-10-13 02:41:36,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:41:36 WrapperNode [2024-10-13 02:41:36,595 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 02:41:36,596 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 02:41:36,596 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 02:41:36,596 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 02:41:36,601 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:41:36" (1/1) ... [2024-10-13 02:41:36,616 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:41:36" (1/1) ... [2024-10-13 02:41:36,647 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 202 [2024-10-13 02:41:36,648 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 02:41:36,649 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 02:41:36,649 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 02:41:36,650 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 02:41:36,658 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:41:36" (1/1) ... [2024-10-13 02:41:36,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:41:36" (1/1) ... [2024-10-13 02:41:36,664 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:41:36" (1/1) ... [2024-10-13 02:41:36,686 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 02:41:36,686 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:41:36" (1/1) ... [2024-10-13 02:41:36,686 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:41:36" (1/1) ... [2024-10-13 02:41:36,702 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:41:36" (1/1) ... [2024-10-13 02:41:36,708 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:41:36" (1/1) ... [2024-10-13 02:41:36,710 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:41:36" (1/1) ... [2024-10-13 02:41:36,713 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:41:36" (1/1) ... [2024-10-13 02:41:36,717 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 02:41:36,721 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 02:41:36,721 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 02:41:36,721 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 02:41:36,722 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:41:36" (1/1) ... [2024-10-13 02:41:36,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:41:36,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:41:36,755 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-10-13 02:41:36,759 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-10-13 02:41:36,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 02:41:36,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 02:41:36,797 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 02:41:36,798 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 02:41:36,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 02:41:36,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 02:41:36,874 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 02:41:36,875 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 02:41:39,360 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-13 02:41:39,361 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 02:41:39,401 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 02:41:39,402 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 02:41:39,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:41:39 BoogieIcfgContainer [2024-10-13 02:41:39,402 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 02:41:39,404 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 02:41:39,405 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 02:41:39,407 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 02:41:39,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:41:36" (1/3) ... [2024-10-13 02:41:39,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b2765ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:41:39, skipping insertion in model container [2024-10-13 02:41:39,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:41:36" (2/3) ... [2024-10-13 02:41:39,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b2765ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:41:39, skipping insertion in model container [2024-10-13 02:41:39,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:41:39" (3/3) ... [2024-10-13 02:41:39,410 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-35.i [2024-10-13 02:41:39,422 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 02:41:39,422 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 02:41:39,483 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 02:41:39,491 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;@1d3cec6a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 02:41:39,492 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 02:41:39,499 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 50 states have (on average 1.44) internal successors, (72), 51 states have internal predecessors, (72), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 02:41:39,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-10-13 02:41:39,514 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:41:39,515 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:41:39,516 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:41:39,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:41:39,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1163003153, now seen corresponding path program 1 times [2024-10-13 02:41:39,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:41:39,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1512770419] [2024-10-13 02:41:39,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:41:39,538 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:41:39,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:41:39,541 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-10-13 02:41:39,559 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-10-13 02:41:39,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:39,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 02:41:39,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:41:39,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 734 proven. 0 refuted. 0 times theorem prover too weak. 778 trivial. 0 not checked. [2024-10-13 02:41:39,999 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:41:40,000 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:41:40,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1512770419] [2024-10-13 02:41:40,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1512770419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:41:40,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:41:40,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:41:40,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991437945] [2024-10-13 02:41:40,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:41:40,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 02:41:40,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:41:40,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 02:41:40,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:41:40,032 INFO L87 Difference]: Start difference. First operand has 81 states, 50 states have (on average 1.44) internal successors, (72), 51 states have internal predecessors, (72), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-13 02:41:40,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:41:40,907 INFO L93 Difference]: Finished difference Result 158 states and 280 transitions. [2024-10-13 02:41:40,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 02:41:40,927 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 180 [2024-10-13 02:41:40,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:41:40,932 INFO L225 Difference]: With dead ends: 158 [2024-10-13 02:41:40,932 INFO L226 Difference]: Without dead ends: 78 [2024-10-13 02:41:40,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:41:40,938 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 02:41:40,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 02:41:40,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-13 02:41:40,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-13 02:41:40,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 48 states have internal predecessors, (64), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 02:41:40,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 120 transitions. [2024-10-13 02:41:40,972 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 120 transitions. Word has length 180 [2024-10-13 02:41:40,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:41:40,972 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 120 transitions. [2024-10-13 02:41:40,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-13 02:41:40,973 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 120 transitions. [2024-10-13 02:41:40,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-10-13 02:41:40,975 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:41:40,975 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:41:40,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-13 02:41:41,176 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-10-13 02:41:41,177 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:41:41,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:41:41,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1719783159, now seen corresponding path program 1 times [2024-10-13 02:41:41,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:41:41,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [972734254] [2024-10-13 02:41:41,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:41:41,179 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:41:41,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:41:41,182 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-10-13 02:41:41,186 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-10-13 02:41:41,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:41,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 02:41:41,538 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:41:41,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 711 proven. 27 refuted. 0 times theorem prover too weak. 774 trivial. 0 not checked. [2024-10-13 02:41:41,759 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:41:42,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 54 proven. 27 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-13 02:41:42,062 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:41:42,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [972734254] [2024-10-13 02:41:42,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [972734254] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 02:41:42,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 02:41:42,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-13 02:41:42,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356119660] [2024-10-13 02:41:42,064 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 02:41:42,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 02:41:42,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:41:42,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 02:41:42,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 02:41:42,069 INFO L87 Difference]: Start difference. First operand 78 states and 120 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) [2024-10-13 02:41:43,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:41:43,363 INFO L93 Difference]: Finished difference Result 161 states and 244 transitions. [2024-10-13 02:41:43,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 02:41:43,402 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) Word has length 180 [2024-10-13 02:41:43,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:41:43,406 INFO L225 Difference]: With dead ends: 161 [2024-10-13 02:41:43,406 INFO L226 Difference]: Without dead ends: 84 [2024-10-13 02:41:43,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-10-13 02:41:43,408 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 69 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 02:41:43,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 186 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 02:41:43,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-13 02:41:43,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2024-10-13 02:41:43,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 51 states have internal predecessors, (66), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 02:41:43,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 122 transitions. [2024-10-13 02:41:43,430 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 122 transitions. Word has length 180 [2024-10-13 02:41:43,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:41:43,431 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 122 transitions. [2024-10-13 02:41:43,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) [2024-10-13 02:41:43,431 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 122 transitions. [2024-10-13 02:41:43,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-10-13 02:41:43,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:41:43,435 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:41:43,447 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-10-13 02:41:43,636 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-10-13 02:41:43,636 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:41:43,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:41:43,637 INFO L85 PathProgramCache]: Analyzing trace with hash 581039431, now seen corresponding path program 1 times [2024-10-13 02:41:43,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:41:43,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1848147806] [2024-10-13 02:41:43,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:41:43,638 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:41:43,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:41:43,640 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-10-13 02:41:43,641 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-10-13 02:41:43,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:43,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 02:41:43,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:41:44,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-13 02:41:44,304 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:41:44,304 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:41:44,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1848147806] [2024-10-13 02:41:44,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1848147806] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:41:44,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:41:44,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:41:44,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974723237] [2024-10-13 02:41:44,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:41:44,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 02:41:44,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:41:44,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 02:41:44,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 02:41:44,307 INFO L87 Difference]: Start difference. First operand 82 states and 122 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 02:41:46,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:41:46,231 INFO L93 Difference]: Finished difference Result 262 states and 390 transitions. [2024-10-13 02:41:46,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 02:41:46,250 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 180 [2024-10-13 02:41:46,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:41:46,252 INFO L225 Difference]: With dead ends: 262 [2024-10-13 02:41:46,252 INFO L226 Difference]: Without dead ends: 181 [2024-10-13 02:41:46,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 177 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-10-13 02:41:46,254 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 108 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-13 02:41:46,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 367 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-13 02:41:46,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-13 02:41:46,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 161. [2024-10-13 02:41:46,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 100 states have (on average 1.29) internal successors, (129), 100 states have internal predecessors, (129), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-13 02:41:46,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 241 transitions. [2024-10-13 02:41:46,281 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 241 transitions. Word has length 180 [2024-10-13 02:41:46,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:41:46,281 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 241 transitions. [2024-10-13 02:41:46,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 02:41:46,282 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 241 transitions. [2024-10-13 02:41:46,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-10-13 02:41:46,283 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:41:46,283 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:41:46,299 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 (4)] Ended with exit code 0 [2024-10-13 02:41:46,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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-10-13 02:41:46,484 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:41:46,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:41:46,485 INFO L85 PathProgramCache]: Analyzing trace with hash -430077819, now seen corresponding path program 1 times [2024-10-13 02:41:46,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:41:46,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1086439059] [2024-10-13 02:41:46,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:41:46,485 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:41:46,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:41:46,488 INFO L229 MonitoredProcess]: Starting monitored process 5 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-10-13 02:41:46,489 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 (5)] Waiting until timeout for monitored process [2024-10-13 02:41:46,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:46,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 02:41:46,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:41:47,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-13 02:41:47,169 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:41:47,169 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:41:47,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1086439059] [2024-10-13 02:41:47,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1086439059] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:41:47,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:41:47,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 02:41:47,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831456329] [2024-10-13 02:41:47,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:41:47,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 02:41:47,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:41:47,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 02:41:47,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:41:47,174 INFO L87 Difference]: Start difference. First operand 161 states and 241 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 02:41:48,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:41:49,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:41:49,248 INFO L93 Difference]: Finished difference Result 503 states and 752 transitions. [2024-10-13 02:41:49,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 02:41:49,264 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 180 [2024-10-13 02:41:49,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:41:49,269 INFO L225 Difference]: With dead ends: 503 [2024-10-13 02:41:49,269 INFO L226 Difference]: Without dead ends: 343 [2024-10-13 02:41:49,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 02:41:49,271 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 90 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:41:49,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 413 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-13 02:41:49,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-10-13 02:41:49,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 319. [2024-10-13 02:41:49,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 198 states have (on average 1.2828282828282829) internal successors, (254), 198 states have internal predecessors, (254), 112 states have call successors, (112), 8 states have call predecessors, (112), 8 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2024-10-13 02:41:49,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 478 transitions. [2024-10-13 02:41:49,321 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 478 transitions. Word has length 180 [2024-10-13 02:41:49,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:41:49,322 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 478 transitions. [2024-10-13 02:41:49,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 02:41:49,322 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 478 transitions. [2024-10-13 02:41:49,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-13 02:41:49,323 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:41:49,324 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:41:49,338 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 (5)] Ended with exit code 0 [2024-10-13 02:41:49,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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-10-13 02:41:49,525 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:41:49,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:41:49,525 INFO L85 PathProgramCache]: Analyzing trace with hash -113234026, now seen corresponding path program 1 times [2024-10-13 02:41:49,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:41:49,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [311453349] [2024-10-13 02:41:49,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:41:49,526 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:41:49,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:41:49,529 INFO L229 MonitoredProcess]: Starting monitored process 6 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-10-13 02:41:49,533 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 (6)] Waiting until timeout for monitored process [2024-10-13 02:41:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:49,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 02:41:49,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:41:49,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-13 02:41:49,941 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:41:49,941 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:41:49,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [311453349] [2024-10-13 02:41:49,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [311453349] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:41:49,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:41:49,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 02:41:49,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050671991] [2024-10-13 02:41:49,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:41:49,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 02:41:49,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:41:49,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 02:41:49,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 02:41:49,945 INFO L87 Difference]: Start difference. First operand 319 states and 478 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 02:41:53,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:41:53,968 INFO L93 Difference]: Finished difference Result 1007 states and 1505 transitions. [2024-10-13 02:41:53,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 02:41:53,976 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 181 [2024-10-13 02:41:53,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:41:53,982 INFO L225 Difference]: With dead ends: 1007 [2024-10-13 02:41:53,984 INFO L226 Difference]: Without dead ends: 689 [2024-10-13 02:41:53,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 02:41:53,985 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 147 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-13 02:41:53,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 659 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-13 02:41:53,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2024-10-13 02:41:54,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 659. [2024-10-13 02:41:54,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 402 states have (on average 1.2587064676616915) internal successors, (506), 404 states have internal predecessors, (506), 238 states have call successors, (238), 18 states have call predecessors, (238), 18 states have return successors, (238), 236 states have call predecessors, (238), 238 states have call successors, (238) [2024-10-13 02:41:54,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 982 transitions. [2024-10-13 02:41:54,062 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 982 transitions. Word has length 181 [2024-10-13 02:41:54,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:41:54,062 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 982 transitions. [2024-10-13 02:41:54,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 02:41:54,063 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 982 transitions. [2024-10-13 02:41:54,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-13 02:41:54,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:41:54,064 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:41:54,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-13 02:41:54,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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-10-13 02:41:54,266 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:41:54,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:41:54,266 INFO L85 PathProgramCache]: Analyzing trace with hash -55975724, now seen corresponding path program 1 times [2024-10-13 02:41:54,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:41:54,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1364049655] [2024-10-13 02:41:54,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:41:54,267 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:41:54,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:41:54,269 INFO L229 MonitoredProcess]: Starting monitored process 7 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-10-13 02:41:54,270 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 (7)] Waiting until timeout for monitored process [2024-10-13 02:41:54,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:41:54,720 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-13 02:41:54,726 INFO L278 TraceCheckSpWp]: Computing forward predicates...