./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-pr-co_file-92.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-92.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 adcde90e8b053d99359c11706230b2ebf7c2fa95333a62c210d892627b4fe438 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:56:44,307 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:56:44,377 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 09:56:44,383 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:56:44,384 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:56:44,425 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:56:44,426 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:56:44,426 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:56:44,427 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:56:44,427 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:56:44,429 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:56:44,429 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:56:44,430 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:56:44,434 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:56:44,434 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:56:44,434 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:56:44,435 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:56:44,435 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:56:44,435 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 09:56:44,435 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:56:44,435 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:56:44,437 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:56:44,437 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:56:44,437 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:56:44,437 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:56:44,438 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:56:44,438 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:56:44,438 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:56:44,438 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:56:44,438 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:56:44,439 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:56:44,439 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:56:44,439 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:56:44,439 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:56:44,439 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:56:44,440 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:56:44,440 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 09:56:44,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 09:56:44,442 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:56:44,442 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:56:44,442 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:56:44,442 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:56:44,443 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-clean/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-clean/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 -> adcde90e8b053d99359c11706230b2ebf7c2fa95333a62c210d892627b4fe438 [2024-10-11 09:56:44,736 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:56:44,766 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:56:44,770 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:56:44,771 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:56:44,772 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:56:44,773 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-92.i [2024-10-11 09:56:46,169 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:56:46,391 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:56:46,391 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-92.i [2024-10-11 09:56:46,400 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c54ecd392/55301e3e09074acdbf57eec406c32dc4/FLAGab9e4a25e [2024-10-11 09:56:46,423 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c54ecd392/55301e3e09074acdbf57eec406c32dc4 [2024-10-11 09:56:46,428 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:56:46,430 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:56:46,433 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:56:46,433 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:56:46,439 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:56:46,440 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:56:46" (1/1) ... [2024-10-11 09:56:46,441 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a92d887 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:56:46, skipping insertion in model container [2024-10-11 09:56:46,453 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:56:46" (1/1) ... [2024-10-11 09:56:46,490 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:56:46,670 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-pr-co_file-92.i[919,932] [2024-10-11 09:56:46,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:56:46,773 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:56:46,787 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-pr-co_file-92.i[919,932] [2024-10-11 09:56:46,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:56:46,849 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:56:46,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:56:46 WrapperNode [2024-10-11 09:56:46,850 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:56:46,851 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:56:46,851 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:56:46,851 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:56:46,857 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:56:46" (1/1) ... [2024-10-11 09:56:46,868 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:56:46" (1/1) ... [2024-10-11 09:56:46,914 INFO L138 Inliner]: procedures = 26, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 263 [2024-10-11 09:56:46,914 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:56:46,915 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:56:46,915 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:56:46,915 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:56:46,928 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:56:46" (1/1) ... [2024-10-11 09:56:46,928 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:56:46" (1/1) ... [2024-10-11 09:56:46,933 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:56:46" (1/1) ... [2024-10-11 09:56:46,950 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-11 09:56:46,950 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:56:46" (1/1) ... [2024-10-11 09:56:46,951 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:56:46" (1/1) ... [2024-10-11 09:56:46,962 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:56:46" (1/1) ... [2024-10-11 09:56:46,965 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:56:46" (1/1) ... [2024-10-11 09:56:46,968 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:56:46" (1/1) ... [2024-10-11 09:56:46,970 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:56:46" (1/1) ... [2024-10-11 09:56:46,974 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:56:46,975 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:56:46,975 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:56:46,975 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:56:46,976 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:56:46" (1/1) ... [2024-10-11 09:56:46,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:56:47,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:56:47,014 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 09:56:47,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 09:56:47,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:56:47,063 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:56:47,064 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:56:47,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 09:56:47,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:56:47,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:56:47,204 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:56:47,206 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:56:47,725 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-11 09:56:47,725 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:56:47,775 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:56:47,775 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 09:56:47,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:56:47 BoogieIcfgContainer [2024-10-11 09:56:47,776 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:56:47,778 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:56:47,779 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:56:47,782 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:56:47,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:56:46" (1/3) ... [2024-10-11 09:56:47,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@318c6db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:56:47, skipping insertion in model container [2024-10-11 09:56:47,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:56:46" (2/3) ... [2024-10-11 09:56:47,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@318c6db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:56:47, skipping insertion in model container [2024-10-11 09:56:47,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:56:47" (3/3) ... [2024-10-11 09:56:47,786 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-92.i [2024-10-11 09:56:47,801 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:56:47,802 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:56:47,859 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:56:47,865 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;@4cd6347b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:56:47,866 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:56:47,871 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 67 states have internal predecessors, (98), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-11 09:56:47,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-10-11 09:56:47,891 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:56:47,892 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:56:47,893 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:56:47,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:56:47,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1142121232, now seen corresponding path program 1 times [2024-10-11 09:56:47,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:56:47,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397965515] [2024-10-11 09:56:47,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:56:47,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:56:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:48,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:56:48,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:48,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:56:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:48,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:56:48,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:48,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:56:48,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:48,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:56:48,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:48,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:56:48,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:48,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:56:48,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:48,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:56:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:48,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:56:48,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:48,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:56:48,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:48,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:56:48,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:48,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:56:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:48,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:56:48,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:48,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:56:48,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:48,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 09:56:48,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:48,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 09:56:48,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:48,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:56:48,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:48,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 09:56:48,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:48,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:56:48,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:48,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 09:56:48,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:48,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 09:56:48,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:48,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 09:56:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:48,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 09:56:48,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:48,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 09:56:48,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:48,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 09:56:48,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:48,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 09:56:48,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:48,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 09:56:48,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:48,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 09:56:48,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:48,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 09:56:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:48,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 09:56:48,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:48,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 09:56:48,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:48,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-11 09:56:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:48,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-11 09:56:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:48,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-11 09:56:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:48,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-11 09:56:48,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:48,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-11 09:56:48,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:56:48,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397965515] [2024-10-11 09:56:48,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397965515] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:56:48,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:56:48,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:56:48,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808467645] [2024-10-11 09:56:48,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:56:48,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 09:56:48,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:56:48,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 09:56:48,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:56:48,448 INFO L87 Difference]: Start difference. First operand has 104 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 67 states have internal predecessors, (98), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2024-10-11 09:56:48,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:56:48,513 INFO L93 Difference]: Finished difference Result 205 states and 369 transitions. [2024-10-11 09:56:48,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 09:56:48,516 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) Word has length 218 [2024-10-11 09:56:48,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:56:48,525 INFO L225 Difference]: With dead ends: 205 [2024-10-11 09:56:48,526 INFO L226 Difference]: Without dead ends: 102 [2024-10-11 09:56:48,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:56:48,536 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:56:48,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 158 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 09:56:48,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-11 09:56:48,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-10-11 09:56:48,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 65 states have (on average 1.4153846153846155) internal successors, (92), 65 states have internal predecessors, (92), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-11 09:56:48,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 162 transitions. [2024-10-11 09:56:48,614 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 162 transitions. Word has length 218 [2024-10-11 09:56:48,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:56:48,616 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 162 transitions. [2024-10-11 09:56:48,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2024-10-11 09:56:48,617 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 162 transitions. [2024-10-11 09:56:48,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-10-11 09:56:48,623 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:56:48,623 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:56:48,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 09:56:48,624 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:56:48,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:56:48,626 INFO L85 PathProgramCache]: Analyzing trace with hash -2012128982, now seen corresponding path program 1 times [2024-10-11 09:56:48,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:56:48,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598960579] [2024-10-11 09:56:48,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:56:48,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:56:48,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:56:49,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:56:49,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:56:49,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:56:49,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:56:49,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:56:49,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:56:49,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:56:49,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:56:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:56:49,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:56:49,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:56:49,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:56:49,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:56:49,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 09:56:49,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 09:56:49,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:56:49,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 09:56:49,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:56:49,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 09:56:49,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 09:56:49,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 09:56:49,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 09:56:49,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 09:56:49,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 09:56:49,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 09:56:49,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 09:56:49,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 09:56:49,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 09:56:49,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 09:56:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 09:56:49,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-11 09:56:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-11 09:56:49,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-11 09:56:49,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-11 09:56:49,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-11 09:56:49,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:56:49,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598960579] [2024-10-11 09:56:49,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598960579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:56:49,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:56:49,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:56:49,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893876457] [2024-10-11 09:56:49,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:56:49,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:56:49,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:56:49,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:56:49,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:56:49,337 INFO L87 Difference]: Start difference. First operand 102 states and 162 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-11 09:56:49,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:56:49,459 INFO L93 Difference]: Finished difference Result 281 states and 450 transitions. [2024-10-11 09:56:49,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:56:49,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 218 [2024-10-11 09:56:49,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:56:49,466 INFO L225 Difference]: With dead ends: 281 [2024-10-11 09:56:49,466 INFO L226 Difference]: Without dead ends: 180 [2024-10-11 09:56:49,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:56:49,471 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 61 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:56:49,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 281 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 09:56:49,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-11 09:56:49,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 177. [2024-10-11 09:56:49,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 104 states have (on average 1.3653846153846154) internal successors, (142), 104 states have internal predecessors, (142), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-11 09:56:49,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 282 transitions. [2024-10-11 09:56:49,514 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 282 transitions. Word has length 218 [2024-10-11 09:56:49,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:56:49,515 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 282 transitions. [2024-10-11 09:56:49,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-11 09:56:49,515 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 282 transitions. [2024-10-11 09:56:49,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-10-11 09:56:49,519 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:56:49,522 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:56:49,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 09:56:49,522 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:56:49,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:56:49,523 INFO L85 PathProgramCache]: Analyzing trace with hash -232720883, now seen corresponding path program 1 times [2024-10-11 09:56:49,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:56:49,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609700605] [2024-10-11 09:56:49,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:56:49,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:56:49,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:56:49,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:56:49,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:56:49,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:56:49,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:56:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:56:49,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:56:49,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:56:49,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:56:49,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:56:49,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:56:49,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:56:49,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:56:49,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:56:49,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 09:56:49,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 09:56:49,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:56:49,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 09:56:49,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:56:49,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 09:56:49,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 09:56:49,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 09:56:49,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 09:56:49,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 09:56:49,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 09:56:49,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 09:56:49,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 09:56:49,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 09:56:49,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:49,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 09:56:50,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:50,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 09:56:50,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:50,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 09:56:50,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:50,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-11 09:56:50,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:50,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-11 09:56:50,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:50,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-11 09:56:50,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:50,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-11 09:56:50,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:50,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-11 09:56:50,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:56:50,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609700605] [2024-10-11 09:56:50,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609700605] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:56:50,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:56:50,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 09:56:50,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546029394] [2024-10-11 09:56:50,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:56:50,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 09:56:50,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:56:50,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 09:56:50,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:56:50,043 INFO L87 Difference]: Start difference. First operand 177 states and 282 transitions. 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, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-11 09:56:50,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:56:50,604 INFO L93 Difference]: Finished difference Result 378 states and 602 transitions. [2024-10-11 09:56:50,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 09:56:50,605 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, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 219 [2024-10-11 09:56:50,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:56:50,608 INFO L225 Difference]: With dead ends: 378 [2024-10-11 09:56:50,609 INFO L226 Difference]: Without dead ends: 277 [2024-10-11 09:56:50,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 09:56:50,610 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 210 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 09:56:50,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 627 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 09:56:50,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-10-11 09:56:50,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 181. [2024-10-11 09:56:50,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 108 states have (on average 1.3703703703703705) internal successors, (148), 108 states have internal predecessors, (148), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-11 09:56:50,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 288 transitions. [2024-10-11 09:56:50,652 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 288 transitions. Word has length 219 [2024-10-11 09:56:50,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:56:50,654 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 288 transitions. [2024-10-11 09:56:50,654 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, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-11 09:56:50,655 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 288 transitions. [2024-10-11 09:56:50,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-10-11 09:56:50,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:56:50,658 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:56:50,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 09:56:50,659 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:56:50,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:56:50,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1475829955, now seen corresponding path program 1 times [2024-10-11 09:56:50,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:56:50,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207940257] [2024-10-11 09:56:50,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:56:50,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:56:50,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:51,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:56:51,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:51,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:56:51,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:51,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:56:51,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:51,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:56:51,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:51,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:56:51,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:51,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:56:51,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:51,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:56:51,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:51,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:56:51,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:51,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:56:51,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:51,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:56:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:51,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:56:51,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:51,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:56:51,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:51,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:56:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:51,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:56:51,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:51,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 09:56:51,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:51,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 09:56:51,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:51,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:56:51,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:51,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 09:56:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:51,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:56:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:51,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 09:56:51,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:51,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 09:56:51,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:51,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 09:56:51,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:51,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 09:56:51,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:51,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 09:56:51,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:51,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 09:56:51,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:51,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 09:56:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:51,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 09:56:51,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:51,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 09:56:51,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:51,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 09:56:51,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:51,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 09:56:51,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:51,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 09:56:51,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:51,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-11 09:56:51,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:51,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-11 09:56:51,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:51,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-11 09:56:51,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:51,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-11 09:56:51,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:51,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-11 09:56:51,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:56:51,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207940257] [2024-10-11 09:56:51,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207940257] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:56:51,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:56:51,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 09:56:51,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035584939] [2024-10-11 09:56:51,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:56:51,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 09:56:51,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:56:51,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 09:56:51,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:56:51,177 INFO L87 Difference]: Start difference. First operand 181 states and 288 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, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-11 09:56:51,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:56:51,511 INFO L93 Difference]: Finished difference Result 418 states and 661 transitions. [2024-10-11 09:56:51,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 09:56:51,511 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, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 220 [2024-10-11 09:56:51,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:56:51,515 INFO L225 Difference]: With dead ends: 418 [2024-10-11 09:56:51,515 INFO L226 Difference]: Without dead ends: 303 [2024-10-11 09:56:51,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 73 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-11 09:56:51,516 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 161 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 09:56:51,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 546 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 09:56:51,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-10-11 09:56:51,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 282. [2024-10-11 09:56:51,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 173 states have (on average 1.3815028901734103) internal successors, (239), 173 states have internal predecessors, (239), 105 states have call successors, (105), 3 states have call predecessors, (105), 3 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2024-10-11 09:56:51,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 449 transitions. [2024-10-11 09:56:51,557 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 449 transitions. Word has length 220 [2024-10-11 09:56:51,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:56:51,558 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 449 transitions. [2024-10-11 09:56:51,558 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, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-11 09:56:51,559 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 449 transitions. [2024-10-11 09:56:51,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-10-11 09:56:51,578 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:56:51,578 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:56:51,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 09:56:51,579 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:56:51,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:56:51,579 INFO L85 PathProgramCache]: Analyzing trace with hash 745459529, now seen corresponding path program 1 times [2024-10-11 09:56:51,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:56:51,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126675897] [2024-10-11 09:56:51,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:56:51,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:56:51,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:52,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:56:52,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:52,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:56:52,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:52,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:56:52,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:52,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:56:52,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:52,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:56:52,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:52,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:56:52,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:52,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:56:52,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:52,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:56:52,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:52,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:56:52,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:52,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:56:52,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:52,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:56:52,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:52,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:56:52,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:52,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:56:52,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:52,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:56:52,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:52,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 09:56:52,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:52,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 09:56:52,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:52,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:56:52,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:52,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 09:56:52,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:52,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:56:52,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:52,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 09:56:52,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:52,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 09:56:52,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:52,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 09:56:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:52,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 09:56:52,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:52,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 09:56:52,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:52,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 09:56:52,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:52,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 09:56:52,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:52,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 09:56:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:52,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 09:56:52,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:52,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 09:56:52,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:52,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 09:56:52,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:52,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 09:56:52,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:52,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-11 09:56:52,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:52,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-11 09:56:52,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:52,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-11 09:56:52,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:52,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-11 09:56:52,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:52,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-11 09:56:52,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:56:52,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126675897] [2024-10-11 09:56:52,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126675897] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:56:52,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:56:52,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 09:56:52,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579161621] [2024-10-11 09:56:52,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:56:52,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 09:56:52,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:56:52,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 09:56:52,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 09:56:52,767 INFO L87 Difference]: Start difference. First operand 282 states and 449 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-11 09:56:53,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:56:53,145 INFO L93 Difference]: Finished difference Result 546 states and 863 transitions. [2024-10-11 09:56:53,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 09:56:53,146 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 221 [2024-10-11 09:56:53,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:56:53,149 INFO L225 Difference]: With dead ends: 546 [2024-10-11 09:56:53,149 INFO L226 Difference]: Without dead ends: 324 [2024-10-11 09:56:53,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 09:56:53,151 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 105 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 09:56:53,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 583 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 09:56:53,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-10-11 09:56:53,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 308. [2024-10-11 09:56:53,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 199 states have (on average 1.3919597989949748) internal successors, (277), 199 states have internal predecessors, (277), 105 states have call successors, (105), 3 states have call predecessors, (105), 3 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2024-10-11 09:56:53,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 487 transitions. [2024-10-11 09:56:53,210 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 487 transitions. Word has length 221 [2024-10-11 09:56:53,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:56:53,211 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 487 transitions. [2024-10-11 09:56:53,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-11 09:56:53,212 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 487 transitions. [2024-10-11 09:56:53,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-10-11 09:56:53,214 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:56:53,214 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:56:53,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 09:56:53,214 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:56:53,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:56:53,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1259134674, now seen corresponding path program 1 times [2024-10-11 09:56:53,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:56:53,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382182734] [2024-10-11 09:56:53,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:56:53,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:56:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:53,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:56:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:53,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:56:53,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:53,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:56:53,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:53,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:56:53,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:53,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:56:53,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:53,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:56:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:53,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:56:53,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:53,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:56:53,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:53,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:56:53,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:53,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:56:53,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:53,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:56:53,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:53,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:56:53,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:53,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:56:53,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:53,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:56:53,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:53,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 09:56:53,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:53,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 09:56:53,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:53,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:56:53,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:53,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 09:56:53,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:53,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:56:53,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:53,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 09:56:53,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:53,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 09:56:53,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:53,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 09:56:53,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:53,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 09:56:53,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:53,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 09:56:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:53,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 09:56:53,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:53,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 09:56:53,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:53,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 09:56:53,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:53,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 09:56:53,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:53,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 09:56:53,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:53,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 09:56:53,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:53,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 09:56:53,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:53,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-11 09:56:53,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:53,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-11 09:56:53,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:53,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-11 09:56:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:53,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-11 09:56:53,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:53,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 24 proven. 78 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2024-10-11 09:56:53,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:56:53,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382182734] [2024-10-11 09:56:53,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382182734] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:56:53,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729332815] [2024-10-11 09:56:53,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:56:53,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:56:53,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:56:53,882 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:56:53,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 09:56:54,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:54,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 09:56:54,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:56:55,441 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 910 proven. 150 refuted. 0 times theorem prover too weak. 1320 trivial. 0 not checked. [2024-10-11 09:56:55,442 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:56:56,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 48 proven. 153 refuted. 0 times theorem prover too weak. 2179 trivial. 0 not checked. [2024-10-11 09:56:56,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729332815] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 09:56:56,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 09:56:56,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 10] total 21 [2024-10-11 09:56:56,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014308444] [2024-10-11 09:56:56,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 09:56:56,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 09:56:56,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:56:56,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 09:56:56,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2024-10-11 09:56:56,355 INFO L87 Difference]: Start difference. First operand 308 states and 487 transitions. Second operand has 21 states, 20 states have (on average 5.8) internal successors, (116), 20 states have internal predecessors, (116), 6 states have call successors, (105), 4 states have call predecessors, (105), 8 states have return successors, (105), 6 states have call predecessors, (105), 6 states have call successors, (105) [2024-10-11 09:56:58,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:56:58,013 INFO L93 Difference]: Finished difference Result 646 states and 1005 transitions. [2024-10-11 09:56:58,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 09:56:58,014 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 5.8) internal successors, (116), 20 states have internal predecessors, (116), 6 states have call successors, (105), 4 states have call predecessors, (105), 8 states have return successors, (105), 6 states have call predecessors, (105), 6 states have call successors, (105) Word has length 223 [2024-10-11 09:56:58,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:56:58,020 INFO L225 Difference]: With dead ends: 646 [2024-10-11 09:56:58,020 INFO L226 Difference]: Without dead ends: 406 [2024-10-11 09:56:58,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 503 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=384, Invalid=948, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 09:56:58,023 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 557 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 1222 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 1579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 1222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 09:56:58,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 726 Invalid, 1579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 1222 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 09:56:58,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2024-10-11 09:56:58,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 318. [2024-10-11 09:56:58,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 207 states have (on average 1.3719806763285025) internal successors, (284), 207 states have internal predecessors, (284), 105 states have call successors, (105), 5 states have call predecessors, (105), 5 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2024-10-11 09:56:58,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 494 transitions. [2024-10-11 09:56:58,099 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 494 transitions. Word has length 223 [2024-10-11 09:56:58,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:56:58,100 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 494 transitions. [2024-10-11 09:56:58,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 5.8) internal successors, (116), 20 states have internal predecessors, (116), 6 states have call successors, (105), 4 states have call predecessors, (105), 8 states have return successors, (105), 6 states have call predecessors, (105), 6 states have call successors, (105) [2024-10-11 09:56:58,100 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 494 transitions. [2024-10-11 09:56:58,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-10-11 09:56:58,102 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:56:58,103 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:56:58,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 09:56:58,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:56:58,305 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:56:58,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:56:58,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1475491204, now seen corresponding path program 1 times [2024-10-11 09:56:58,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:56:58,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752216147] [2024-10-11 09:56:58,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:56:58,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:56:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:58,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:56:58,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:58,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:56:58,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:58,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:56:58,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:58,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:56:58,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:58,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:56:58,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:58,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:56:58,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:58,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:56:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:58,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:56:58,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:58,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:56:58,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:58,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:56:58,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:58,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:56:58,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:58,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:56:58,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:58,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:56:58,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:58,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:56:58,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:58,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 09:56:58,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:58,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 09:56:58,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:58,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:56:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:58,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 09:56:58,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:58,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:56:58,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:58,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 09:56:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:58,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 09:56:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:58,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 09:56:58,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:58,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 09:56:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:58,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 09:56:58,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:58,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 09:56:58,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:58,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 09:56:58,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:58,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 09:56:58,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:58,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 09:56:58,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:58,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 09:56:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:58,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 09:56:58,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:58,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 09:56:58,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:58,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-11 09:56:58,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:58,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-11 09:56:58,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:58,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-11 09:56:58,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:58,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-10-11 09:56:58,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:56:58,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-11 09:56:58,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:56:58,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752216147] [2024-10-11 09:56:58,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752216147] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:56:58,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:56:58,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:56:58,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587153992] [2024-10-11 09:56:58,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:56:58,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:56:58,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:56:58,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:56:58,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:56:58,645 INFO L87 Difference]: Start difference. First operand 318 states and 494 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-11 09:56:58,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:56:58,740 INFO L93 Difference]: Finished difference Result 799 states and 1255 transitions. [2024-10-11 09:56:58,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:56:58,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 224 [2024-10-11 09:56:58,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:56:58,745 INFO L225 Difference]: With dead ends: 799 [2024-10-11 09:56:58,745 INFO L226 Difference]: Without dead ends: 559 [2024-10-11 09:56:58,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:56:58,747 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 100 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:56:58,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 360 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 09:56:58,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2024-10-11 09:56:58,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 557. [2024-10-11 09:56:58,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 374 states have (on average 1.393048128342246) internal successors, (521), 374 states have internal predecessors, (521), 175 states have call successors, (175), 7 states have call predecessors, (175), 7 states have return successors, (175), 175 states have call predecessors, (175), 175 states have call successors, (175) [2024-10-11 09:56:58,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 871 transitions. [2024-10-11 09:56:58,841 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 871 transitions. Word has length 224 [2024-10-11 09:56:58,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:56:58,841 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 871 transitions. [2024-10-11 09:56:58,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-11 09:56:58,842 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 871 transitions. [2024-10-11 09:56:58,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-10-11 09:56:58,844 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:56:58,844 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:56:58,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 09:56:58,844 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:56:58,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:56:58,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1836740405, now seen corresponding path program 1 times [2024-10-11 09:56:58,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:56:58,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642135810] [2024-10-11 09:56:58,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:56:58,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:56:58,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 09:56:58,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [986691236] [2024-10-11 09:56:58,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:56:58,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:56:58,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:56:58,972 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:56:58,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 09:56:59,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 09:56:59,123 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 09:56:59,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 09:56:59,372 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 09:56:59,373 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 09:56:59,374 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 09:56:59,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 09:56:59,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:56:59,580 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:56:59,766 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 09:56:59,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 09:56:59 BoogieIcfgContainer [2024-10-11 09:56:59,771 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 09:56:59,772 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 09:56:59,772 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 09:56:59,772 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 09:56:59,773 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:56:47" (3/4) ... [2024-10-11 09:56:59,774 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 09:56:59,775 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 09:56:59,776 INFO L158 Benchmark]: Toolchain (without parser) took 13346.87ms. Allocated memory was 186.6MB in the beginning and 408.9MB in the end (delta: 222.3MB). Free memory was 149.7MB in the beginning and 352.0MB in the end (delta: -202.3MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2024-10-11 09:56:59,776 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 186.6MB. Free memory is still 151.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 09:56:59,776 INFO L158 Benchmark]: CACSL2BoogieTranslator took 417.10ms. Allocated memory is still 186.6MB. Free memory was 149.5MB in the beginning and 141.1MB in the end (delta: 8.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 09:56:59,777 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.63ms. Allocated memory is still 186.6MB. Free memory was 141.1MB in the beginning and 136.0MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 09:56:59,777 INFO L158 Benchmark]: Boogie Preprocessor took 59.46ms. Allocated memory is still 186.6MB. Free memory was 136.0MB in the beginning and 129.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 09:56:59,777 INFO L158 Benchmark]: RCFGBuilder took 800.61ms. Allocated memory is still 186.6MB. Free memory was 129.7MB in the beginning and 122.5MB in the end (delta: 7.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 09:56:59,778 INFO L158 Benchmark]: TraceAbstraction took 11992.92ms. Allocated memory was 186.6MB in the beginning and 408.9MB in the end (delta: 222.3MB). Free memory was 122.5MB in the beginning and 352.0MB in the end (delta: -229.5MB). Peak memory consumption was 174.1MB. Max. memory is 16.1GB. [2024-10-11 09:56:59,778 INFO L158 Benchmark]: Witness Printer took 3.78ms. Allocated memory is still 408.9MB. Free memory is still 352.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 09:56:59,780 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 186.6MB. Free memory is still 151.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 417.10ms. Allocated memory is still 186.6MB. Free memory was 149.5MB in the beginning and 141.1MB in the end (delta: 8.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.63ms. Allocated memory is still 186.6MB. Free memory was 141.1MB in the beginning and 136.0MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.46ms. Allocated memory is still 186.6MB. Free memory was 136.0MB in the beginning and 129.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 800.61ms. Allocated memory is still 186.6MB. Free memory was 129.7MB in the beginning and 122.5MB in the end (delta: 7.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 11992.92ms. Allocated memory was 186.6MB in the beginning and 408.9MB in the end (delta: 222.3MB). Free memory was 122.5MB in the beginning and 352.0MB in the end (delta: -229.5MB). Peak memory consumption was 174.1MB. Max. memory is 16.1GB. * Witness Printer took 3.78ms. Allocated memory is still 408.9MB. Free memory is still 352.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 205, overapproximation of bitwiseOr at line 82, overapproximation of shiftRight at line 90. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 100; [L23] unsigned char var_1_6 = 0; [L24] unsigned char var_1_7 = 0; [L25] unsigned short int var_1_8 = 10; [L26] unsigned short int var_1_9 = 0; [L27] unsigned short int var_1_10 = 53946; [L28] unsigned short int var_1_11 = 1; [L29] unsigned long int var_1_12 = 8; [L30] double var_1_13 = 8.25; [L31] signed long int var_1_14 = -256; [L32] double var_1_15 = 0.19999999999999996; [L33] signed long int var_1_16 = -16; [L34] signed char var_1_17 = 1; [L35] signed char var_1_18 = 4; [L36] signed char var_1_19 = 64; [L37] signed long int var_1_20 = 1; [L38] signed long int var_1_21 = 1000000000; [L39] unsigned char var_1_23 = 4; [L40] unsigned char var_1_26 = 0; [L41] unsigned char var_1_27 = 5; [L42] unsigned short int var_1_28 = 16; [L43] unsigned short int var_1_29 = 200; [L44] signed short int var_1_30 = -256; [L45] signed short int var_1_32 = 8; [L46] unsigned short int var_1_33 = 128; [L47] double var_1_34 = 0.25; [L48] double var_1_35 = 5.75; [L49] signed long int var_1_36 = -32; [L50] unsigned char var_1_37 = 1; [L51] unsigned char var_1_38 = 0; [L52] unsigned char var_1_39 = 1; [L53] float var_1_40 = 2.6; [L54] unsigned char var_1_41 = 0; [L55] unsigned char var_1_42 = 0; [L56] unsigned short int last_1_var_1_1 = 100; [L57] unsigned long int last_1_var_1_12 = 8; [L58] double last_1_var_1_13 = 8.25; [L59] signed long int last_1_var_1_16 = -16; [L209] isInitial = 1 [L210] FCALL initially() [L211] COND TRUE 1 [L212] CALL updateLastVariables() [L199] last_1_var_1_1 = var_1_1 [L200] last_1_var_1_12 = var_1_12 [L201] last_1_var_1_13 = var_1_13 [L202] last_1_var_1_16 = var_1_16 [L212] RET updateLastVariables() [L213] CALL updateVariables() [L144] var_1_6 = __VERIFIER_nondet_uchar() [L145] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_7=0, var_1_8=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_7=0, var_1_8=10, var_1_9=0] [L145] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_7=0, var_1_8=10, var_1_9=0] [L146] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=0, var_1_8=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=0, var_1_8=10, var_1_9=0] [L146] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=0, var_1_8=10, var_1_9=0] [L147] var_1_7 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_8=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_8=10, var_1_9=0] [L148] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_8=10, var_1_9=0] [L149] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=10, var_1_9=0] [L149] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=10, var_1_9=0] [L150] var_1_8 = __VERIFIER_nondet_ushort() [L151] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_9=0] [L151] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_9=0] [L152] CALL assume_abort_if_not(var_1_8 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L152] RET assume_abort_if_not(var_1_8 <= 65534) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L153] var_1_9 = __VERIFIER_nondet_ushort() [L154] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1] [L154] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1] [L155] CALL assume_abort_if_not(var_1_9 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L155] RET assume_abort_if_not(var_1_9 <= 65534) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L156] var_1_10 = __VERIFIER_nondet_ushort() [L157] CALL assume_abort_if_not(var_1_10 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L157] RET assume_abort_if_not(var_1_10 >= 32767) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L158] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L158] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L159] var_1_11 = __VERIFIER_nondet_ushort() [L160] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L160] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L161] CALL assume_abort_if_not(var_1_11 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L161] RET assume_abort_if_not(var_1_11 <= 32767) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L162] var_1_14 = __VERIFIER_nondet_long() [L163] CALL assume_abort_if_not(var_1_14 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L163] RET assume_abort_if_not(var_1_14 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L164] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L164] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L165] CALL assume_abort_if_not(var_1_14 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L165] RET assume_abort_if_not(var_1_14 != 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L166] var_1_15 = __VERIFIER_nondet_double() [L167] 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=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L167] 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=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L168] var_1_18 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L169] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L170] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L170] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L171] var_1_19 = __VERIFIER_nondet_char() [L172] CALL assume_abort_if_not(var_1_19 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L172] RET assume_abort_if_not(var_1_19 >= 63) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L173] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L173] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L174] var_1_21 = __VERIFIER_nondet_long() [L175] CALL assume_abort_if_not(var_1_21 >= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L175] RET assume_abort_if_not(var_1_21 >= 536870911) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L176] CALL assume_abort_if_not(var_1_21 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L176] RET assume_abort_if_not(var_1_21 <= 1073741823) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L177] var_1_26 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L178] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L179] CALL assume_abort_if_not(var_1_26 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-255, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-255, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L179] RET assume_abort_if_not(var_1_26 <= 64) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-255, var_1_27=5, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L180] var_1_27 = __VERIFIER_nondet_uchar() [L181] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-255, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-255, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L181] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-255, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L182] CALL assume_abort_if_not(var_1_27 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-255, var_1_27=0, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-255, var_1_27=0, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L182] RET assume_abort_if_not(var_1_27 <= 127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-255, var_1_27=0, var_1_28=16, var_1_29=200, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L183] var_1_29 = __VERIFIER_nondet_ushort() [L184] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-255, var_1_27=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-255, var_1_27=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L184] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-255, var_1_27=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L185] CALL assume_abort_if_not(var_1_29 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-255, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-255, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L185] RET assume_abort_if_not(var_1_29 <= 65534) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-255, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_35=23/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L186] var_1_35 = __VERIFIER_nondet_double() [L187] CALL assume_abort_if_not((var_1_35 >= -922337.2036854765600e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854765600e+12F && var_1_35 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-255, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-255, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L187] RET assume_abort_if_not((var_1_35 >= -922337.2036854765600e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854765600e+12F && var_1_35 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-255, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=1, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L188] var_1_37 = __VERIFIER_nondet_uchar() [L189] CALL assume_abort_if_not(var_1_37 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-255, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-255, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L189] RET assume_abort_if_not(var_1_37 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-255, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L190] CALL assume_abort_if_not(var_1_37 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-255, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=-255, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-255, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=-255, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L190] RET assume_abort_if_not(var_1_37 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-255, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=-255, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L191] var_1_39 = __VERIFIER_nondet_uchar() [L192] CALL assume_abort_if_not(var_1_39 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-255, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=-255, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-255, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=-255, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L192] RET assume_abort_if_not(var_1_39 >= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-255, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=-255, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L193] CALL assume_abort_if_not(var_1_39 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-255, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=-255, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-255, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=-255, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L193] RET assume_abort_if_not(var_1_39 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-255, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=-255, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L194] var_1_42 = __VERIFIER_nondet_uchar() [L195] CALL assume_abort_if_not(var_1_42 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-255, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=-255, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-255, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=-255, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L195] RET assume_abort_if_not(var_1_42 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-255, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=-255, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L196] CALL assume_abort_if_not(var_1_42 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-255, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=-255, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-255, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=-255, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L196] RET assume_abort_if_not(var_1_42 <= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-255, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=-255, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L213] RET updateVariables() [L214] CALL step() [L63] unsigned char stepLocal_0 = last_1_var_1_13 >= last_1_var_1_13; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_0=1, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-255, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=-255, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L64] COND FALSE !((last_1_var_1_12 == last_1_var_1_1) && stepLocal_0) [L75] var_1_1 = var_1_10 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=32767, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-255, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=-255, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L77] EXPR ((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=32767, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-255, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=-255, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L77] COND TRUE (((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10) >= last_1_var_1_16 [L78] COND TRUE \read(var_1_7) [L79] var_1_12 = var_1_10 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=32767, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-255, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=-255, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L82] EXPR var_1_20 | var_1_12 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=32767, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-255, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=-255, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L82] COND TRUE (~ (var_1_20 | var_1_12)) >= (~ (~ 32)) [L83] var_1_32 = var_1_27 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=32767, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-255, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=0, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=-255, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L85] COND FALSE !(((var_1_17 - var_1_27) > var_1_20) && var_1_37) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=5, var_1_19=63, var_1_1=32767, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-255, var_1_27=0, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=0, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=-255, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L88] var_1_17 = (4 - ((((var_1_18) < ((var_1_19 - 1))) ? (var_1_18) : ((var_1_19 - 1))))) [L89] var_1_28 = var_1_29 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=-1, var_1_18=5, var_1_19=63, var_1_1=32767, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-256, var_1_32=0, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=-255, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L90] EXPR var_1_20 >> var_1_16 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=-1, var_1_18=5, var_1_19=63, var_1_1=32767, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-256, var_1_32=0, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_37=-255, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L90] COND FALSE !((var_1_20 >> var_1_16) <= var_1_17) [L95] var_1_40 = var_1_35 [L96] unsigned long int stepLocal_4 = var_1_12; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_4=32767, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=-1, var_1_18=5, var_1_19=63, var_1_1=32767, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-256, var_1_32=0, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=-32, var_1_37=-255, var_1_38=0, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L97] COND TRUE \read(var_1_6) [L98] var_1_20 = ((var_1_8 - (var_1_21 - var_1_11)) + var_1_10) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_4=32767, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=-1, var_1_18=5, var_1_19=63, var_1_1=32767, var_1_20=-536838143, var_1_21=536870911, var_1_23=4, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-256, var_1_32=0, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=-32, var_1_37=-255, var_1_38=0, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L106] COND FALSE !((var_1_16 + var_1_17) > 16) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_4=32767, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=-1, var_1_18=5, var_1_19=63, var_1_1=32767, var_1_20=-536838143, var_1_21=536870911, var_1_23=4, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-256, var_1_32=0, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=-32, var_1_37=-255, var_1_38=0, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L109] COND TRUE (~ var_1_17) <= var_1_27 [L110] var_1_23 = var_1_27 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_4=32767, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=-1, var_1_18=5, var_1_19=63, var_1_1=32767, var_1_20=-536838143, var_1_21=536870911, var_1_23=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-256, var_1_32=0, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=-32, var_1_37=-255, var_1_38=0, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L115] var_1_38 = var_1_39 [L116] unsigned char stepLocal_3 = var_1_6; [L117] unsigned char stepLocal_2 = var_1_6; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_2=1, stepLocal_3=1, stepLocal_4=32767, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=-1, var_1_18=5, var_1_19=63, var_1_1=32767, var_1_20=-536838143, var_1_21=536870911, var_1_23=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-256, var_1_32=0, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=-32, var_1_37=-255, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L118] COND FALSE !(stepLocal_2 && (var_1_9 < (var_1_10 + var_1_20))) [L123] var_1_16 = var_1_8 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_3=1, stepLocal_4=32767, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=33/4, var_1_14=-1, var_1_16=1, var_1_17=-1, var_1_18=5, var_1_19=63, var_1_1=32767, var_1_20=-536838143, var_1_21=536870911, var_1_23=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-256, var_1_32=0, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=-32, var_1_37=-255, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L125] COND FALSE !(var_1_17 >= var_1_1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_3=1, stepLocal_4=32767, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=33/4, var_1_14=-1, var_1_16=1, var_1_17=-1, var_1_18=5, var_1_19=63, var_1_1=32767, var_1_20=-536838143, var_1_21=536870911, var_1_23=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-256, var_1_32=0, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=-32, var_1_37=-255, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L130] signed long int stepLocal_1 = ((((var_1_10) < (var_1_1)) ? (var_1_10) : (var_1_1))) + (var_1_9 % var_1_14); VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_1=32767, stepLocal_3=1, stepLocal_4=32767, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=33/4, var_1_14=-1, var_1_16=1, var_1_17=-1, var_1_18=5, var_1_19=63, var_1_1=32767, var_1_20=-536838143, var_1_21=536870911, var_1_23=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-256, var_1_32=0, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=-32, var_1_37=-255, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L131] COND TRUE stepLocal_1 >= ((((var_1_16) < (var_1_8)) ? (var_1_16) : (var_1_8))) [L132] var_1_13 = var_1_15 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_3=1, stepLocal_4=32767, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=3, var_1_14=-1, var_1_15=3, var_1_16=1, var_1_17=-1, var_1_18=5, var_1_19=63, var_1_1=32767, var_1_20=-536838143, var_1_21=536870911, var_1_23=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=-256, var_1_32=0, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=-32, var_1_37=-255, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L136] COND TRUE var_1_16 < 2 [L137] var_1_30 = (((((((((var_1_26) > (var_1_27)) ? (var_1_26) : (var_1_27)))) > (var_1_16)) ? (((((var_1_26) > (var_1_27)) ? (var_1_26) : (var_1_27)))) : (var_1_16))) + var_1_17) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_3=1, stepLocal_4=32767, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=3, var_1_14=-1, var_1_15=3, var_1_16=1, var_1_17=-1, var_1_18=5, var_1_19=63, var_1_1=32767, var_1_20=-536838143, var_1_21=536870911, var_1_23=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_32=0, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=-32, var_1_37=-255, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L141] var_1_41 = var_1_42 [L214] RET step() [L215] CALL, EXPR property() [L205] EXPR (((last_1_var_1_12 == last_1_var_1_1) && (last_1_var_1_13 >= last_1_var_1_13)) ? (var_1_6 ? (var_1_7 ? (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((unsigned short int) ((((var_1_9) > (var_1_8)) ? (var_1_9) : (var_1_8)))))) : (var_1_1 == ((unsigned short int) (((((46167) > (var_1_10)) ? (46167) : (var_1_10))) - var_1_11)))) : (var_1_1 == ((unsigned short int) var_1_10))) && (((((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10) >= last_1_var_1_16) ? (var_1_7 ? (var_1_12 == ((unsigned long int) var_1_10)) : 1) : 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=3, var_1_14=-1, var_1_15=3, var_1_16=1, var_1_17=-1, var_1_18=5, var_1_19=63, var_1_1=32767, var_1_20=-536838143, var_1_21=536870911, var_1_23=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_32=0, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=-32, var_1_37=-255, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L205] EXPR ((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=3, var_1_14=-1, var_1_15=3, var_1_16=1, var_1_17=-1, var_1_18=5, var_1_19=63, var_1_1=32767, var_1_20=-536838143, var_1_21=536870911, var_1_23=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_32=0, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=-32, var_1_37=-255, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L205] EXPR (((last_1_var_1_12 == last_1_var_1_1) && (last_1_var_1_13 >= last_1_var_1_13)) ? (var_1_6 ? (var_1_7 ? (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((unsigned short int) ((((var_1_9) > (var_1_8)) ? (var_1_9) : (var_1_8)))))) : (var_1_1 == ((unsigned short int) (((((46167) > (var_1_10)) ? (46167) : (var_1_10))) - var_1_11)))) : (var_1_1 == ((unsigned short int) var_1_10))) && (((((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10) >= last_1_var_1_16) ? (var_1_7 ? (var_1_12 == ((unsigned long int) var_1_10)) : 1) : 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=3, var_1_14=-1, var_1_15=3, var_1_16=1, var_1_17=-1, var_1_18=5, var_1_19=63, var_1_1=32767, var_1_20=-536838143, var_1_21=536870911, var_1_23=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_32=0, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=-32, var_1_37=-255, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L205-L206] return (((((((last_1_var_1_12 == last_1_var_1_1) && (last_1_var_1_13 >= last_1_var_1_13)) ? (var_1_6 ? (var_1_7 ? (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((unsigned short int) ((((var_1_9) > (var_1_8)) ? (var_1_9) : (var_1_8)))))) : (var_1_1 == ((unsigned short int) (((((46167) > (var_1_10)) ? (46167) : (var_1_10))) - var_1_11)))) : (var_1_1 == ((unsigned short int) var_1_10))) && (((((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10) >= last_1_var_1_16) ? (var_1_7 ? (var_1_12 == ((unsigned long int) var_1_10)) : 1) : 1)) && (((((((var_1_10) < (var_1_1)) ? (var_1_10) : (var_1_1))) + (var_1_9 % var_1_14)) >= ((((var_1_16) < (var_1_8)) ? (var_1_16) : (var_1_8)))) ? (var_1_13 == ((double) var_1_15)) : (var_1_13 == ((double) var_1_15)))) && ((var_1_6 && (var_1_9 < (var_1_10 + var_1_20))) ? ((var_1_7 && var_1_6) ? (var_1_16 == ((signed long int) var_1_10)) : 1) : (var_1_16 == ((signed long int) var_1_8)))) && (var_1_17 == ((signed char) (4 - ((((var_1_18) < ((var_1_19 - 1))) ? (var_1_18) : ((var_1_19 - 1)))))))) && (var_1_6 ? (var_1_20 == ((signed long int) ((var_1_8 - (var_1_21 - var_1_11)) + var_1_10))) : (((~ var_1_19) == var_1_12) ? (var_1_20 == ((signed long int) var_1_1)) : (var_1_20 == ((signed long int) var_1_10)))) ; [L215] RET, EXPR property() [L215] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=3, var_1_14=-1, var_1_15=3, var_1_16=1, var_1_17=-1, var_1_18=5, var_1_19=63, var_1_1=32767, var_1_20=-536838143, var_1_21=536870911, var_1_23=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_32=0, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=-32, var_1_37=-255, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=0, var_1_12=32767, var_1_13=3, var_1_14=-1, var_1_15=3, var_1_16=1, var_1_17=-1, var_1_18=5, var_1_19=63, var_1_1=32767, var_1_20=-536838143, var_1_21=536870911, var_1_23=0, var_1_26=-255, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_32=0, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=-32, var_1_37=-255, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 104 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.7s, OverallIterations: 8, TraceHistogramMax: 35, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1195 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1194 mSDsluCounter, 3281 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2088 mSDsCounter, 572 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2042 IncrementalHoareTripleChecker+Invalid, 2614 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 572 mSolverCounterUnsat, 1193 mSDtfsCounter, 2042 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1027 GetRequests, 973 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=557occurred in iteration=7, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 7 MinimizatonAttempts, 226 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 2216 NumberOfCodeBlocks, 2216 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1980 ConstructedInterpolants, 0 QuantifiedInterpolants, 10688 SizeOfPredicates, 4 NumberOfNonLiveVariables, 514 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 21039/21420 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-11 09:56:59,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-92.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 adcde90e8b053d99359c11706230b2ebf7c2fa95333a62c210d892627b4fe438 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:57:02,033 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:57:02,112 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 09:57:02,118 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:57:02,119 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:57:02,153 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:57:02,154 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:57:02,155 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:57:02,156 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:57:02,157 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:57:02,158 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:57:02,158 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:57:02,159 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:57:02,159 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:57:02,159 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:57:02,162 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:57:02,162 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:57:02,163 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:57:02,163 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:57:02,163 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:57:02,163 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:57:02,164 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:57:02,164 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:57:02,164 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 09:57:02,165 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 09:57:02,166 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:57:02,166 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 09:57:02,167 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:57:02,167 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:57:02,167 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:57:02,167 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:57:02,168 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:57:02,168 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:57:02,168 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:57:02,168 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:57:02,169 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:57:02,169 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:57:02,170 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:57:02,170 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 09:57:02,171 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 09:57:02,171 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:57:02,171 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:57:02,171 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:57:02,171 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:57:02,172 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 09:57:02,172 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-clean/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-clean/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 -> adcde90e8b053d99359c11706230b2ebf7c2fa95333a62c210d892627b4fe438 [2024-10-11 09:57:02,519 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:57:02,545 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:57:02,549 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:57:02,551 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:57:02,551 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:57:02,554 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-92.i [2024-10-11 09:57:04,178 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:57:04,433 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:57:04,437 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-92.i [2024-10-11 09:57:04,452 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3827bf5a6/a111e7de46fb41b885090b55907ae083/FLAG42d97128f [2024-10-11 09:57:04,470 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3827bf5a6/a111e7de46fb41b885090b55907ae083 [2024-10-11 09:57:04,472 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:57:04,474 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:57:04,475 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:57:04,476 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:57:04,481 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:57:04,482 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:57:04" (1/1) ... [2024-10-11 09:57:04,483 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60075ad0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:57:04, skipping insertion in model container [2024-10-11 09:57:04,483 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:57:04" (1/1) ... [2024-10-11 09:57:04,516 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:57:04,705 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-pr-co_file-92.i[919,932] [2024-10-11 09:57:04,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:57:04,823 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:57:04,835 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-pr-co_file-92.i[919,932] [2024-10-11 09:57:04,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:57:04,898 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:57:04,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:57:04 WrapperNode [2024-10-11 09:57:04,899 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:57:04,900 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:57:04,900 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:57:04,901 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:57:04,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:57:04" (1/1) ... [2024-10-11 09:57:04,926 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:57:04" (1/1) ... [2024-10-11 09:57:04,965 INFO L138 Inliner]: procedures = 27, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 215 [2024-10-11 09:57:04,969 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:57:04,970 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:57:04,970 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:57:04,971 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:57:04,981 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:57:04" (1/1) ... [2024-10-11 09:57:04,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:57:04" (1/1) ... [2024-10-11 09:57:04,989 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:57:04" (1/1) ... [2024-10-11 09:57:05,012 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-11 09:57:05,016 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:57:04" (1/1) ... [2024-10-11 09:57:05,017 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:57:04" (1/1) ... [2024-10-11 09:57:05,029 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:57:04" (1/1) ... [2024-10-11 09:57:05,036 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:57:04" (1/1) ... [2024-10-11 09:57:05,042 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:57:04" (1/1) ... [2024-10-11 09:57:05,052 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:57:04" (1/1) ... [2024-10-11 09:57:05,056 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:57:05,057 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:57:05,060 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:57:05,060 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:57:05,061 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:57:04" (1/1) ... [2024-10-11 09:57:05,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:57:05,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:57:05,099 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 09:57:05,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 09:57:05,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:57:05,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 09:57:05,148 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:57:05,148 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:57:05,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:57:05,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:57:05,269 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:57:05,271 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:57:05,743 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-11 09:57:05,743 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:57:05,816 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:57:05,816 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 09:57:05,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:57:05 BoogieIcfgContainer [2024-10-11 09:57:05,817 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:57:05,823 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:57:05,823 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:57:05,826 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:57:05,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:57:04" (1/3) ... [2024-10-11 09:57:05,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7becd4de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:57:05, skipping insertion in model container [2024-10-11 09:57:05,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:57:04" (2/3) ... [2024-10-11 09:57:05,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7becd4de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:57:05, skipping insertion in model container [2024-10-11 09:57:05,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:57:05" (3/3) ... [2024-10-11 09:57:05,831 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-92.i [2024-10-11 09:57:05,848 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:57:05,848 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:57:05,920 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:57:05,929 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;@6d600f26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:57:05,930 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:57:05,933 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 52 states have internal predecessors, (75), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-11 09:57:05,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-11 09:57:05,948 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:57:05,949 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:57:05,950 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:57:05,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:57:05,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1244991484, now seen corresponding path program 1 times [2024-10-11 09:57:05,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:57:05,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1339557442] [2024-10-11 09:57:05,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:57:05,977 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-11 09:57:05,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:57:05,980 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-11 09:57:05,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 09:57:06,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:06,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 09:57:06,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:57:06,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1124 proven. 0 refuted. 0 times theorem prover too weak. 1256 trivial. 0 not checked. [2024-10-11 09:57:06,379 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:57:06,380 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:57:06,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1339557442] [2024-10-11 09:57:06,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1339557442] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:57:06,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:57:06,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:57:06,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162000151] [2024-10-11 09:57:06,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:57:06,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 09:57:06,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:57:06,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 09:57:06,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:57:06,421 INFO L87 Difference]: Start difference. First operand has 89 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 52 states have internal predecessors, (75), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-10-11 09:57:06,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:57:06,489 INFO L93 Difference]: Finished difference Result 175 states and 323 transitions. [2024-10-11 09:57:06,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 09:57:06,494 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 213 [2024-10-11 09:57:06,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:57:06,504 INFO L225 Difference]: With dead ends: 175 [2024-10-11 09:57:06,505 INFO L226 Difference]: Without dead ends: 87 [2024-10-11 09:57:06,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 212 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-11 09:57:06,514 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 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.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:57:06,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 09:57:06,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-11 09:57:06,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-11 09:57:06,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 50 states have (on average 1.38) internal successors, (69), 50 states have internal predecessors, (69), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-11 09:57:06,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 139 transitions. [2024-10-11 09:57:06,572 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 139 transitions. Word has length 213 [2024-10-11 09:57:06,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:57:06,572 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 139 transitions. [2024-10-11 09:57:06,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-10-11 09:57:06,573 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 139 transitions. [2024-10-11 09:57:06,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-11 09:57:06,577 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:57:06,577 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:57:06,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 09:57:06,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-11 09:57:06,779 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:57:06,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:57:06,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1121712010, now seen corresponding path program 1 times [2024-10-11 09:57:06,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:57:06,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1222942823] [2024-10-11 09:57:06,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:57:06,781 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-11 09:57:06,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:57:06,783 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-11 09:57:06,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 09:57:07,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:57:07,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 09:57:07,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:57:08,470 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:57:08,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1222942823] [2024-10-11 09:57:08,471 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-10-11 09:57:08,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 09:57:08,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-11 09:57:08,677 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of int range at java.base/java.math.BigInteger.intValueExact(BigInteger.java:4784) at de.uni_freiburg.informatik.ultimate.util.datastructures.BitvectorConstant.lambda$25(BitvectorConstant.java:481) at de.uni_freiburg.informatik.ultimate.util.datastructures.BitvectorConstant.similarIndexBvOp_BitvectorResult(BitvectorConstant.java:495) at de.uni_freiburg.informatik.ultimate.util.datastructures.BitvectorConstant.bvashr(BitvectorConstant.java:480) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.BitvectorUtils.lambda$19(BitvectorUtils.java:224) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.BitvectorUtils$RegularBitvectorOperation_BitvectorResult.simplify_ConstantCase(BitvectorUtils.java:522) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.BitvectorUtils$BitvectorOperation.simplifiedResult(BitvectorUtils.java:289) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.BitvectorUtils.unfTerm(BitvectorUtils.java:225) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.unfTerm(SmtUtils.java:1575) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.unfTerm(SmtUtils.java:1453) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.convertApplicationTerm(SmtUtils.java:1442) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.convertApplicationTerm(Substitution.java:53) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:389) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:319) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PolyPacSimplificationTermWalker.applyConstantFolding(PolyPacSimplificationTermWalker.java:168) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PolyPacSimplificationTermWalker.convert(PolyPacSimplificationTermWalker.java:134) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PolyPacSimplificationTermWalker.convert(PolyPacSimplificationTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PolyPacSimplificationTermWalker.simplify(PolyPacSimplificationTermWalker.java:208) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:123) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminateLight(PartialQuantifierElimination.java:62) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.constructQuantifiedFormula(TermDomainOperationProvider.java:112) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:101) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:192) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:290) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:180) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:421) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-10-11 09:57:08,683 INFO L158 Benchmark]: Toolchain (without parser) took 4208.75ms. Allocated memory was 56.6MB in the beginning and 104.9MB in the end (delta: 48.2MB). Free memory was 30.2MB in the beginning and 39.0MB in the end (delta: -8.8MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. [2024-10-11 09:57:08,683 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 56.6MB. Free memory was 33.4MB in the beginning and 33.3MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 09:57:08,684 INFO L158 Benchmark]: CACSL2BoogieTranslator took 424.75ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 30.0MB in the beginning and 43.1MB in the end (delta: -13.1MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2024-10-11 09:57:08,684 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.03ms. Allocated memory is still 71.3MB. Free memory was 43.1MB in the beginning and 40.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 09:57:08,684 INFO L158 Benchmark]: Boogie Preprocessor took 85.88ms. Allocated memory is still 71.3MB. Free memory was 40.5MB in the beginning and 37.0MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 09:57:08,685 INFO L158 Benchmark]: RCFGBuilder took 760.14ms. Allocated memory is still 71.3MB. Free memory was 36.7MB in the beginning and 48.0MB in the end (delta: -11.3MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. [2024-10-11 09:57:08,685 INFO L158 Benchmark]: TraceAbstraction took 2859.44ms. Allocated memory was 71.3MB in the beginning and 104.9MB in the end (delta: 33.6MB). Free memory was 47.2MB in the beginning and 39.0MB in the end (delta: 8.2MB). Peak memory consumption was 42.1MB. Max. memory is 16.1GB. [2024-10-11 09:57:08,689 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.21ms. Allocated memory is still 56.6MB. Free memory was 33.4MB in the beginning and 33.3MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 424.75ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 30.0MB in the beginning and 43.1MB in the end (delta: -13.1MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.03ms. Allocated memory is still 71.3MB. Free memory was 43.1MB in the beginning and 40.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.88ms. Allocated memory is still 71.3MB. Free memory was 40.5MB in the beginning and 37.0MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 760.14ms. Allocated memory is still 71.3MB. Free memory was 36.7MB in the beginning and 48.0MB in the end (delta: -11.3MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. * TraceAbstraction took 2859.44ms. Allocated memory was 71.3MB in the beginning and 104.9MB in the end (delta: 33.6MB). Free memory was 47.2MB in the beginning and 39.0MB in the end (delta: 8.2MB). Peak memory consumption was 42.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of int range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of int range: java.base/java.math.BigInteger.intValueExact(BigInteger.java:4784) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-10-11 09:57:08,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ArithmeticException: BigInteger out of int range