./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-21.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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_fillercodesize_normal_file-21.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 dd3e509a85a1a145df13b25b31acf4786a0b4df9db3cb7a4b510e8d9ede3e75f --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 19:54:59,550 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:54:59,619 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 19:54:59,623 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:54:59,623 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:54:59,654 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:54:59,655 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:54:59,655 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:54:59,656 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:54:59,657 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:54:59,659 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:54:59,659 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:54:59,660 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:54:59,660 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:54:59,660 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:54:59,661 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:54:59,661 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:54:59,661 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:54:59,661 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:54:59,662 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:54:59,663 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:54:59,663 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:54:59,663 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:54:59,663 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:54:59,664 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:54:59,664 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:54:59,664 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:54:59,664 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:54:59,664 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:54:59,664 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:54:59,665 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:54:59,665 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:54:59,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:54:59,665 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:54:59,665 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:54:59,665 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:54:59,666 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 19:54:59,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:54:59,666 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:54:59,667 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:54:59,667 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:54:59,668 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:54:59,668 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 -> dd3e509a85a1a145df13b25b31acf4786a0b4df9db3cb7a4b510e8d9ede3e75f [2024-11-08 19:54:59,887 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:54:59,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:54:59,908 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:54:59,909 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:54:59,910 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:54:59,911 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-21.i [2024-11-08 19:55:01,276 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:55:01,463 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:55:01,464 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-21.i [2024-11-08 19:55:01,475 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8743cd92/536337f473d14431bd5c82bb8992e625/FLAG62c41fb75 [2024-11-08 19:55:01,490 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8743cd92/536337f473d14431bd5c82bb8992e625 [2024-11-08 19:55:01,492 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:55:01,494 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:55:01,496 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:55:01,497 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:55:01,501 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:55:01,502 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:55:01" (1/1) ... [2024-11-08 19:55:01,503 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32344db0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:55:01, skipping insertion in model container [2024-11-08 19:55:01,503 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:55:01" (1/1) ... [2024-11-08 19:55:01,530 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:55:01,692 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_fillercodesize_normal_file-21.i[913,926] [2024-11-08 19:55:01,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:55:01,804 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:55:01,812 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_fillercodesize_normal_file-21.i[913,926] [2024-11-08 19:55:01,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:55:01,855 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:55:01,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:55:01 WrapperNode [2024-11-08 19:55:01,855 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:55:01,856 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:55:01,856 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:55:01,857 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:55:01,862 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:55:01" (1/1) ... [2024-11-08 19:55:01,874 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:55:01" (1/1) ... [2024-11-08 19:55:01,909 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 177 [2024-11-08 19:55:01,909 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:55:01,910 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:55:01,910 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:55:01,910 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:55:01,920 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:55:01" (1/1) ... [2024-11-08 19:55:01,920 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:55:01" (1/1) ... [2024-11-08 19:55:01,923 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:55:01" (1/1) ... [2024-11-08 19:55:01,942 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-08 19:55:01,942 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:55:01" (1/1) ... [2024-11-08 19:55:01,942 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:55:01" (1/1) ... [2024-11-08 19:55:01,962 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:55:01" (1/1) ... [2024-11-08 19:55:01,964 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:55:01" (1/1) ... [2024-11-08 19:55:01,969 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:55:01" (1/1) ... [2024-11-08 19:55:01,971 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:55:01" (1/1) ... [2024-11-08 19:55:01,980 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:55:01,981 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:55:01,981 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:55:01,982 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:55:01,982 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:55:01" (1/1) ... [2024-11-08 19:55:01,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:55:02,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:55:02,020 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-08 19:55:02,023 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-08 19:55:02,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:55:02,060 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 19:55:02,060 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 19:55:02,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 19:55:02,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:55:02,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:55:02,125 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:55:02,127 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:55:02,411 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-08 19:55:02,412 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:55:02,428 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:55:02,429 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:55:02,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:55:02 BoogieIcfgContainer [2024-11-08 19:55:02,431 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:55:02,434 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:55:02,434 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:55:02,437 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:55:02,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:55:01" (1/3) ... [2024-11-08 19:55:02,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ccea048 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:55:02, skipping insertion in model container [2024-11-08 19:55:02,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:55:01" (2/3) ... [2024-11-08 19:55:02,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ccea048 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:55:02, skipping insertion in model container [2024-11-08 19:55:02,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:55:02" (3/3) ... [2024-11-08 19:55:02,439 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-21.i [2024-11-08 19:55:02,453 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:55:02,453 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:55:02,520 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:55:02,526 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;@3dd6a993, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:55:02,526 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:55:02,530 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 50 states have internal predecessors, (65), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 19:55:02,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-08 19:55:02,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:55:02,545 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:55:02,545 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:55:02,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:55:02,550 INFO L85 PathProgramCache]: Analyzing trace with hash 767436212, now seen corresponding path program 1 times [2024-11-08 19:55:02,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:55:02,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112965012] [2024-11-08 19:55:02,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:55:02,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:55:02,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:02,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:55:02,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:02,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:55:02,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:02,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:55:02,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:02,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:55:02,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:02,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:55:02,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:02,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:55:02,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:02,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:55:02,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:02,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:55:02,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:02,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:55:02,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:02,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:55:02,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:02,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:55:02,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:02,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:55:02,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:02,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:55:02,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:02,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 19:55:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:02,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:55:02,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:02,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 19:55:02,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:02,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 19:55:02,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:02,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 19:55:02,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:02,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 19:55:02,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:02,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 19:55:02,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:02,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 19:55:02,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:02,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 19:55:02,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:02,976 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 19:55:02,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:55:02,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112965012] [2024-11-08 19:55:02,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112965012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:55:02,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:55:02,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:55:02,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098941042] [2024-11-08 19:55:02,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:55:02,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 19:55:02,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:55:03,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 19:55:03,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:55:03,005 INFO L87 Difference]: Start difference. First operand has 74 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 50 states have internal predecessors, (65), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-08 19:55:03,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:55:03,027 INFO L93 Difference]: Finished difference Result 141 states and 234 transitions. [2024-11-08 19:55:03,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 19:55:03,029 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 144 [2024-11-08 19:55:03,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:55:03,035 INFO L225 Difference]: With dead ends: 141 [2024-11-08 19:55:03,035 INFO L226 Difference]: Without dead ends: 70 [2024-11-08 19:55:03,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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-08 19:55:03,040 INFO L432 NwaCegarLoop]: 102 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, 102 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-08 19:55:03,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:55:03,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-08 19:55:03,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-08 19:55:03,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 states have internal predecessors, (58), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 19:55:03,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 102 transitions. [2024-11-08 19:55:03,086 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 102 transitions. Word has length 144 [2024-11-08 19:55:03,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:55:03,087 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 102 transitions. [2024-11-08 19:55:03,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-08 19:55:03,088 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 102 transitions. [2024-11-08 19:55:03,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-08 19:55:03,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:55:03,090 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:55:03,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 19:55:03,091 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:55:03,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:55:03,091 INFO L85 PathProgramCache]: Analyzing trace with hash -567994260, now seen corresponding path program 1 times [2024-11-08 19:55:03,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:55:03,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386187835] [2024-11-08 19:55:03,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:55:03,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:55:03,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:55:04,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:55:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:55:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:55:04,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:55:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:55:04,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:55:04,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:55:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:55:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:55:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:55:04,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:55:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:55:04,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 19:55:04,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:55:04,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 19:55:04,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 19:55:04,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 19:55:04,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 19:55:04,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 19:55:04,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 19:55:04,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 19:55:04,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,367 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 19:55:04,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:55:04,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386187835] [2024-11-08 19:55:04,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386187835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:55:04,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:55:04,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 19:55:04,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372783815] [2024-11-08 19:55:04,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:55:04,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 19:55:04,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:55:04,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 19:55:04,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:55:04,372 INFO L87 Difference]: Start difference. First operand 70 states and 102 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 19:55:04,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:55:04,678 INFO L93 Difference]: Finished difference Result 205 states and 292 transitions. [2024-11-08 19:55:04,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:55:04,679 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2024-11-08 19:55:04,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:55:04,683 INFO L225 Difference]: With dead ends: 205 [2024-11-08 19:55:04,683 INFO L226 Difference]: Without dead ends: 138 [2024-11-08 19:55:04,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:55:04,687 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 152 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 19:55:04,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 321 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 19:55:04,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-08 19:55:04,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 122. [2024-11-08 19:55:04,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 88 states have (on average 1.3068181818181819) internal successors, (115), 89 states have internal predecessors, (115), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 19:55:04,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 175 transitions. [2024-11-08 19:55:04,715 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 175 transitions. Word has length 144 [2024-11-08 19:55:04,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:55:04,716 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 175 transitions. [2024-11-08 19:55:04,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 19:55:04,717 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 175 transitions. [2024-11-08 19:55:04,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-08 19:55:04,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:55:04,719 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:55:04,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 19:55:04,720 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:55:04,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:55:04,720 INFO L85 PathProgramCache]: Analyzing trace with hash -309828822, now seen corresponding path program 1 times [2024-11-08 19:55:04,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:55:04,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166198878] [2024-11-08 19:55:04,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:55:04,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:55:04,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:55:04,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:55:04,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:55:04,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:55:04,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:55:04,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:55:04,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:55:04,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:55:04,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:55:04,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:55:04,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:55:04,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:55:04,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:55:04,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 19:55:04,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:55:04,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 19:55:04,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 19:55:04,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 19:55:04,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 19:55:04,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 19:55:04,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 19:55:04,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 19:55:04,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,857 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 19:55:04,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:55:04,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166198878] [2024-11-08 19:55:04,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166198878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:55:04,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:55:04,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:55:04,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095923903] [2024-11-08 19:55:04,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:55:04,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:55:04,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:55:04,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:55:04,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:55:04,860 INFO L87 Difference]: Start difference. First operand 122 states and 175 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 19:55:04,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:55:04,883 INFO L93 Difference]: Finished difference Result 231 states and 331 transitions. [2024-11-08 19:55:04,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:55:04,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2024-11-08 19:55:04,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:55:04,889 INFO L225 Difference]: With dead ends: 231 [2024-11-08 19:55:04,889 INFO L226 Difference]: Without dead ends: 112 [2024-11-08 19:55:04,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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-08 19:55:04,893 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:55:04,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 197 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:55:04,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-08 19:55:04,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-08 19:55:04,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 79 states have internal predecessors, (97), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 19:55:04,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 157 transitions. [2024-11-08 19:55:04,914 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 157 transitions. Word has length 144 [2024-11-08 19:55:04,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:55:04,917 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 157 transitions. [2024-11-08 19:55:04,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 19:55:04,917 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 157 transitions. [2024-11-08 19:55:04,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-08 19:55:04,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:55:04,918 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:55:04,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 19:55:04,919 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:55:04,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:55:04,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1579111510, now seen corresponding path program 1 times [2024-11-08 19:55:04,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:55:04,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792072605] [2024-11-08 19:55:04,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:55:04,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:55:04,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:55:04,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:55:04,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:55:04,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:55:04,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:55:04,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:55:04,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:55:04,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:55:04,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:55:04,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:55:04,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:55:04,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:04,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:55:05,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:05,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:55:05,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:05,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 19:55:05,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:05,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:55:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:05,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 19:55:05,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:05,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 19:55:05,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:05,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 19:55:05,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:05,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 19:55:05,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:05,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 19:55:05,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:05,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 19:55:05,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:05,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 19:55:05,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:05,034 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-08 19:55:05,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:55:05,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792072605] [2024-11-08 19:55:05,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792072605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:55:05,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:55:05,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:55:05,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065701903] [2024-11-08 19:55:05,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:55:05,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:55:05,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:55:05,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:55:05,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:55:05,037 INFO L87 Difference]: Start difference. First operand 112 states and 157 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 19:55:05,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:55:05,060 INFO L93 Difference]: Finished difference Result 200 states and 281 transitions. [2024-11-08 19:55:05,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:55:05,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2024-11-08 19:55:05,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:55:05,063 INFO L225 Difference]: With dead ends: 200 [2024-11-08 19:55:05,063 INFO L226 Difference]: Without dead ends: 91 [2024-11-08 19:55:05,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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-08 19:55:05,064 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:55:05,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 188 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:55:05,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-08 19:55:05,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-08 19:55:05,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 58 states have internal predecessors, (66), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 19:55:05,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 126 transitions. [2024-11-08 19:55:05,083 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 126 transitions. Word has length 144 [2024-11-08 19:55:05,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:55:05,084 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 126 transitions. [2024-11-08 19:55:05,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-08 19:55:05,085 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 126 transitions. [2024-11-08 19:55:05,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 19:55:05,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:55:05,087 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:55:05,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 19:55:05,087 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:55:05,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:55:05,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1533203773, now seen corresponding path program 1 times [2024-11-08 19:55:05,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:55:05,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354383197] [2024-11-08 19:55:05,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:55:05,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:55:05,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 19:55:05,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [227554438] [2024-11-08 19:55:05,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:55:05,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:55:05,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:55:05,173 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-08 19:55:05,174 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-08 19:55:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:55:05,304 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:55:05,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:55:05,398 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 19:55:05,399 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 19:55:05,400 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 19:55:05,417 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-08 19:55:05,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:55:05,606 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-08 19:55:05,703 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 19:55:05,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 07:55:05 BoogieIcfgContainer [2024-11-08 19:55:05,705 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 19:55:05,706 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:55:05,706 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:55:05,706 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:55:05,707 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:55:02" (3/4) ... [2024-11-08 19:55:05,712 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 19:55:05,713 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:55:05,713 INFO L158 Benchmark]: Toolchain (without parser) took 4219.47ms. Allocated memory was 165.7MB in the beginning and 224.4MB in the end (delta: 58.7MB). Free memory was 95.7MB in the beginning and 122.0MB in the end (delta: -26.2MB). Peak memory consumption was 35.6MB. Max. memory is 16.1GB. [2024-11-08 19:55:05,714 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 117.4MB. Free memory is still 83.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:55:05,714 INFO L158 Benchmark]: CACSL2BoogieTranslator took 359.74ms. Allocated memory is still 165.7MB. Free memory was 95.7MB in the beginning and 133.0MB in the end (delta: -37.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 19:55:05,714 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.22ms. Allocated memory is still 165.7MB. Free memory was 133.0MB in the beginning and 128.1MB in the end (delta: 4.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 19:55:05,714 INFO L158 Benchmark]: Boogie Preprocessor took 70.69ms. Allocated memory is still 165.7MB. Free memory was 128.1MB in the beginning and 121.2MB in the end (delta: 7.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 19:55:05,714 INFO L158 Benchmark]: RCFGBuilder took 449.53ms. Allocated memory is still 165.7MB. Free memory was 121.2MB in the beginning and 96.1MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-08 19:55:05,715 INFO L158 Benchmark]: TraceAbstraction took 3271.54ms. Allocated memory was 165.7MB in the beginning and 224.4MB in the end (delta: 58.7MB). Free memory was 95.4MB in the beginning and 122.0MB in the end (delta: -26.5MB). Peak memory consumption was 35.1MB. Max. memory is 16.1GB. [2024-11-08 19:55:05,715 INFO L158 Benchmark]: Witness Printer took 7.19ms. Allocated memory is still 224.4MB. Free memory is still 122.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:55:05,716 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 117.4MB. Free memory is still 83.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 359.74ms. Allocated memory is still 165.7MB. Free memory was 95.7MB in the beginning and 133.0MB in the end (delta: -37.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.22ms. Allocated memory is still 165.7MB. Free memory was 133.0MB in the beginning and 128.1MB in the end (delta: 4.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.69ms. Allocated memory is still 165.7MB. Free memory was 128.1MB in the beginning and 121.2MB in the end (delta: 7.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 449.53ms. Allocated memory is still 165.7MB. Free memory was 121.2MB in the beginning and 96.1MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3271.54ms. Allocated memory was 165.7MB in the beginning and 224.4MB in the end (delta: 58.7MB). Free memory was 95.4MB in the beginning and 122.0MB in the end (delta: -26.5MB). Peak memory consumption was 35.1MB. Max. memory is 16.1GB. * Witness Printer took 7.19ms. Allocated memory is still 224.4MB. Free memory is still 122.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 129, overapproximation of someBinaryArithmeticDOUBLEoperation at line 68. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 10; [L23] signed char var_1_3 = 1; [L24] signed char var_1_4 = 100; [L25] signed char var_1_5 = 5; [L26] signed char var_1_6 = 32; [L27] signed char var_1_7 = 32; [L28] unsigned short int var_1_8 = 8; [L29] unsigned short int var_1_10 = 21451; [L30] unsigned char var_1_12 = 8; [L31] unsigned short int var_1_13 = 16; [L32] unsigned short int var_1_16 = 53444; [L33] unsigned char var_1_17 = 0; [L34] unsigned char var_1_18 = 0; [L35] double var_1_19 = 1.2; [L36] signed char var_1_20 = 1; [L37] double var_1_21 = 10.5; [L38] double var_1_22 = 0.0; [L39] double var_1_23 = 10.4; [L40] double var_1_24 = 50.5; [L41] unsigned short int var_1_25 = 2; [L42] unsigned short int last_1_var_1_8 = 8; [L43] unsigned char last_1_var_1_12 = 8; [L44] unsigned short int last_1_var_1_13 = 16; [L45] unsigned char last_1_var_1_17 = 0; [L46] unsigned short int last_1_var_1_25 = 2; VAL [isInitial=0, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L133] isInitial = 1 [L134] FCALL initially() [L135] COND TRUE 1 [L136] CALL updateLastVariables() [L122] last_1_var_1_8 = var_1_8 [L123] last_1_var_1_12 = var_1_12 [L124] last_1_var_1_13 = var_1_13 [L125] last_1_var_1_17 = var_1_17 [L126] last_1_var_1_25 = var_1_25 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L136] RET updateLastVariables() [L137] CALL updateVariables() [L85] var_1_3 = __VERIFIER_nondet_char() [L86] CALL assume_abort_if_not(var_1_3 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L86] RET assume_abort_if_not(var_1_3 >= -127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L87] CALL assume_abort_if_not(var_1_3 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L87] RET assume_abort_if_not(var_1_3 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=100, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L88] var_1_4 = __VERIFIER_nondet_char() [L89] CALL assume_abort_if_not(var_1_4 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L89] RET assume_abort_if_not(var_1_4 >= -127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L90] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L90] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=5, var_1_6=32, var_1_7=32, var_1_8=8] [L91] var_1_5 = __VERIFIER_nondet_char() [L92] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=32, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=32, var_1_7=32, var_1_8=8] [L92] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=32, var_1_7=32, var_1_8=8] [L93] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=32, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=32, var_1_7=32, var_1_8=8] [L93] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=32, var_1_7=32, var_1_8=8] [L94] var_1_6 = __VERIFIER_nondet_char() [L95] CALL assume_abort_if_not(var_1_6 >= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=32, var_1_8=8] [L95] RET assume_abort_if_not(var_1_6 >= 31) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=32, var_1_8=8] [L96] CALL assume_abort_if_not(var_1_6 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=32, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=32, var_1_8=8] [L96] RET assume_abort_if_not(var_1_6 <= 63) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=32, var_1_8=8] [L97] var_1_7 = __VERIFIER_nondet_char() [L98] 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=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L98] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L99] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L99] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=21451, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L100] var_1_10 = __VERIFIER_nondet_ushort() [L101] CALL assume_abort_if_not(var_1_10 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L101] RET assume_abort_if_not(var_1_10 >= 16383) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L102] 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=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L102] RET assume_abort_if_not(var_1_10 <= 32767) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=53444, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L103] var_1_16 = __VERIFIER_nondet_ushort() [L104] CALL assume_abort_if_not(var_1_16 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L104] RET assume_abort_if_not(var_1_16 >= 32767) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L105] CALL assume_abort_if_not(var_1_16 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L105] RET assume_abort_if_not(var_1_16 <= 65534) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L106] var_1_18 = __VERIFIER_nondet_uchar() [L107] 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=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L107] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L108] 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=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L108] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=1, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L109] var_1_20 = __VERIFIER_nondet_char() [L110] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L110] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L111] CALL assume_abort_if_not(var_1_20 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L111] RET assume_abort_if_not(var_1_20 <= 127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_21=21/2, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L112] var_1_21 = __VERIFIER_nondet_double() [L113] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L113] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_22=0, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L114] var_1_22 = __VERIFIER_nondet_double() [L115] CALL assume_abort_if_not((var_1_22 >= 4611686.018427382800e+12F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L115] RET assume_abort_if_not((var_1_22 >= 4611686.018427382800e+12F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_23=52/5, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L116] var_1_23 = __VERIFIER_nondet_double() [L117] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L117] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_24=101/2, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L118] var_1_24 = __VERIFIER_nondet_double() [L119] CALL assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L119] RET assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_25=2, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L137] RET updateVariables() [L138] CALL step() [L50] COND TRUE (last_1_var_1_8 < last_1_var_1_13) || last_1_var_1_17 [L51] var_1_25 = (((((last_1_var_1_12) > (last_1_var_1_12)) ? (last_1_var_1_12) : (last_1_var_1_12))) + var_1_7) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_25=8, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L55] signed long int stepLocal_1 = last_1_var_1_13; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, stepLocal_1=16, var_1_10=-49153, var_1_12=8, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_25=8, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L56] COND TRUE last_1_var_1_13 == stepLocal_1 [L57] var_1_12 = ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=0, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_25=8, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=8] [L59] var_1_8 = (((var_1_7 + var_1_6) + var_1_12) + (var_1_10 - var_1_12)) [L60] signed long int stepLocal_0 = -1000000; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, stepLocal_0=-1000000, var_1_10=-49153, var_1_12=0, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=10, var_1_20=126, var_1_25=8, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=16446] [L61] COND TRUE var_1_8 >= stepLocal_0 [L62] var_1_1 = ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=0, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=1, var_1_20=126, var_1_25=8, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=16446] [L66] signed char stepLocal_3 = var_1_1; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, stepLocal_3=1, var_1_10=-49153, var_1_12=0, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_19=6/5, var_1_1=1, var_1_20=126, var_1_25=8, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=16446] [L67] COND TRUE stepLocal_3 >= (var_1_5 - var_1_20) [L68] var_1_19 = (((((var_1_21) < ((var_1_22 - var_1_23))) ? (var_1_21) : ((var_1_22 - var_1_23)))) - var_1_24) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=0, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=1, var_1_20=126, var_1_25=8, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=16446] [L70] COND TRUE ((((((((last_1_var_1_12) > (var_1_6)) ? (last_1_var_1_12) : (var_1_6)))) < (last_1_var_1_8)) ? (((((last_1_var_1_12) > (var_1_6)) ? (last_1_var_1_12) : (var_1_6)))) : (last_1_var_1_8))) > (var_1_3 * last_1_var_1_25) [L71] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=0, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=1, var_1_20=126, var_1_25=8, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=16446] [L73] unsigned short int stepLocal_2 = var_1_25; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, stepLocal_2=8, var_1_10=-49153, var_1_12=0, var_1_13=16, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=1, var_1_20=126, var_1_25=8, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=16446] [L74] COND FALSE !(\read(var_1_17)) [L81] var_1_13 = (var_1_16 - var_1_10) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, stepLocal_2=8, var_1_10=-49153, var_1_12=0, var_1_13=16384, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=1, var_1_20=126, var_1_25=8, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=16446] [L138] RET step() [L139] CALL, EXPR property() [L129] EXPR ((((var_1_8 >= -1000000) ? (var_1_1 == ((signed char) ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) : (var_1_1 == ((signed char) (var_1_5 - ((var_1_6 - 8) + var_1_7))))) && (var_1_8 == ((unsigned short int) (((var_1_7 + var_1_6) + var_1_12) + (var_1_10 - var_1_12))))) && ((last_1_var_1_13 == last_1_var_1_13) ? (var_1_12 == ((unsigned char) ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))))) : 1)) && (var_1_17 ? ((((var_1_10 + var_1_12) << var_1_5) < var_1_25) ? (var_1_13 == ((unsigned short int) ((((var_1_7) < (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6)))))))) ? (var_1_7) : (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))))))))) : (var_1_13 == ((unsigned short int) (var_1_16 - (var_1_12 + var_1_12))))) : (var_1_13 == ((unsigned short int) (var_1_16 - var_1_10)))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=0, var_1_13=16384, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=1, var_1_20=126, var_1_25=8, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=16446] [L129] EXPR var_1_17 ? ((((var_1_10 + var_1_12) << var_1_5) < var_1_25) ? (var_1_13 == ((unsigned short int) ((((var_1_7) < (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6)))))))) ? (var_1_7) : (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))))))))) : (var_1_13 == ((unsigned short int) (var_1_16 - (var_1_12 + var_1_12))))) : (var_1_13 == ((unsigned short int) (var_1_16 - var_1_10))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=0, var_1_13=16384, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=1, var_1_20=126, var_1_25=8, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=16446] [L129] EXPR ((((var_1_8 >= -1000000) ? (var_1_1 == ((signed char) ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) : (var_1_1 == ((signed char) (var_1_5 - ((var_1_6 - 8) + var_1_7))))) && (var_1_8 == ((unsigned short int) (((var_1_7 + var_1_6) + var_1_12) + (var_1_10 - var_1_12))))) && ((last_1_var_1_13 == last_1_var_1_13) ? (var_1_12 == ((unsigned char) ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))))) : 1)) && (var_1_17 ? ((((var_1_10 + var_1_12) << var_1_5) < var_1_25) ? (var_1_13 == ((unsigned short int) ((((var_1_7) < (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6)))))))) ? (var_1_7) : (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))))))))) : (var_1_13 == ((unsigned short int) (var_1_16 - (var_1_12 + var_1_12))))) : (var_1_13 == ((unsigned short int) (var_1_16 - var_1_10)))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=0, var_1_13=16384, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=1, var_1_20=126, var_1_25=8, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=16446] [L129-L130] return (((((((var_1_8 >= -1000000) ? (var_1_1 == ((signed char) ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) : (var_1_1 == ((signed char) (var_1_5 - ((var_1_6 - 8) + var_1_7))))) && (var_1_8 == ((unsigned short int) (((var_1_7 + var_1_6) + var_1_12) + (var_1_10 - var_1_12))))) && ((last_1_var_1_13 == last_1_var_1_13) ? (var_1_12 == ((unsigned char) ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))))) : 1)) && (var_1_17 ? ((((var_1_10 + var_1_12) << var_1_5) < var_1_25) ? (var_1_13 == ((unsigned short int) ((((var_1_7) < (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6)))))))) ? (var_1_7) : (((((var_1_12) > (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))) ? (var_1_12) : (((((var_1_12) < (var_1_6)) ? (var_1_12) : (var_1_6))))))))))) : (var_1_13 == ((unsigned short int) (var_1_16 - (var_1_12 + var_1_12))))) : (var_1_13 == ((unsigned short int) (var_1_16 - var_1_10))))) && ((((((((((last_1_var_1_12) > (var_1_6)) ? (last_1_var_1_12) : (var_1_6)))) < (last_1_var_1_8)) ? (((((last_1_var_1_12) > (var_1_6)) ? (last_1_var_1_12) : (var_1_6)))) : (last_1_var_1_8))) > (var_1_3 * last_1_var_1_25)) ? (var_1_17 == ((unsigned char) var_1_18)) : 1)) && ((var_1_1 >= (var_1_5 - var_1_20)) ? (var_1_19 == ((double) (((((var_1_21) < ((var_1_22 - var_1_23))) ? (var_1_21) : ((var_1_22 - var_1_23)))) - var_1_24))) : 1)) && (((last_1_var_1_8 < last_1_var_1_13) || last_1_var_1_17) ? (var_1_25 == ((unsigned short int) (((((last_1_var_1_12) > (last_1_var_1_12)) ? (last_1_var_1_12) : (last_1_var_1_12))) + var_1_7))) : (var_1_25 == ((unsigned short int) var_1_7))) ; [L139] RET, EXPR property() [L139] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=0, var_1_13=16384, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=1, var_1_20=126, var_1_25=8, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=16446] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=16, last_1_var_1_17=0, last_1_var_1_25=2, last_1_var_1_8=8, var_1_10=-49153, var_1_12=0, var_1_13=16384, var_1_16=-32769, var_1_17=0, var_1_18=0, var_1_1=1, var_1_20=126, var_1_25=8, var_1_3=1, var_1_4=1, var_1_5=-1, var_1_6=63, var_1_7=0, var_1_8=16446] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 74 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 5, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 152 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 152 mSDsluCounter, 808 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 396 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 124 IncrementalHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 412 mSDtfsCounter, 124 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 213 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=2, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 16 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 868 NumberOfCodeBlocks, 868 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 572 ConstructedInterpolants, 0 QuantifiedInterpolants, 1265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 3696/3696 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-08 19:55:05,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-21.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 dd3e509a85a1a145df13b25b31acf4786a0b4df9db3cb7a4b510e8d9ede3e75f --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 19:55:07,685 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:55:07,745 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 19:55:07,748 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:55:07,749 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:55:07,776 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:55:07,776 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:55:07,777 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:55:07,777 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:55:07,778 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:55:07,778 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:55:07,778 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:55:07,779 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:55:07,779 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:55:07,779 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:55:07,779 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:55:07,780 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:55:07,780 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:55:07,780 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:55:07,780 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:55:07,781 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:55:07,781 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:55:07,781 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:55:07,782 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 19:55:07,782 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 19:55:07,782 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:55:07,782 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 19:55:07,783 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:55:07,783 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:55:07,783 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:55:07,783 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:55:07,784 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:55:07,784 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:55:07,784 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:55:07,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:55:07,785 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:55:07,785 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:55:07,785 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:55:07,785 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 19:55:07,785 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 19:55:07,786 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:55:07,789 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:55:07,789 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:55:07,789 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:55:07,789 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 -> dd3e509a85a1a145df13b25b31acf4786a0b4df9db3cb7a4b510e8d9ede3e75f [2024-11-08 19:55:08,061 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:55:08,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:55:08,082 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:55:08,084 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:55:08,084 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:55:08,085 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-21.i [2024-11-08 19:55:09,466 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:55:09,639 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:55:09,640 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-21.i [2024-11-08 19:55:09,650 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d191ca8d/b5d478951b3147fa9207e1897846d38a/FLAG2661774ea [2024-11-08 19:55:10,033 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d191ca8d/b5d478951b3147fa9207e1897846d38a [2024-11-08 19:55:10,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:55:10,037 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:55:10,038 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:55:10,038 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:55:10,042 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:55:10,042 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:55:10" (1/1) ... [2024-11-08 19:55:10,043 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b9a9d6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:55:10, skipping insertion in model container [2024-11-08 19:55:10,043 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:55:10" (1/1) ... [2024-11-08 19:55:10,074 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:55:10,213 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_fillercodesize_normal_file-21.i[913,926] [2024-11-08 19:55:10,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:55:10,293 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:55:10,302 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_fillercodesize_normal_file-21.i[913,926] [2024-11-08 19:55:10,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:55:10,346 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:55:10,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:55:10 WrapperNode [2024-11-08 19:55:10,347 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:55:10,347 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:55:10,347 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:55:10,348 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:55:10,353 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:55:10" (1/1) ... [2024-11-08 19:55:10,362 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:55:10" (1/1) ... [2024-11-08 19:55:10,395 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 147 [2024-11-08 19:55:10,396 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:55:10,396 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:55:10,397 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:55:10,397 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:55:10,406 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:55:10" (1/1) ... [2024-11-08 19:55:10,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:55:10" (1/1) ... [2024-11-08 19:55:10,409 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:55:10" (1/1) ... [2024-11-08 19:55:10,419 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-08 19:55:10,420 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:55:10" (1/1) ... [2024-11-08 19:55:10,420 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:55:10" (1/1) ... [2024-11-08 19:55:10,427 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:55:10" (1/1) ... [2024-11-08 19:55:10,431 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:55:10" (1/1) ... [2024-11-08 19:55:10,433 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:55:10" (1/1) ... [2024-11-08 19:55:10,434 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:55:10" (1/1) ... [2024-11-08 19:55:10,440 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:55:10,441 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:55:10,441 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:55:10,441 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:55:10,442 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:55:10" (1/1) ... [2024-11-08 19:55:10,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:55:10,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:55:10,469 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-08 19:55:10,471 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-08 19:55:10,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:55:10,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 19:55:10,506 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 19:55:10,506 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 19:55:10,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:55:10,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:55:10,572 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:55:10,574 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:55:12,406 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-08 19:55:12,406 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:55:12,420 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:55:12,422 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:55:12,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:55:12 BoogieIcfgContainer [2024-11-08 19:55:12,423 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:55:12,424 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:55:12,425 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:55:12,429 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:55:12,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:55:10" (1/3) ... [2024-11-08 19:55:12,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4670b8ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:55:12, skipping insertion in model container [2024-11-08 19:55:12,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:55:10" (2/3) ... [2024-11-08 19:55:12,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4670b8ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:55:12, skipping insertion in model container [2024-11-08 19:55:12,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:55:12" (3/3) ... [2024-11-08 19:55:12,432 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-21.i [2024-11-08 19:55:12,447 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:55:12,448 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:55:12,499 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:55:12,505 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;@22c3d61d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:55:12,505 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:55:12,509 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 40 states have (on average 1.3) internal successors, (52), 41 states have internal predecessors, (52), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 19:55:12,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-08 19:55:12,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:55:12,521 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:55:12,521 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:55:12,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:55:12,525 INFO L85 PathProgramCache]: Analyzing trace with hash 78302029, now seen corresponding path program 1 times [2024-11-08 19:55:12,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:55:12,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [435070377] [2024-11-08 19:55:12,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:55:12,537 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-08 19:55:12,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:55:12,538 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-08 19:55:12,539 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-08 19:55:12,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:12,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 19:55:12,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:55:12,865 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2024-11-08 19:55:12,866 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:55:12,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:55:12,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [435070377] [2024-11-08 19:55:12,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [435070377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:55:12,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:55:12,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:55:12,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300772702] [2024-11-08 19:55:12,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:55:12,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 19:55:12,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:55:12,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 19:55:12,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:55:12,893 INFO L87 Difference]: Start difference. First operand has 65 states, 40 states have (on average 1.3) internal successors, (52), 41 states have internal predecessors, (52), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-08 19:55:12,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:55:12,915 INFO L93 Difference]: Finished difference Result 123 states and 208 transitions. [2024-11-08 19:55:12,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 19:55:12,918 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 142 [2024-11-08 19:55:12,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:55:12,926 INFO L225 Difference]: With dead ends: 123 [2024-11-08 19:55:12,926 INFO L226 Difference]: Without dead ends: 61 [2024-11-08 19:55:12,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 141 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-08 19:55:12,933 INFO L432 NwaCegarLoop]: 89 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, 89 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-08 19:55:12,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:55:12,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-08 19:55:12,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-08 19:55:12,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-08 19:55:12,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 89 transitions. [2024-11-08 19:55:12,970 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 89 transitions. Word has length 142 [2024-11-08 19:55:12,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:55:12,970 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 89 transitions. [2024-11-08 19:55:12,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-08 19:55:12,971 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 89 transitions. [2024-11-08 19:55:12,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-08 19:55:12,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:55:12,976 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:55:12,986 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-08 19:55:13,177 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-08 19:55:13,177 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:55:13,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:55:13,179 INFO L85 PathProgramCache]: Analyzing trace with hash 18811909, now seen corresponding path program 1 times [2024-11-08 19:55:13,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:55:13,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1014946764] [2024-11-08 19:55:13,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:55:13,180 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-08 19:55:13,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:55:13,183 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-08 19:55:13,184 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-08 19:55:13,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:55:13,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-08 19:55:13,771 INFO L278 TraceCheckSpWp]: Computing forward predicates...