./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../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 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-92.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash adcde90e8b053d99359c11706230b2ebf7c2fa95333a62c210d892627b4fe438 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 03:49:46,915 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 03:49:47,035 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 03:49:47,038 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 03:49:47,039 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 03:49:47,073 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 03:49:47,073 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 03:49:47,074 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 03:49:47,074 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 03:49:47,075 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 03:49:47,075 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 03:49:47,075 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 03:49:47,078 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 03:49:47,078 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 03:49:47,078 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 03:49:47,079 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 03:49:47,079 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 03:49:47,079 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 03:49:47,080 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 03:49:47,080 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 03:49:47,080 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 03:49:47,084 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 03:49:47,084 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 03:49:47,085 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 03:49:47,085 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 03:49:47,085 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 03:49:47,085 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 03:49:47,086 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 03:49:47,086 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 03:49:47,086 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 03:49:47,086 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 03:49:47,087 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 03:49:47,087 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:49:47,087 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 03:49:47,088 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 03:49:47,090 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 03:49:47,091 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 03:49:47,091 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 03:49:47,091 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 03:49:47,091 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 03:49:47,091 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 03:49:47,092 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 03:49:47,092 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> adcde90e8b053d99359c11706230b2ebf7c2fa95333a62c210d892627b4fe438 [2024-11-12 03:49:47,322 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 03:49:47,350 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 03:49:47,353 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 03:49:47,354 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 03:49:47,355 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 03:49:47,356 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-92.i [2024-11-12 03:49:48,854 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 03:49:49,060 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 03:49:49,061 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-92.i [2024-11-12 03:49:49,081 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e647a1bbe/20fe4d50ed144b8988996ad73992e94a/FLAGd06c37dbc [2024-11-12 03:49:49,093 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e647a1bbe/20fe4d50ed144b8988996ad73992e94a [2024-11-12 03:49:49,095 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 03:49:49,096 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 03:49:49,098 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 03:49:49,098 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 03:49:49,104 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 03:49:49,104 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:49:49" (1/1) ... [2024-11-12 03:49:49,105 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ea0e47c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:49:49, skipping insertion in model container [2024-11-12 03:49:49,105 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:49:49" (1/1) ... [2024-11-12 03:49:49,139 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 03:49:49,316 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-92.i[919,932] [2024-11-12 03:49:49,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:49:49,456 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 03:49:49,471 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-92.i[919,932] [2024-11-12 03:49:49,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:49:49,528 INFO L204 MainTranslator]: Completed translation [2024-11-12 03:49:49,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:49:49 WrapperNode [2024-11-12 03:49:49,529 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 03:49:49,530 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 03:49:49,530 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 03:49:49,530 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 03:49:49,536 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:49:49" (1/1) ... [2024-11-12 03:49:49,547 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:49:49" (1/1) ... [2024-11-12 03:49:49,603 INFO L138 Inliner]: procedures = 26, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 263 [2024-11-12 03:49:49,604 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 03:49:49,604 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 03:49:49,604 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 03:49:49,604 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 03:49:49,620 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:49:49" (1/1) ... [2024-11-12 03:49:49,621 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:49:49" (1/1) ... [2024-11-12 03:49:49,629 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:49:49" (1/1) ... [2024-11-12 03:49:49,657 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 03:49:49,659 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:49:49" (1/1) ... [2024-11-12 03:49:49,659 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:49:49" (1/1) ... [2024-11-12 03:49:49,678 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:49:49" (1/1) ... [2024-11-12 03:49:49,682 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:49:49" (1/1) ... [2024-11-12 03:49:49,688 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:49:49" (1/1) ... [2024-11-12 03:49:49,694 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:49:49" (1/1) ... [2024-11-12 03:49:49,702 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 03:49:49,703 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 03:49:49,703 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 03:49:49,703 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 03:49:49,704 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:49:49" (1/1) ... [2024-11-12 03:49:49,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:49:49,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:49:49,739 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 03:49:49,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 03:49:49,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 03:49:49,789 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 03:49:49,790 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 03:49:49,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 03:49:49,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 03:49:49,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 03:49:49,897 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 03:49:49,899 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 03:49:50,402 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-12 03:49:50,403 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 03:49:50,425 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 03:49:50,426 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 03:49:50,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:49:50 BoogieIcfgContainer [2024-11-12 03:49:50,427 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 03:49:50,430 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 03:49:50,430 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 03:49:50,433 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 03:49:50,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 03:49:49" (1/3) ... [2024-11-12 03:49:50,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b03afe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:49:50, skipping insertion in model container [2024-11-12 03:49:50,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:49:49" (2/3) ... [2024-11-12 03:49:50,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b03afe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:49:50, skipping insertion in model container [2024-11-12 03:49:50,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:49:50" (3/3) ... [2024-11-12 03:49:50,438 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-92.i [2024-11-12 03:49:50,452 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 03:49:50,452 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 03:49:50,513 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 03:49:50,519 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;@5ece294d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 03:49:50,520 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 03:49:50,525 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 74 states have internal predecessors, (105), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-12 03:49:50,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-12 03:49:50,541 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:49:50,542 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:49:50,542 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:49:50,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:49:50,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1295076995, now seen corresponding path program 1 times [2024-11-12 03:49:50,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:49:50,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530420624] [2024-11-12 03:49:50,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:49:50,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:49:50,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:50,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:49:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:50,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:49:50,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:50,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:49:50,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:50,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:49:50,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:50,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:49:50,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:50,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:49:51,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:49:51,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 03:49:51,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:49:51,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 03:49:51,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 03:49:51,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 03:49:51,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 03:49:51,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 03:49:51,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 03:49:51,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 03:49:51,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 03:49:51,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 03:49:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 03:49:51,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 03:49:51,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 03:49:51,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 03:49:51,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 03:49:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 03:49:51,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 03:49:51,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 03:49:51,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 03:49:51,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 03:49:51,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-12 03:49:51,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 03:49:51,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-12 03:49:51,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-12 03:49:51,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-12 03:49:51,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-12 03:49:51,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-12 03:49:51,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49: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-11-12 03:49:51,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:49:51,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530420624] [2024-11-12 03:49:51,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530420624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:49:51,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:49:51,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 03:49:51,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261407731] [2024-11-12 03:49:51,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:49:51,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 03:49:51,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:49:51,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 03:49:51,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 03:49:51,213 INFO L87 Difference]: Start difference. First operand has 111 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 74 states have internal predecessors, (105), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-12 03:49:51,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:49:51,260 INFO L93 Difference]: Finished difference Result 215 states and 379 transitions. [2024-11-12 03:49:51,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 03:49:51,263 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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 223 [2024-11-12 03:49:51,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:49:51,271 INFO L225 Difference]: With dead ends: 215 [2024-11-12 03:49:51,272 INFO L226 Difference]: Without dead ends: 107 [2024-11-12 03:49:51,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 03:49:51,285 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 03:49:51,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 03:49:51,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-12 03:49:51,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-12 03:49:51,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 70 states have internal predecessors, (97), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-12 03:49:51,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 167 transitions. [2024-11-12 03:49:51,339 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 167 transitions. Word has length 223 [2024-11-12 03:49:51,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:49:51,341 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 167 transitions. [2024-11-12 03:49:51,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-12 03:49:51,342 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 167 transitions. [2024-11-12 03:49:51,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-12 03:49:51,346 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:49:51,347 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:49:51,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 03:49:51,347 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:49:51,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:49:51,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1558715331, now seen corresponding path program 1 times [2024-11-12 03:49:51,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:49:51,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377856003] [2024-11-12 03:49:51,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:49:51,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:49:51,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:49:51,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:49:51,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:49:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:49:51,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:49:51,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:49:51,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:49:51,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 03:49:51,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:49:51,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 03:49:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 03:49:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 03:49:51,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 03:49:51,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 03:49:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 03:49:51,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 03:49:51,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 03:49:51,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 03:49:51,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 03:49:51,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 03:49:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 03:49:51,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 03:49:51,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 03:49:51,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 03:49:51,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 03:49:51,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 03:49:51,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 03:49:51,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 03:49:51,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-12 03:49:51,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 03:49:51,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-12 03:49:51,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-12 03:49:51,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:51,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-12 03:49:51,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:52,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-12 03:49:52,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:52,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-12 03:49:52,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:52,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-12 03:49:52,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:49:52,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377856003] [2024-11-12 03:49:52,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377856003] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:49:52,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:49:52,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 03:49:52,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516157618] [2024-11-12 03:49:52,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:49:52,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 03:49:52,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:49:52,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 03:49:52,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 03:49:52,018 INFO L87 Difference]: Start difference. First operand 107 states and 167 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-12 03:49:52,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:49:52,132 INFO L93 Difference]: Finished difference Result 290 states and 459 transitions. [2024-11-12 03:49:52,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 03:49:52,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 223 [2024-11-12 03:49:52,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:49:52,141 INFO L225 Difference]: With dead ends: 290 [2024-11-12 03:49:52,142 INFO L226 Difference]: Without dead ends: 186 [2024-11-12 03:49:52,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 03:49:52,146 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 61 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 03:49:52,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 293 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 03:49:52,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-12 03:49:52,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 183. [2024-11-12 03:49:52,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 110 states have (on average 1.3454545454545455) internal successors, (148), 110 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-11-12 03:49:52,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 288 transitions. [2024-11-12 03:49:52,197 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 288 transitions. Word has length 223 [2024-11-12 03:49:52,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:49:52,199 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 288 transitions. [2024-11-12 03:49:52,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-12 03:49:52,199 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 288 transitions. [2024-11-12 03:49:52,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-12 03:49:52,203 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:49:52,203 INFO L218 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-11-12 03:49:52,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 03:49:52,208 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:49:52,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:49:52,208 INFO L85 PathProgramCache]: Analyzing trace with hash 2029611198, now seen corresponding path program 1 times [2024-11-12 03:49:52,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:49:52,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699590781] [2024-11-12 03:49:52,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:49:52,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:49:52,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:52,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:49:52,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:52,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:49:52,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:52,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:49:52,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:52,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:49:52,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:52,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:49:52,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:52,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:49:52,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:52,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:49:52,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:52,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 03:49:52,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:52,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:49:52,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:52,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 03:49:52,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:52,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 03:49:52,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:52,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 03:49:52,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:52,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 03:49:52,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:52,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 03:49:52,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:52,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 03:49:52,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:52,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 03:49:52,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:52,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 03:49:52,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:52,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 03:49:52,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:52,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 03:49:52,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:52,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 03:49:52,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:52,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 03:49:52,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:52,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 03:49:52,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:52,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 03:49:52,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:52,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 03:49:52,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:52,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 03:49:52,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:52,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 03:49:52,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:52,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 03:49:52,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:52,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 03:49:52,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:52,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-12 03:49:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:52,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 03:49:52,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:52,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-12 03:49:52,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:52,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-12 03:49:52,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:52,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-12 03:49:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:52,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-12 03:49:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:52,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-12 03:49:52,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:52,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-12 03:49:52,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:49:52,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699590781] [2024-11-12 03:49:52,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699590781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:49:52,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:49:52,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 03:49:52,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621827761] [2024-11-12 03:49:52,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:49:52,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 03:49:52,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:49:52,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 03:49:52,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 03:49:52,743 INFO L87 Difference]: Start difference. First operand 183 states and 288 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 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-11-12 03:49:53,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:49:53,339 INFO L93 Difference]: Finished difference Result 390 states and 614 transitions. [2024-11-12 03:49:53,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 03:49:53,340 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 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-11-12 03:49:53,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:49:53,344 INFO L225 Difference]: With dead ends: 390 [2024-11-12 03:49:53,344 INFO L226 Difference]: Without dead ends: 286 [2024-11-12 03:49:53,345 INFO L434 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-11-12 03:49:53,346 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 213 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 03:49:53,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 661 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 03:49:53,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-11-12 03:49:53,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 187. [2024-11-12 03:49:53,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 114 states have (on average 1.3508771929824561) internal successors, (154), 114 states have internal predecessors, (154), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-12 03:49:53,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 294 transitions. [2024-11-12 03:49:53,387 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 294 transitions. Word has length 224 [2024-11-12 03:49:53,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:49:53,389 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 294 transitions. [2024-11-12 03:49:53,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 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-11-12 03:49:53,389 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 294 transitions. [2024-11-12 03:49:53,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-12 03:49:53,392 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:49:53,392 INFO L218 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-11-12 03:49:53,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 03:49:53,392 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:49:53,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:49:53,393 INFO L85 PathProgramCache]: Analyzing trace with hash 978122070, now seen corresponding path program 1 times [2024-11-12 03:49:53,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:49:53,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692312249] [2024-11-12 03:49:53,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:49:53,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:49:53,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:53,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:49:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:53,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:49:53,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:53,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:49:53,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:53,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:49:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:53,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:49:53,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:53,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:49:53,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:53,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:49:53,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:53,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 03:49:53,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:53,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:49:53,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:53,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 03:49:53,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:53,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 03:49:53,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:53,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 03:49:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:53,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 03:49:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:53,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 03:49:53,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:53,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 03:49:53,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:53,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 03:49:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:53,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 03:49:53,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:53,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 03:49:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:53,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 03:49:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:53,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 03:49:53,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:53,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 03:49:53,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:53,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 03:49:53,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:53,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 03:49:53,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:53,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 03:49:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:53,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 03:49:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:53,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 03:49:53,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:53,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 03:49:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:53,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 03:49:53,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:53,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-12 03:49:53,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:53,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 03:49:53,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:53,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-12 03:49:53,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:53,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-12 03:49:53,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:53,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-12 03:49:53,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:53,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-12 03:49:53,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:53,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-12 03:49:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:53,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-12 03:49:53,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:49:53,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692312249] [2024-11-12 03:49:53,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692312249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:49:53,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:49:53,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 03:49:53,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060885746] [2024-11-12 03:49:53,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:49:53,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 03:49:53,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:49:53,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 03:49:53,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 03:49:53,939 INFO L87 Difference]: Start difference. First operand 187 states and 294 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-12 03:49:54,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:49:54,315 INFO L93 Difference]: Finished difference Result 432 states and 675 transitions. [2024-11-12 03:49:54,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 03:49:54,316 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 225 [2024-11-12 03:49:54,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:49:54,319 INFO L225 Difference]: With dead ends: 432 [2024-11-12 03:49:54,319 INFO L226 Difference]: Without dead ends: 314 [2024-11-12 03:49:54,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 03:49:54,321 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 168 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 03:49:54,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 573 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 03:49:54,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-11-12 03:49:54,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 291. [2024-11-12 03:49:54,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 182 states have (on average 1.3626373626373627) internal successors, (248), 182 states have internal predecessors, (248), 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-11-12 03:49:54,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 458 transitions. [2024-11-12 03:49:54,376 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 458 transitions. Word has length 225 [2024-11-12 03:49:54,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:49:54,377 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 458 transitions. [2024-11-12 03:49:54,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-12 03:49:54,378 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 458 transitions. [2024-11-12 03:49:54,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-12 03:49:54,380 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:49:54,380 INFO L218 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, 1] [2024-11-12 03:49:54,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 03:49:54,381 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:49:54,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:49:54,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1154797370, now seen corresponding path program 1 times [2024-11-12 03:49:54,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:49:54,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485956590] [2024-11-12 03:49:54,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:49:54,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:49:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:56,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:49:56,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:56,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:49:56,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:56,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:49:56,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:56,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:49:56,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:56,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:49:56,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:56,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:49:56,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:56,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:49:56,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:56,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 03:49:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:56,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:49:56,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:56,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 03:49:56,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:56,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 03:49:56,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:56,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 03:49:56,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:56,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 03:49:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:56,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 03:49:56,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:56,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 03:49:56,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:56,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 03:49:56,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:56,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 03:49:56,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:56,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 03:49:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:56,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 03:49:56,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:56,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 03:49:56,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:56,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 03:49:56,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:56,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 03:49:56,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:56,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 03:49:56,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:56,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 03:49:56,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:56,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 03:49:56,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:56,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 03:49:56,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:56,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 03:49:56,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:56,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 03:49:56,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:56,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-12 03:49:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:56,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 03:49:56,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:56,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-12 03:49:56,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:56,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-12 03:49:56,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:56,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-12 03:49:56,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:56,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-12 03:49:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:56,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-12 03:49:56,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:56,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-12 03:49:56,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:49:56,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485956590] [2024-11-12 03:49:56,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485956590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:49:56,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:49:56,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 03:49:56,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887255439] [2024-11-12 03:49:56,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:49:56,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 03:49:56,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:49:56,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 03:49:56,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-12 03:49:56,652 INFO L87 Difference]: Start difference. First operand 291 states and 458 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-12 03:49:57,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:49:57,566 INFO L93 Difference]: Finished difference Result 599 states and 931 transitions. [2024-11-12 03:49:57,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 03:49:57,566 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 226 [2024-11-12 03:49:57,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:49:57,572 INFO L225 Difference]: With dead ends: 599 [2024-11-12 03:49:57,572 INFO L226 Difference]: Without dead ends: 371 [2024-11-12 03:49:57,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-11-12 03:49:57,574 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 192 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 03:49:57,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 765 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 03:49:57,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-11-12 03:49:57,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 336. [2024-11-12 03:49:57,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 226 states have (on average 1.3761061946902655) internal successors, (311), 226 states have internal predecessors, (311), 105 states have call successors, (105), 4 states have call predecessors, (105), 4 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2024-11-12 03:49:57,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 521 transitions. [2024-11-12 03:49:57,625 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 521 transitions. Word has length 226 [2024-11-12 03:49:57,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:49:57,626 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 521 transitions. [2024-11-12 03:49:57,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-12 03:49:57,627 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 521 transitions. [2024-11-12 03:49:57,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-12 03:49:57,629 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:49:57,630 INFO L218 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, 1] [2024-11-12 03:49:57,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 03:49:57,630 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:49:57,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:49:57,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1295345980, now seen corresponding path program 1 times [2024-11-12 03:49:57,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:49:57,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852425574] [2024-11-12 03:49:57,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:49:57,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:49:57,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:57,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:49:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:57,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:49:57,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:57,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:49:57,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:57,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:49:57,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:57,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:49:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:57,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:49:57,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:57,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:49:57,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:57,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 03:49:57,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:57,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:49:57,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:57,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 03:49:58,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 03:49:58,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 03:49:58,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 03:49:58,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 03:49:58,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 03:49:58,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 03:49:58,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 03:49:58,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 03:49:58,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 03:49:58,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 03:49:58,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 03:49:58,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 03:49:58,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 03:49:58,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 03:49:58,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 03:49:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 03:49:58,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 03:49:58,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 03:49:58,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-12 03:49:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 03:49:58,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-12 03:49:58,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-12 03:49:58,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-12 03:49:58,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-12 03:49:58,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-12 03:49:58,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-12 03:49:58,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:49:58,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852425574] [2024-11-12 03:49:58,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852425574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:49:58,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:49:58,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 03:49:58,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570864446] [2024-11-12 03:49:58,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:49:58,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 03:49:58,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:49:58,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 03:49:58,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 03:49:58,117 INFO L87 Difference]: Start difference. First operand 336 states and 521 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-12 03:49:58,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:49:58,190 INFO L93 Difference]: Finished difference Result 568 states and 885 transitions. [2024-11-12 03:49:58,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 03:49:58,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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 226 [2024-11-12 03:49:58,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:49:58,194 INFO L225 Difference]: With dead ends: 568 [2024-11-12 03:49:58,194 INFO L226 Difference]: Without dead ends: 350 [2024-11-12 03:49:58,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 03:49:58,196 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 56 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 03:49:58,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 317 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 03:49:58,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-11-12 03:49:58,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 336. [2024-11-12 03:49:58,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 226 states have (on average 1.3672566371681416) internal successors, (309), 226 states have internal predecessors, (309), 105 states have call successors, (105), 4 states have call predecessors, (105), 4 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2024-11-12 03:49:58,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 519 transitions. [2024-11-12 03:49:58,248 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 519 transitions. Word has length 226 [2024-11-12 03:49:58,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:49:58,249 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 519 transitions. [2024-11-12 03:49:58,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-12 03:49:58,250 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 519 transitions. [2024-11-12 03:49:58,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-12 03:49:58,253 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:49:58,253 INFO L218 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, 1, 1, 1] [2024-11-12 03:49:58,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 03:49:58,254 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:49:58,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:49:58,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1110258613, now seen corresponding path program 1 times [2024-11-12 03:49:58,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:49:58,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036918720] [2024-11-12 03:49:58,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:49:58,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:49:58,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:49:58,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:49:58,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:49:58,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:49:58,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:49:58,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:49:58,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:49:58,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 03:49:58,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:49:58,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 03:49:58,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 03:49:58,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 03:49:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 03:49:58,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 03:49:58,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 03:49:58,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 03:49:58,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 03:49:58,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 03:49:58,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 03:49:58,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 03:49:58,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 03:49:58,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 03:49:58,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 03:49:58,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 03:49:58,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 03:49:58,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 03:49:58,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 03:49:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 03:49:58,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-12 03:49:58,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 03:49:58,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-12 03:49:58,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-12 03:49:58,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-12 03:49:58,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-12 03:49:58,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-12 03:49:58,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:58,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 24 proven. 78 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2024-11-12 03:49:58,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:49:58,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036918720] [2024-11-12 03:49:58,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036918720] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 03:49:58,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063609851] [2024-11-12 03:49:58,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:49:58,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:49:58,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:49:58,887 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 03:49:58,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 03:49:59,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:49:59,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-12 03:49:59,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:50:00,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 910 proven. 150 refuted. 0 times theorem prover too weak. 1320 trivial. 0 not checked. [2024-11-12 03:50:00,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 03:50:01,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 48 proven. 153 refuted. 0 times theorem prover too weak. 2179 trivial. 0 not checked. [2024-11-12 03:50:01,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063609851] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 03:50:01,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 03:50:01,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 10] total 21 [2024-11-12 03:50:01,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367372148] [2024-11-12 03:50:01,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 03:50:01,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-12 03:50:01,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:50:01,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-12 03:50:01,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2024-11-12 03:50:01,075 INFO L87 Difference]: Start difference. First operand 336 states and 519 transitions. Second operand has 21 states, 20 states have (on average 6.2) internal successors, (124), 20 states have internal predecessors, (124), 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-11-12 03:50:02,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:50:02,478 INFO L93 Difference]: Finished difference Result 675 states and 1033 transitions. [2024-11-12 03:50:02,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-12 03:50:02,479 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 6.2) internal successors, (124), 20 states have internal predecessors, (124), 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 228 [2024-11-12 03:50:02,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:50:02,482 INFO L225 Difference]: With dead ends: 675 [2024-11-12 03:50:02,483 INFO L226 Difference]: Without dead ends: 427 [2024-11-12 03:50:02,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 514 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=377, Invalid=955, Unknown=0, NotChecked=0, Total=1332 [2024-11-12 03:50:02,485 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 454 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 1367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-12 03:50:02,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 712 Invalid, 1367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 1109 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-12 03:50:02,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2024-11-12 03:50:02,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 301. [2024-11-12 03:50:02,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 189 states have (on average 1.3227513227513228) internal successors, (250), 189 states have internal predecessors, (250), 105 states have call successors, (105), 6 states have call predecessors, (105), 6 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2024-11-12 03:50:02,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 460 transitions. [2024-11-12 03:50:02,534 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 460 transitions. Word has length 228 [2024-11-12 03:50:02,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:50:02,534 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 460 transitions. [2024-11-12 03:50:02,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 6.2) internal successors, (124), 20 states have internal predecessors, (124), 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-11-12 03:50:02,535 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 460 transitions. [2024-11-12 03:50:02,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-12 03:50:02,537 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:50:02,537 INFO L218 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, 1, 1, 1] [2024-11-12 03:50:02,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 03:50:02,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:50:02,738 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:50:02,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:50:02,739 INFO L85 PathProgramCache]: Analyzing trace with hash 603724567, now seen corresponding path program 1 times [2024-11-12 03:50:02,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:50:02,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989104518] [2024-11-12 03:50:02,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:50:02,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:50:02,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:03,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:50:03,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:03,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:50:03,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:03,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:50:03,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:03,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:50:03,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:03,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:50:03,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:03,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:50:03,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:03,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:50:03,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:03,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 03:50:03,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:03,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:50:03,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:03,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 03:50:03,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:03,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 03:50:03,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:03,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 03:50:03,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:03,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 03:50:03,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:03,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 03:50:03,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:03,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 03:50:03,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:03,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 03:50:03,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:03,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 03:50:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:03,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 03:50:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:03,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 03:50:03,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:03,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 03:50:03,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:03,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 03:50:03,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:03,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 03:50:03,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:03,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 03:50:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:03,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 03:50:03,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:03,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 03:50:03,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:03,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 03:50:03,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:03,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 03:50:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:03,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 03:50:03,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:03,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-12 03:50:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:03,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 03:50:03,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:03,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-12 03:50:03,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:03,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-12 03:50:03,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:03,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-12 03:50:03,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:03,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-12 03:50:03,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:03,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-11-12 03:50:03,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:03,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-12 03:50:03,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:50:03,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989104518] [2024-11-12 03:50:03,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989104518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:50:03,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:50:03,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 03:50:03,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796168501] [2024-11-12 03:50:03,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:50:03,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 03:50:03,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:50:03,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 03:50:03,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 03:50:03,741 INFO L87 Difference]: Start difference. First operand 301 states and 460 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-12 03:50:04,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:50:04,149 INFO L93 Difference]: Finished difference Result 556 states and 855 transitions. [2024-11-12 03:50:04,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 03:50:04,149 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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 228 [2024-11-12 03:50:04,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:50:04,152 INFO L225 Difference]: With dead ends: 556 [2024-11-12 03:50:04,153 INFO L226 Difference]: Without dead ends: 349 [2024-11-12 03:50:04,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-12 03:50:04,154 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 102 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 03:50:04,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 529 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 03:50:04,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-11-12 03:50:04,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 331. [2024-11-12 03:50:04,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 219 states have (on average 1.3470319634703196) internal successors, (295), 219 states have internal predecessors, (295), 105 states have call successors, (105), 6 states have call predecessors, (105), 6 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2024-11-12 03:50:04,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 505 transitions. [2024-11-12 03:50:04,202 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 505 transitions. Word has length 228 [2024-11-12 03:50:04,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:50:04,202 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 505 transitions. [2024-11-12 03:50:04,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-12 03:50:04,202 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 505 transitions. [2024-11-12 03:50:04,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-11-12 03:50:04,205 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:50:04,205 INFO L218 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, 1, 1, 1, 1, 1] [2024-11-12 03:50:04,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 03:50:04,205 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:50:04,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:50:04,206 INFO L85 PathProgramCache]: Analyzing trace with hash -189727662, now seen corresponding path program 1 times [2024-11-12 03:50:04,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:50:04,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354435526] [2024-11-12 03:50:04,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:50:04,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:50:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 03:50:04,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [668609540] [2024-11-12 03:50:04,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:50:04,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:50:04,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:50:04,303 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 03:50:04,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 03:50:04,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 03:50:04,453 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 03:50:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 03:50:04,706 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 03:50:04,706 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 03:50:04,708 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 03:50:04,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-12 03:50:04,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-12 03:50:04,914 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:50:05,083 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 03:50:05,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 03:50:05 BoogieIcfgContainer [2024-11-12 03:50:05,088 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 03:50:05,089 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 03:50:05,089 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 03:50:05,089 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 03:50:05,090 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:49:50" (3/4) ... [2024-11-12 03:50:05,092 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 03:50:05,093 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 03:50:05,094 INFO L158 Benchmark]: Toolchain (without parser) took 15997.86ms. Allocated memory was 161.5MB in the beginning and 352.3MB in the end (delta: 190.8MB). Free memory was 104.0MB in the beginning and 114.1MB in the end (delta: -10.0MB). Peak memory consumption was 180.7MB. Max. memory is 16.1GB. [2024-11-12 03:50:05,094 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory is still 52.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 03:50:05,094 INFO L158 Benchmark]: CACSL2BoogieTranslator took 431.18ms. Allocated memory is still 161.5MB. Free memory was 103.9MB in the beginning and 127.0MB in the end (delta: -23.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 03:50:05,095 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.55ms. Allocated memory is still 161.5MB. Free memory was 127.0MB in the beginning and 121.9MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 03:50:05,095 INFO L158 Benchmark]: Boogie Preprocessor took 97.75ms. Allocated memory is still 161.5MB. Free memory was 121.1MB in the beginning and 114.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 03:50:05,095 INFO L158 Benchmark]: RCFGBuilder took 724.55ms. Allocated memory is still 161.5MB. Free memory was 114.8MB in the beginning and 81.3MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-12 03:50:05,095 INFO L158 Benchmark]: TraceAbstraction took 14658.49ms. Allocated memory was 161.5MB in the beginning and 352.3MB in the end (delta: 190.8MB). Free memory was 81.3MB in the beginning and 115.0MB in the end (delta: -33.7MB). Peak memory consumption was 159.7MB. Max. memory is 16.1GB. [2024-11-12 03:50:05,096 INFO L158 Benchmark]: Witness Printer took 4.62ms. Allocated memory is still 352.3MB. Free memory was 115.0MB in the beginning and 114.1MB in the end (delta: 901.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 03:50:05,097 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 96.5MB. Free memory is still 52.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 431.18ms. Allocated memory is still 161.5MB. Free memory was 103.9MB in the beginning and 127.0MB in the end (delta: -23.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.55ms. Allocated memory is still 161.5MB. Free memory was 127.0MB in the beginning and 121.9MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 97.75ms. Allocated memory is still 161.5MB. Free memory was 121.1MB in the beginning and 114.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 724.55ms. Allocated memory is still 161.5MB. Free memory was 114.8MB in the beginning and 81.3MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 14658.49ms. Allocated memory was 161.5MB in the beginning and 352.3MB in the end (delta: 190.8MB). Free memory was 81.3MB in the beginning and 115.0MB in the end (delta: -33.7MB). Peak memory consumption was 159.7MB. Max. memory is 16.1GB. * Witness Printer took 4.62ms. Allocated memory is still 352.3MB. Free memory was 115.0MB in the beginning and 114.1MB in the end (delta: 901.1kB). 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; VAL [isInitial=0, 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=0, var_1_7=0, var_1_8=10, var_1_9=0] [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 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=0, var_1_7=0, var_1_8=10, var_1_9=0] [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=125, 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=125, 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=125, 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=125, 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=125, 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=125, 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=125, var_1_19=126, 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=125, var_1_19=126, 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=125, var_1_19=126, 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=125, var_1_19=126, 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=125, var_1_19=126, 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=125, var_1_19=126, 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=125, var_1_19=126, 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=125, var_1_19=126, 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=125, var_1_19=126, 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=125, var_1_19=126, 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=125, var_1_19=126, 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=125, var_1_19=126, 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=125, var_1_19=126, 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=125, var_1_19=126, 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=125, var_1_19=126, 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=125, var_1_19=126, 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=125, var_1_19=126, 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] [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=125, var_1_19=126, 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] [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=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=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=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=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] [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=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=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] 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=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=-648, 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=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=-648, 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=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=-648, 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=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=-648, 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=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=-648, 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=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=-648, 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=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=-648, 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=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=-648, 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=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=-648, 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=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=-648, 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=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=-648, 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=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=-648, 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=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=-648, 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=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=-648, 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=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=-648, 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=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=-648, 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=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=-648, 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] [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=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=-648, 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] [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=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=-648, 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=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=-648, 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] [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=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=-648, 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] [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=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=-648, 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=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=-648, 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] [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=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=-648, 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] [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=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=-648, 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_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=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=-648, 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_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=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=-648, 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_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=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=-648, 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=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=-648, 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] [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=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=-648, 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] [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=0, 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=125, var_1_19=126, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=-648, 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] [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=125, var_1_19=126, var_1_1=32767, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=-648, 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] [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=125, var_1_19=126, var_1_1=32767, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=-648, 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] [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=125, var_1_19=126, var_1_1=32767, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=-648, 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] [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=125, var_1_19=126, var_1_1=32767, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=-648, 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] [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=125, var_1_19=126, var_1_1=32767, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=-648, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=120, 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] [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=125, var_1_19=126, var_1_1=32767, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=-648, var_1_28=16, var_1_29=0, var_1_30=-256, var_1_32=120, 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] [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=-121, var_1_18=125, var_1_19=126, var_1_1=32767, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=-648, var_1_28=0, var_1_29=0, var_1_30=-256, var_1_32=120, 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] [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=-121, var_1_18=125, var_1_19=126, var_1_1=32767, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=-648, var_1_28=0, var_1_29=0, var_1_30=-256, var_1_32=120, 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] [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=-121, var_1_18=125, var_1_19=126, var_1_1=32767, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=-648, var_1_28=0, var_1_29=0, var_1_30=-256, var_1_32=120, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=-32, var_1_37=1, 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=-121, var_1_18=125, var_1_19=126, var_1_1=32767, var_1_20=-536838143, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=-648, var_1_28=0, var_1_29=0, var_1_30=-256, var_1_32=120, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=-32, var_1_37=1, 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=-121, var_1_18=125, var_1_19=126, var_1_1=32767, var_1_20=-536838143, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_27=-648, var_1_28=0, var_1_29=0, var_1_30=-256, var_1_32=120, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=-32, var_1_37=1, 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=-121, var_1_18=125, var_1_19=126, var_1_1=32767, var_1_20=-536838143, var_1_21=536870911, var_1_23=-648, var_1_26=0, var_1_27=-648, var_1_28=0, var_1_29=0, var_1_30=-256, var_1_32=120, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=-32, var_1_37=1, 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=-121, var_1_18=125, var_1_19=126, var_1_1=32767, var_1_20=-536838143, var_1_21=536870911, var_1_23=-648, var_1_26=0, var_1_27=-648, var_1_28=0, var_1_29=0, var_1_30=-256, var_1_32=120, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=-32, var_1_37=1, 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=-121, var_1_18=125, var_1_19=126, var_1_1=32767, var_1_20=-536838143, var_1_21=536870911, var_1_23=-648, var_1_26=0, var_1_27=-648, var_1_28=0, var_1_29=0, var_1_30=-256, var_1_32=120, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=-32, var_1_37=1, 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=-121, var_1_18=125, var_1_19=126, var_1_1=32767, var_1_20=-536838143, var_1_21=536870911, var_1_23=-648, var_1_26=0, var_1_27=-648, var_1_28=0, var_1_29=0, var_1_30=-256, var_1_32=120, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=-32, var_1_37=1, 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=-121, var_1_18=125, var_1_19=126, var_1_1=32767, var_1_20=-536838143, var_1_21=536870911, var_1_23=-648, var_1_26=0, var_1_27=-648, var_1_28=0, var_1_29=0, var_1_30=-256, var_1_32=120, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=-32, var_1_37=1, 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=-121, var_1_18=125, var_1_19=126, var_1_1=32767, var_1_20=-536838143, var_1_21=536870911, var_1_23=-648, var_1_26=0, var_1_27=-648, var_1_28=0, var_1_29=0, var_1_30=-256, var_1_32=120, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=-32, var_1_37=1, 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=-121, var_1_18=125, var_1_19=126, var_1_1=32767, var_1_20=-536838143, var_1_21=536870911, var_1_23=-648, var_1_26=0, var_1_27=-648, var_1_28=0, var_1_29=0, var_1_30=-1, var_1_32=120, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=-32, var_1_37=1, 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 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=-121, var_1_18=125, var_1_19=126, var_1_1=32767, var_1_20=-536838143, var_1_21=536870911, var_1_23=-648, var_1_26=0, var_1_27=-648, var_1_28=0, var_1_29=0, var_1_30=-1, var_1_32=120, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=-32, var_1_37=1, 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] [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=-121, var_1_18=125, var_1_19=126, var_1_1=32767, var_1_20=-536838143, var_1_21=536870911, var_1_23=-648, var_1_26=0, var_1_27=-648, var_1_28=0, var_1_29=0, var_1_30=-1, var_1_32=120, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=-32, var_1_37=1, 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=-121, var_1_18=125, var_1_19=126, var_1_1=32767, var_1_20=-536838143, var_1_21=536870911, var_1_23=-648, var_1_26=0, var_1_27=-648, var_1_28=0, var_1_29=0, var_1_30=-1, var_1_32=120, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=-32, var_1_37=1, 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=-121, var_1_18=125, var_1_19=126, var_1_1=32767, var_1_20=-536838143, var_1_21=536870911, var_1_23=-648, var_1_26=0, var_1_27=-648, var_1_28=0, var_1_29=0, var_1_30=-1, var_1_32=120, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=-32, var_1_37=1, 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=-121, var_1_18=125, var_1_19=126, var_1_1=32767, var_1_20=-536838143, var_1_21=536870911, var_1_23=-648, var_1_26=0, var_1_27=-648, var_1_28=0, var_1_29=0, var_1_30=-1, var_1_32=120, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=-32, var_1_37=1, 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=-121, var_1_18=125, var_1_19=126, var_1_1=32767, var_1_20=-536838143, var_1_21=536870911, var_1_23=-648, var_1_26=0, var_1_27=-648, var_1_28=0, var_1_29=0, var_1_30=-1, var_1_32=120, var_1_33=128, var_1_34=1/4, var_1_35=2, var_1_36=-32, var_1_37=1, 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, 111 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.4s, OverallIterations: 9, TraceHistogramMax: 35, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1247 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1246 mSDsluCounter, 4017 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2673 mSDsCounter, 627 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2493 IncrementalHoareTripleChecker+Invalid, 3120 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 627 mSolverCounterUnsat, 1344 mSDtfsCounter, 2493 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1125 GetRequests, 1056 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=336occurred in iteration=5, InterpolantAutomatonStates: 55, 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, 8 MinimizatonAttempts, 318 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 2491 NumberOfCodeBlocks, 2491 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2249 ConstructedInterpolants, 0 QuantifiedInterpolants, 14250 SizeOfPredicates, 4 NumberOfNonLiveVariables, 524 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 23419/23800 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 03:50:05,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-92.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash adcde90e8b053d99359c11706230b2ebf7c2fa95333a62c210d892627b4fe438 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 03:50:07,498 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 03:50:07,581 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 03:50:07,588 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 03:50:07,588 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 03:50:07,622 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 03:50:07,622 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 03:50:07,623 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 03:50:07,623 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 03:50:07,624 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 03:50:07,624 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 03:50:07,625 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 03:50:07,626 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 03:50:07,628 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 03:50:07,629 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 03:50:07,629 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 03:50:07,629 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 03:50:07,629 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 03:50:07,630 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 03:50:07,630 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 03:50:07,630 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 03:50:07,632 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 03:50:07,633 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 03:50:07,635 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 03:50:07,635 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 03:50:07,636 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 03:50:07,636 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 03:50:07,636 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 03:50:07,636 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 03:50:07,636 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 03:50:07,637 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 03:50:07,637 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 03:50:07,637 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 03:50:07,637 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 03:50:07,638 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:50:07,638 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 03:50:07,640 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 03:50:07,640 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 03:50:07,641 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 03:50:07,641 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 03:50:07,641 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 03:50:07,642 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 03:50:07,642 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 03:50:07,642 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 03:50:07,642 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> adcde90e8b053d99359c11706230b2ebf7c2fa95333a62c210d892627b4fe438 [2024-11-12 03:50:07,987 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 03:50:08,011 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 03:50:08,014 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 03:50:08,015 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 03:50:08,015 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 03:50:08,017 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-92.i [2024-11-12 03:50:09,589 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 03:50:09,813 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 03:50:09,814 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-92.i [2024-11-12 03:50:09,828 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5c2c3d6c/5987de34f56b4f4e9e1a988599e9ebb4/FLAG3c64f1075 [2024-11-12 03:50:09,850 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5c2c3d6c/5987de34f56b4f4e9e1a988599e9ebb4 [2024-11-12 03:50:09,853 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 03:50:09,855 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 03:50:09,859 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 03:50:09,859 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 03:50:09,864 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 03:50:09,865 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:50:09" (1/1) ... [2024-11-12 03:50:09,866 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50c6837e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:50:09, skipping insertion in model container [2024-11-12 03:50:09,866 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:50:09" (1/1) ... [2024-11-12 03:50:09,916 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 03:50:10,108 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-92.i[919,932] [2024-11-12 03:50:10,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:50:10,220 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 03:50:10,237 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-92.i[919,932] [2024-11-12 03:50:10,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:50:10,306 INFO L204 MainTranslator]: Completed translation [2024-11-12 03:50:10,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:50:10 WrapperNode [2024-11-12 03:50:10,307 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 03:50:10,308 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 03:50:10,308 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 03:50:10,308 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 03:50:10,315 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:50:10" (1/1) ... [2024-11-12 03:50:10,331 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:50:10" (1/1) ... [2024-11-12 03:50:10,370 INFO L138 Inliner]: procedures = 27, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 215 [2024-11-12 03:50:10,370 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 03:50:10,371 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 03:50:10,371 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 03:50:10,371 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 03:50:10,385 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:50:10" (1/1) ... [2024-11-12 03:50:10,385 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:50:10" (1/1) ... [2024-11-12 03:50:10,389 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:50:10" (1/1) ... [2024-11-12 03:50:10,410 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 03:50:10,414 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:50:10" (1/1) ... [2024-11-12 03:50:10,414 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:50:10" (1/1) ... [2024-11-12 03:50:10,424 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:50:10" (1/1) ... [2024-11-12 03:50:10,428 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:50:10" (1/1) ... [2024-11-12 03:50:10,430 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:50:10" (1/1) ... [2024-11-12 03:50:10,432 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:50:10" (1/1) ... [2024-11-12 03:50:10,439 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 03:50:10,440 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 03:50:10,440 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 03:50:10,440 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 03:50:10,441 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:50:10" (1/1) ... [2024-11-12 03:50:10,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:50:10,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:50:10,489 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 03:50:10,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 03:50:10,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 03:50:10,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 03:50:10,542 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 03:50:10,542 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 03:50:10,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 03:50:10,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 03:50:10,642 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 03:50:10,644 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 03:50:11,150 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-12 03:50:11,150 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 03:50:11,165 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 03:50:11,168 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 03:50:11,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:50:11 BoogieIcfgContainer [2024-11-12 03:50:11,168 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 03:50:11,170 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 03:50:11,170 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 03:50:11,174 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 03:50:11,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 03:50:09" (1/3) ... [2024-11-12 03:50:11,175 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2866a76d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:50:11, skipping insertion in model container [2024-11-12 03:50:11,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:50:10" (2/3) ... [2024-11-12 03:50:11,176 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2866a76d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:50:11, skipping insertion in model container [2024-11-12 03:50:11,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:50:11" (3/3) ... [2024-11-12 03:50:11,178 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-92.i [2024-11-12 03:50:11,194 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 03:50:11,195 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 03:50:11,295 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 03:50:11,304 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;@4d93049, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 03:50:11,305 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 03:50:11,310 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 59 states have internal predecessors, (82), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-12 03:50:11,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-12 03:50:11,326 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:50:11,327 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:50:11,328 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:50:11,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:50:11,334 INFO L85 PathProgramCache]: Analyzing trace with hash 909460796, now seen corresponding path program 1 times [2024-11-12 03:50:11,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:50:11,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1971647758] [2024-11-12 03:50:11,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:50:11,351 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 03:50:11,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:50:11,354 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 03:50:11,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 03:50:11,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:11,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 03:50:11,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:50:11,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 824 proven. 0 refuted. 0 times theorem prover too weak. 1556 trivial. 0 not checked. [2024-11-12 03:50:11,788 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 03:50:11,793 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 03:50:11,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1971647758] [2024-11-12 03:50:11,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1971647758] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:50:11,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:50:11,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 03:50:11,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965020558] [2024-11-12 03:50:11,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:50:11,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 03:50:11,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 03:50:11,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 03:50:11,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 03:50:11,839 INFO L87 Difference]: Start difference. First operand has 96 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 59 states have internal predecessors, (82), 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 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-12 03:50:11,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:50:11,879 INFO L93 Difference]: Finished difference Result 185 states and 333 transitions. [2024-11-12 03:50:11,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 03:50:11,881 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 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 218 [2024-11-12 03:50:11,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:50:11,889 INFO L225 Difference]: With dead ends: 185 [2024-11-12 03:50:11,889 INFO L226 Difference]: Without dead ends: 92 [2024-11-12 03:50:11,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 03:50:11,898 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 03:50:11,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 03:50:11,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-12 03:50:11,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-12 03:50:11,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 55 states have internal predecessors, (74), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-12 03:50:11,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 144 transitions. [2024-11-12 03:50:11,958 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 144 transitions. Word has length 218 [2024-11-12 03:50:11,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:50:11,959 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 144 transitions. [2024-11-12 03:50:11,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-12 03:50:11,959 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 144 transitions. [2024-11-12 03:50:11,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-12 03:50:11,965 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:50:11,965 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:50:11,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-12 03:50:12,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 03:50:12,166 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:50:12,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:50:12,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1021148350, now seen corresponding path program 1 times [2024-11-12 03:50:12,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:50:12,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1448759601] [2024-11-12 03:50:12,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:50:12,170 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 03:50:12,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:50:12,190 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 03:50:12,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 03:50:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:12,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 03:50:12,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:50:13,893 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 03:50:13,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1448759601] [2024-11-12 03:50:13,894 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-12 03:50:13,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-12 03:50:14,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 03:50:14,099 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:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) 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:316) 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:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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-11-12 03:50:14,103 INFO L158 Benchmark]: Toolchain (without parser) took 4247.94ms. Allocated memory was 69.2MB in the beginning and 104.9MB in the end (delta: 35.7MB). Free memory was 35.6MB in the beginning and 53.4MB in the end (delta: -17.8MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2024-11-12 03:50:14,104 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 52.4MB. Free memory is still 29.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 03:50:14,104 INFO L158 Benchmark]: CACSL2BoogieTranslator took 448.55ms. Allocated memory is still 69.2MB. Free memory was 35.2MB in the beginning and 33.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.8MB. Max. memory is 16.1GB. [2024-11-12 03:50:14,104 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.26ms. Allocated memory is still 69.2MB. Free memory was 33.5MB in the beginning and 30.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 03:50:14,105 INFO L158 Benchmark]: Boogie Preprocessor took 67.72ms. Allocated memory is still 69.2MB. Free memory was 30.9MB in the beginning and 27.2MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 03:50:14,105 INFO L158 Benchmark]: RCFGBuilder took 728.70ms. Allocated memory is still 69.2MB. Free memory was 26.9MB in the beginning and 26.5MB in the end (delta: 437.5kB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2024-11-12 03:50:14,106 INFO L158 Benchmark]: TraceAbstraction took 2932.58ms. Allocated memory was 69.2MB in the beginning and 104.9MB in the end (delta: 35.7MB). Free memory was 26.1MB in the beginning and 53.4MB in the end (delta: -27.3MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2024-11-12 03:50:14,110 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 52.4MB. Free memory is still 29.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 448.55ms. Allocated memory is still 69.2MB. Free memory was 35.2MB in the beginning and 33.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.26ms. Allocated memory is still 69.2MB. Free memory was 33.5MB in the beginning and 30.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.72ms. Allocated memory is still 69.2MB. Free memory was 30.9MB in the beginning and 27.2MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 728.70ms. Allocated memory is still 69.2MB. Free memory was 26.9MB in the beginning and 26.5MB in the end (delta: 437.5kB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. * TraceAbstraction took 2932.58ms. Allocated memory was 69.2MB in the beginning and 104.9MB in the end (delta: 35.7MB). Free memory was 26.1MB in the beginning and 53.4MB in the end (delta: -27.3MB). Peak memory consumption was 9.2MB. 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-11-12 03:50:14,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ArithmeticException: BigInteger out of int range