./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-93.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-93.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 0b4b5d2686d562ffab925bc58c06e2224d5b954bce598127bceb38c9dd65a7c9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 00:30:32,566 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 00:30:32,654 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 00:30:32,659 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 00:30:32,660 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 00:30:32,692 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 00:30:32,697 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 00:30:32,698 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 00:30:32,699 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 00:30:32,700 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 00:30:32,700 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 00:30:32,700 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 00:30:32,701 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 00:30:32,704 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 00:30:32,704 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 00:30:32,705 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 00:30:32,705 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 00:30:32,705 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 00:30:32,706 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 00:30:32,706 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 00:30:32,706 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 00:30:32,711 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 00:30:32,711 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 00:30:32,711 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 00:30:32,711 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 00:30:32,711 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 00:30:32,712 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 00:30:32,712 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 00:30:32,712 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 00:30:32,713 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 00:30:32,713 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 00:30:32,713 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 00:30:32,713 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:30:32,714 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 00:30:32,714 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 00:30:32,715 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 00:30:32,716 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 00:30:32,716 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 00:30:32,717 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 00:30:32,717 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 00:30:32,717 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 00:30:32,718 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 00:30:32,718 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 -> 0b4b5d2686d562ffab925bc58c06e2224d5b954bce598127bceb38c9dd65a7c9 [2024-10-13 00:30:32,943 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 00:30:32,964 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 00:30:32,967 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 00:30:32,968 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 00:30:32,968 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 00:30:32,969 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-93.i [2024-10-13 00:30:34,545 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 00:30:34,837 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 00:30:34,837 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-93.i [2024-10-13 00:30:34,855 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b571cf351/e209a629685049fe8d122d7c7b0003ff/FLAG4ed858178 [2024-10-13 00:30:35,168 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b571cf351/e209a629685049fe8d122d7c7b0003ff [2024-10-13 00:30:35,171 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 00:30:35,172 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 00:30:35,176 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 00:30:35,176 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 00:30:35,184 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 00:30:35,185 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:30:35" (1/1) ... [2024-10-13 00:30:35,186 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35bfde8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:35, skipping insertion in model container [2024-10-13 00:30:35,186 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:30:35" (1/1) ... [2024-10-13 00:30:35,228 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 00:30:35,472 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-93.i[913,926] [2024-10-13 00:30:35,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:30:35,581 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 00:30:35,599 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-93.i[913,926] [2024-10-13 00:30:35,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:30:35,735 INFO L204 MainTranslator]: Completed translation [2024-10-13 00:30:35,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:35 WrapperNode [2024-10-13 00:30:35,738 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 00:30:35,739 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 00:30:35,740 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 00:30:35,740 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 00:30:35,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:35" (1/1) ... [2024-10-13 00:30:35,764 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:35" (1/1) ... [2024-10-13 00:30:35,816 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 163 [2024-10-13 00:30:35,817 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 00:30:35,818 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 00:30:35,821 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 00:30:35,821 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 00:30:35,840 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:35" (1/1) ... [2024-10-13 00:30:35,844 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:35" (1/1) ... [2024-10-13 00:30:35,846 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:35" (1/1) ... [2024-10-13 00:30:35,873 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 00:30:35,876 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:35" (1/1) ... [2024-10-13 00:30:35,876 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:35" (1/1) ... [2024-10-13 00:30:35,892 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:35" (1/1) ... [2024-10-13 00:30:35,903 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:35" (1/1) ... [2024-10-13 00:30:35,905 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:35" (1/1) ... [2024-10-13 00:30:35,913 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:35" (1/1) ... [2024-10-13 00:30:35,918 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 00:30:35,923 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 00:30:35,923 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 00:30:35,923 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 00:30:35,924 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:35" (1/1) ... [2024-10-13 00:30:35,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:30:35,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:30:35,993 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 00:30:36,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 00:30:36,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 00:30:36,080 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 00:30:36,081 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 00:30:36,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 00:30:36,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 00:30:36,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 00:30:36,215 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 00:30:36,224 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 00:30:36,566 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-13 00:30:36,567 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 00:30:36,608 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 00:30:36,609 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 00:30:36,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:30:36 BoogieIcfgContainer [2024-10-13 00:30:36,609 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 00:30:36,612 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 00:30:36,612 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 00:30:36,615 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 00:30:36,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:30:35" (1/3) ... [2024-10-13 00:30:36,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70ea09d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:30:36, skipping insertion in model container [2024-10-13 00:30:36,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:35" (2/3) ... [2024-10-13 00:30:36,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70ea09d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:30:36, skipping insertion in model container [2024-10-13 00:30:36,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:30:36" (3/3) ... [2024-10-13 00:30:36,619 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-93.i [2024-10-13 00:30:36,632 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 00:30:36,632 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 00:30:36,690 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 00:30:36,697 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;@1b544c5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 00:30:36,698 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 00:30:36,702 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 00:30:36,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-13 00:30:36,715 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:30:36,716 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:30:36,717 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:30:36,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:30:36,722 INFO L85 PathProgramCache]: Analyzing trace with hash 660305440, now seen corresponding path program 1 times [2024-10-13 00:30:36,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:30:36,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281887826] [2024-10-13 00:30:36,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:30:36,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:30:36,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:30:37,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 00:30:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 00:30:37,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 00:30:37,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 00:30:37,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 00:30:37,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 00:30:37,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 00:30:37,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 00:30:37,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 00:30:37,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 00:30:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 00:30:37,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 00:30:37,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 00:30:37,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 00:30:37,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 00:30:37,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 00:30:37,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 00:30:37,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 00:30:37,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 00:30:37,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 00:30:37,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 00:30:37,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 00:30:37,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 00:30:37,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 00:30:37,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 00:30:37,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-13 00:30:37,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:30:37,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281887826] [2024-10-13 00:30:37,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281887826] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:30:37,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:30:37,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 00:30:37,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920723974] [2024-10-13 00:30:37,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:30:37,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 00:30:37,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:30:37,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 00:30:37,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:30:37,276 INFO L87 Difference]: Start difference. First operand has 68 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-13 00:30:37,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:30:37,325 INFO L93 Difference]: Finished difference Result 133 states and 238 transitions. [2024-10-13 00:30:37,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 00:30:37,328 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 160 [2024-10-13 00:30:37,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:30:37,337 INFO L225 Difference]: With dead ends: 133 [2024-10-13 00:30:37,338 INFO L226 Difference]: Without dead ends: 66 [2024-10-13 00:30:37,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:30:37,344 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 00:30:37,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 00:30:37,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-13 00:30:37,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-13 00:30:37,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 00:30:37,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 102 transitions. [2024-10-13 00:30:37,390 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 102 transitions. Word has length 160 [2024-10-13 00:30:37,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:30:37,391 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 102 transitions. [2024-10-13 00:30:37,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-13 00:30:37,391 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 102 transitions. [2024-10-13 00:30:37,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-13 00:30:37,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:30:37,394 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:30:37,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 00:30:37,394 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:30:37,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:30:37,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1642639704, now seen corresponding path program 1 times [2024-10-13 00:30:37,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:30:37,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727804212] [2024-10-13 00:30:37,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:30:37,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:30:37,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:30:37,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 00:30:37,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 00:30:37,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 00:30:37,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 00:30:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 00:30:37,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 00:30:37,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 00:30:37,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 00:30:37,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 00:30:37,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 00:30:37,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 00:30:37,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 00:30:37,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 00:30:37,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 00:30:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 00:30:37,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 00:30:37,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 00:30:37,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 00:30:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 00:30:37,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 00:30:37,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 00:30:37,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 00:30:37,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 00:30:37,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 00:30:37,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 00:30:37,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:37,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-13 00:30:37,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:30:37,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727804212] [2024-10-13 00:30:37,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727804212] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:30:37,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:30:37,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 00:30:37,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233649795] [2024-10-13 00:30:37,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:30:37,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 00:30:37,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:30:37,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 00:30:37,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 00:30:37,741 INFO L87 Difference]: Start difference. First operand 66 states and 102 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 00:30:37,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:30:37,808 INFO L93 Difference]: Finished difference Result 161 states and 245 transitions. [2024-10-13 00:30:37,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 00:30:37,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 160 [2024-10-13 00:30:37,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:30:37,811 INFO L225 Difference]: With dead ends: 161 [2024-10-13 00:30:37,813 INFO L226 Difference]: Without dead ends: 96 [2024-10-13 00:30:37,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 00:30:37,816 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 33 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 00:30:37,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 183 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 00:30:37,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-13 00:30:37,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2024-10-13 00:30:37,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 61 states have internal predecessors, (79), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 00:30:37,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 139 transitions. [2024-10-13 00:30:37,841 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 139 transitions. Word has length 160 [2024-10-13 00:30:37,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:30:37,842 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 139 transitions. [2024-10-13 00:30:37,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 00:30:37,844 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 139 transitions. [2024-10-13 00:30:37,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-13 00:30:37,849 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:30:37,849 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:30:37,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 00:30:37,850 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:30:37,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:30:37,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1205716214, now seen corresponding path program 1 times [2024-10-13 00:30:37,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:30:37,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724007117] [2024-10-13 00:30:37,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:30:37,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:30:37,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 00:30:37,966 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 00:30:38,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 00:30:38,177 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 00:30:38,178 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 00:30:38,179 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 00:30:38,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 00:30:38,183 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-13 00:30:38,288 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 00:30:38,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:30:38 BoogieIcfgContainer [2024-10-13 00:30:38,296 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 00:30:38,296 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 00:30:38,296 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 00:30:38,297 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 00:30:38,297 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:30:36" (3/4) ... [2024-10-13 00:30:38,299 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 00:30:38,300 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 00:30:38,301 INFO L158 Benchmark]: Toolchain (without parser) took 3128.21ms. Allocated memory was 169.9MB in the beginning and 262.1MB in the end (delta: 92.3MB). Free memory was 102.1MB in the beginning and 204.5MB in the end (delta: -102.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 00:30:38,303 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 169.9MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 00:30:38,303 INFO L158 Benchmark]: CACSL2BoogieTranslator took 563.11ms. Allocated memory is still 169.9MB. Free memory was 101.9MB in the beginning and 140.1MB in the end (delta: -38.2MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2024-10-13 00:30:38,303 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.71ms. Allocated memory is still 169.9MB. Free memory was 140.1MB in the beginning and 137.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 00:30:38,304 INFO L158 Benchmark]: Boogie Preprocessor took 104.40ms. Allocated memory is still 169.9MB. Free memory was 137.4MB in the beginning and 134.5MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 00:30:38,304 INFO L158 Benchmark]: RCFGBuilder took 686.61ms. Allocated memory is still 169.9MB. Free memory was 134.5MB in the beginning and 112.2MB in the end (delta: 22.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-13 00:30:38,304 INFO L158 Benchmark]: TraceAbstraction took 1683.71ms. Allocated memory was 169.9MB in the beginning and 262.1MB in the end (delta: 92.3MB). Free memory was 111.4MB in the beginning and 205.6MB in the end (delta: -94.1MB). Peak memory consumption was 68.0MB. Max. memory is 16.1GB. [2024-10-13 00:30:38,304 INFO L158 Benchmark]: Witness Printer took 3.74ms. Allocated memory is still 262.1MB. Free memory was 205.6MB in the beginning and 204.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 00:30:38,306 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.14ms. Allocated memory is still 169.9MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 563.11ms. Allocated memory is still 169.9MB. Free memory was 101.9MB in the beginning and 140.1MB in the end (delta: -38.2MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.71ms. Allocated memory is still 169.9MB. Free memory was 140.1MB in the beginning and 137.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 104.40ms. Allocated memory is still 169.9MB. Free memory was 137.4MB in the beginning and 134.5MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 686.61ms. Allocated memory is still 169.9MB. Free memory was 134.5MB in the beginning and 112.2MB in the end (delta: 22.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1683.71ms. Allocated memory was 169.9MB in the beginning and 262.1MB in the end (delta: 92.3MB). Free memory was 111.4MB in the beginning and 205.6MB in the end (delta: -94.1MB). Peak memory consumption was 68.0MB. Max. memory is 16.1GB. * Witness Printer took 3.74ms. Allocated memory is still 262.1MB. Free memory was 205.6MB in the beginning and 204.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 141, overapproximation of someUnaryDOUBLEoperation at line 31. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 0.5; [L23] float var_1_5 = 0.0; [L24] float var_1_6 = 4.2; [L25] float var_1_7 = 31.25; [L26] float var_1_8 = 1.375; [L27] unsigned short int var_1_9 = 32; [L28] unsigned char var_1_10 = 1; [L29] float var_1_11 = 0.625; [L30] unsigned short int var_1_12 = 1; [L31] float var_1_13 = -0.25; [L32] signed short int var_1_14 = 4; [L33] unsigned char var_1_15 = 1; [L34] unsigned char var_1_16 = 0; [L35] signed short int var_1_17 = 8; [L36] signed short int var_1_18 = 5; [L37] signed short int var_1_19 = 128; [L38] signed long int var_1_20 = -50; [L39] signed short int var_1_21 = -16; [L40] signed short int var_1_22 = 16; [L41] signed short int var_1_23 = 32; [L42] signed short int var_1_24 = 2; [L43] signed short int var_1_25 = -4; [L145] isInitial = 1 [L146] FCALL initially() [L147] COND TRUE 1 [L148] FCALL updateLastVariables() [L149] CALL updateVariables() [L96] var_1_5 = __VERIFIER_nondet_float() [L97] CALL assume_abort_if_not((var_1_5 >= 4611686.018427382800e+12F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L97] RET assume_abort_if_not((var_1_5 >= 4611686.018427382800e+12F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_6=21/5, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L98] var_1_6 = __VERIFIER_nondet_float() [L99] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L99] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_7=125/4, var_1_8=11/8, var_1_9=32] [L100] var_1_7 = __VERIFIER_nondet_float() [L101] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_8=11/8, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_8=11/8, var_1_9=32] [L101] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_8=11/8, var_1_9=32] [L102] var_1_8 = __VERIFIER_nondet_float() [L103] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L103] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L104] var_1_10 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L105] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L106] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L106] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=5/8, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L107] var_1_11 = __VERIFIER_nondet_float() [L108] CALL assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L108] RET assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L109] CALL assume_abort_if_not(var_1_11 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L109] RET assume_abort_if_not(var_1_11 != 0.0F) VAL [isInitial=1, var_1_10=1, var_1_12=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L110] var_1_12 = __VERIFIER_nondet_ushort() [L111] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L111] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=1, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L112] CALL assume_abort_if_not(var_1_12 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L112] RET assume_abort_if_not(var_1_12 <= 65534) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L113] var_1_15 = __VERIFIER_nondet_uchar() [L114] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L114] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L115] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L115] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=0, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L116] var_1_16 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L117] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L118] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L118] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=8, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L119] var_1_17 = __VERIFIER_nondet_short() [L120] CALL assume_abort_if_not(var_1_17 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L120] RET assume_abort_if_not(var_1_17 >= -32767) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L121] CALL assume_abort_if_not(var_1_17 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L121] RET assume_abort_if_not(var_1_17 <= 32766) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=5, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L122] var_1_18 = __VERIFIER_nondet_short() [L123] CALL assume_abort_if_not(var_1_18 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=67, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=67, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L123] RET assume_abort_if_not(var_1_18 >= -1) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=67, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L124] CALL assume_abort_if_not(var_1_18 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=67, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=67, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L124] RET assume_abort_if_not(var_1_18 <= 32766) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=67, var_1_19=128, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L125] var_1_19 = __VERIFIER_nondet_short() [L126] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=67, var_1_19=69, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=67, var_1_19=69, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L126] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=67, var_1_19=69, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L127] CALL assume_abort_if_not(var_1_19 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=67, var_1_19=69, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=67, var_1_19=69, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L127] RET assume_abort_if_not(var_1_19 <= 32766) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=67, var_1_19=69, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=16, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L128] var_1_22 = __VERIFIER_nondet_short() [L129] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=67, var_1_19=69, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=67, var_1_19=69, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L129] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=67, var_1_19=69, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L130] CALL assume_abort_if_not(var_1_22 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=67, var_1_19=69, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=67, var_1_19=69, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L130] RET assume_abort_if_not(var_1_22 <= 16383) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=67, var_1_19=69, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=2, var_1_25=-4, var_1_9=32] [L131] var_1_24 = __VERIFIER_nondet_short() [L132] CALL assume_abort_if_not(var_1_24 >= -8192) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=67, var_1_19=69, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=8190, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=67, var_1_19=69, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=8190, var_1_25=-4, var_1_9=32] [L132] RET assume_abort_if_not(var_1_24 >= -8192) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=67, var_1_19=69, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=8190, var_1_25=-4, var_1_9=32] [L133] CALL assume_abort_if_not(var_1_24 <= 8192) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=67, var_1_19=69, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=8190, var_1_25=-4, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=67, var_1_19=69, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=8190, var_1_25=-4, var_1_9=32] [L133] RET assume_abort_if_not(var_1_24 <= 8192) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=67, var_1_19=69, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=8190, var_1_25=-4, var_1_9=32] [L134] var_1_25 = __VERIFIER_nondet_short() [L135] CALL assume_abort_if_not(var_1_25 >= -8191) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=67, var_1_19=69, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=8190, var_1_25=-8191, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=67, var_1_19=69, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=8190, var_1_25=-8191, var_1_9=32] [L135] RET assume_abort_if_not(var_1_25 >= -8191) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=67, var_1_19=69, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=8190, var_1_25=-8191, var_1_9=32] [L136] CALL assume_abort_if_not(var_1_25 <= 8191) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=67, var_1_19=69, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=8190, var_1_25=-8191, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=67, var_1_19=69, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=8190, var_1_25=-8191, var_1_9=32] [L136] RET assume_abort_if_not(var_1_25 <= 8191) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=67, var_1_19=69, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=8190, var_1_25=-8191, var_1_9=32] [L149] RET updateVariables() [L150] CALL step() [L47] COND TRUE \read(var_1_10) [L48] var_1_13 = ((((var_1_7) > (var_1_5)) ? (var_1_7) : (var_1_5))) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_13=8195, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=67, var_1_19=69, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=8190, var_1_25=-8191, var_1_5=8195, var_1_7=8195, var_1_9=32] [L52] unsigned char stepLocal_5 = ! (var_1_10 || var_1_15); VAL [isInitial=1, stepLocal_5=0, var_1_10=1, var_1_12=0, var_1_13=8195, var_1_14=4, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=67, var_1_19=69, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=8190, var_1_25=-8191, var_1_5=8195, var_1_7=8195, var_1_9=32] [L53] COND TRUE stepLocal_5 || var_1_16 [L54] var_1_14 = ((((var_1_17) > ((var_1_18 - var_1_19))) ? (var_1_17) : ((var_1_18 - var_1_19)))) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_13=8195, var_1_14=-2, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=67, var_1_19=69, var_1_1=1/2, var_1_20=-50, var_1_21=-16, var_1_22=0, var_1_23=32, var_1_24=8190, var_1_25=-8191, var_1_5=8195, var_1_7=8195, var_1_9=32] [L56] COND TRUE \read(var_1_15) [L57] var_1_21 = ((var_1_22 + 25) - var_1_19) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_13=8195, var_1_14=-2, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=67, var_1_19=69, var_1_1=1/2, var_1_20=-50, var_1_21=-44, var_1_22=0, var_1_23=32, var_1_24=8190, var_1_25=-8191, var_1_5=8195, var_1_7=8195, var_1_9=32] [L59] COND TRUE \read(var_1_10) [L60] var_1_23 = (var_1_22 + (((((var_1_24) < 0 ) ? -(var_1_24) : (var_1_24))) + var_1_25)) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_13=8195, var_1_14=-2, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=67, var_1_19=69, var_1_1=1/2, var_1_20=-50, var_1_21=-44, var_1_22=0, var_1_23=-1, var_1_24=8190, var_1_25=-8191, var_1_5=8195, var_1_7=8195, var_1_9=32] [L68] unsigned char stepLocal_4 = var_1_13 < (var_1_8 / var_1_11); [L69] unsigned char stepLocal_3 = var_1_13 != var_1_11; VAL [isInitial=1, stepLocal_3=1, stepLocal_4=1, var_1_10=1, var_1_12=0, var_1_13=8195, var_1_14=-2, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=67, var_1_19=69, var_1_1=1/2, var_1_20=-50, var_1_21=-44, var_1_22=0, var_1_23=-1, var_1_24=8190, var_1_25=-8191, var_1_5=8195, var_1_7=8195, var_1_9=32] [L70] COND TRUE var_1_10 || stepLocal_4 VAL [isInitial=1, stepLocal_3=1, var_1_10=1, var_1_12=0, var_1_13=8195, var_1_14=-2, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=67, var_1_19=69, var_1_1=1/2, var_1_20=-50, var_1_21=-44, var_1_22=0, var_1_23=-1, var_1_24=8190, var_1_25=-8191, var_1_5=8195, var_1_7=8195, var_1_9=32] [L71] COND TRUE var_1_10 || stepLocal_3 [L72] var_1_9 = 8 VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_13=8195, var_1_14=-2, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=67, var_1_19=69, var_1_1=1/2, var_1_20=-50, var_1_21=-44, var_1_22=0, var_1_23=-1, var_1_24=8190, var_1_25=-8191, var_1_5=8195, var_1_7=8195, var_1_9=8] [L77] COND TRUE \read(var_1_16) [L78] var_1_20 = (var_1_9 - 50) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_13=8195, var_1_14=-2, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=67, var_1_19=69, var_1_1=1/2, var_1_20=-42, var_1_21=-44, var_1_22=0, var_1_23=-1, var_1_24=8190, var_1_25=-8191, var_1_5=8195, var_1_7=8195, var_1_9=8] [L80] signed short int stepLocal_2 = var_1_21; [L81] signed short int stepLocal_1 = var_1_21; [L82] signed long int stepLocal_0 = var_1_14 - var_1_20; VAL [isInitial=1, stepLocal_0=40, stepLocal_1=-44, stepLocal_2=-44, var_1_10=1, var_1_12=0, var_1_13=8195, var_1_14=-2, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=67, var_1_19=69, var_1_1=1/2, var_1_20=-42, var_1_21=-44, var_1_22=0, var_1_23=-1, var_1_24=8190, var_1_25=-8191, var_1_5=8195, var_1_7=8195, var_1_9=8] [L83] COND FALSE !((var_1_20 + var_1_14) < stepLocal_2) [L92] var_1_1 = var_1_8 VAL [isInitial=1, stepLocal_0=40, stepLocal_1=-44, var_1_10=1, var_1_12=0, var_1_13=8195, var_1_14=-2, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=67, var_1_19=69, var_1_1=8196, var_1_20=-42, var_1_21=-44, var_1_22=0, var_1_23=-1, var_1_24=8190, var_1_25=-8191, var_1_5=8195, var_1_7=8195, var_1_8=8196, var_1_9=8] [L150] RET step() [L151] CALL, EXPR property() [L141-L142] return ((((((((var_1_20 + var_1_14) < var_1_21) ? ((var_1_21 <= (var_1_14 - var_1_20)) ? ((var_1_21 < var_1_14) ? (var_1_1 == ((float) ((var_1_5 - var_1_6) - var_1_7))) : 1) : (var_1_1 == ((float) (((((var_1_6) < (var_1_8)) ? (var_1_6) : (var_1_8))) + 3.25f)))) : (var_1_1 == ((float) var_1_8))) && ((var_1_10 || (var_1_13 < (var_1_8 / var_1_11))) ? ((var_1_10 || (var_1_13 != var_1_11)) ? (var_1_9 == ((unsigned short int) 8)) : 1) : (var_1_9 == ((unsigned short int) var_1_12)))) && (var_1_10 ? (var_1_13 == ((float) ((((var_1_7) > (var_1_5)) ? (var_1_7) : (var_1_5))))) : (var_1_13 == ((float) ((((10.15f) < ((var_1_6 + var_1_8))) ? (10.15f) : ((var_1_6 + var_1_8)))))))) && (((! (var_1_10 || var_1_15)) || var_1_16) ? (var_1_14 == ((signed short int) ((((var_1_17) > ((var_1_18 - var_1_19))) ? (var_1_17) : ((var_1_18 - var_1_19)))))) : 1)) && (var_1_16 ? (var_1_20 == ((signed long int) (var_1_9 - 50))) : 1)) && (var_1_15 ? (var_1_21 == ((signed short int) ((var_1_22 + 25) - var_1_19))) : 1)) && (var_1_10 ? (var_1_23 == ((signed short int) (var_1_22 + (((((var_1_24) < 0 ) ? -(var_1_24) : (var_1_24))) + var_1_25)))) : (var_1_16 ? (var_1_23 == ((signed short int) var_1_24)) : (var_1_23 == ((signed short int) var_1_17)))) ; [L151] RET, EXPR property() [L151] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_13=8195, var_1_14=-2, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=67, var_1_19=69, var_1_1=8196, var_1_20=-42, var_1_21=-44, var_1_22=0, var_1_23=-1, var_1_24=8190, var_1_25=-8191, var_1_5=8195, var_1_7=8195, var_1_8=8196, var_1_9=8] [L19] reach_error() VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_13=8195, var_1_14=-2, var_1_15=1, var_1_16=1, var_1_17=-2, var_1_18=67, var_1_19=69, var_1_1=8196, var_1_20=-42, var_1_21=-44, var_1_22=0, var_1_23=-1, var_1_24=8190, var_1_25=-8191, var_1_5=8195, var_1_7=8195, var_1_8=8196, var_1_9=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 68 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 3, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 33 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 33 mSDsluCounter, 282 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 88 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21 IncrementalHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 194 mSDtfsCounter, 21 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=2, InterpolantAutomatonStates: 5, 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, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 481 NumberOfCodeBlocks, 481 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 318 ConstructedInterpolants, 0 QuantifiedInterpolants, 348 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 2600/2600 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 00:30:38,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-93.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 0b4b5d2686d562ffab925bc58c06e2224d5b954bce598127bceb38c9dd65a7c9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 00:30:40,949 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 00:30:41,040 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 00:30:41,047 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 00:30:41,048 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 00:30:41,079 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 00:30:41,082 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 00:30:41,082 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 00:30:41,083 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 00:30:41,083 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 00:30:41,084 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 00:30:41,084 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 00:30:41,084 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 00:30:41,085 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 00:30:41,085 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 00:30:41,085 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 00:30:41,086 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 00:30:41,086 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 00:30:41,086 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 00:30:41,086 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 00:30:41,087 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 00:30:41,091 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 00:30:41,091 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 00:30:41,092 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 00:30:41,092 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 00:30:41,092 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 00:30:41,093 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 00:30:41,093 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 00:30:41,093 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 00:30:41,093 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 00:30:41,094 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 00:30:41,094 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 00:30:41,097 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 00:30:41,098 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 00:30:41,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:30:41,098 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 00:30:41,098 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 00:30:41,099 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 00:30:41,099 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 00:30:41,099 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 00:30:41,099 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 00:30:41,101 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 00:30:41,101 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 00:30:41,101 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 00:30:41,101 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 00:30:41,102 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 -> 0b4b5d2686d562ffab925bc58c06e2224d5b954bce598127bceb38c9dd65a7c9 [2024-10-13 00:30:41,445 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 00:30:41,474 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 00:30:41,477 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 00:30:41,479 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 00:30:41,481 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 00:30:41,482 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-93.i [2024-10-13 00:30:43,382 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 00:30:43,627 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 00:30:43,628 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-93.i [2024-10-13 00:30:43,642 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1abd221f1/6e345bdd061444889c4263cc18bbc4b8/FLAGe2cbedd71 [2024-10-13 00:30:43,974 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1abd221f1/6e345bdd061444889c4263cc18bbc4b8 [2024-10-13 00:30:43,977 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 00:30:43,978 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 00:30:43,979 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 00:30:43,980 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 00:30:43,984 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 00:30:43,985 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:30:43" (1/1) ... [2024-10-13 00:30:43,986 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52b74548 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:43, skipping insertion in model container [2024-10-13 00:30:43,987 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:30:43" (1/1) ... [2024-10-13 00:30:44,011 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 00:30:44,208 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-93.i[913,926] [2024-10-13 00:30:44,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:30:44,353 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 00:30:44,368 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-93.i[913,926] [2024-10-13 00:30:44,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:30:44,440 INFO L204 MainTranslator]: Completed translation [2024-10-13 00:30:44,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:44 WrapperNode [2024-10-13 00:30:44,441 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 00:30:44,442 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 00:30:44,443 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 00:30:44,443 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 00:30:44,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:44" (1/1) ... [2024-10-13 00:30:44,462 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:44" (1/1) ... [2024-10-13 00:30:44,494 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 157 [2024-10-13 00:30:44,495 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 00:30:44,496 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 00:30:44,496 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 00:30:44,496 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 00:30:44,507 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:44" (1/1) ... [2024-10-13 00:30:44,508 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:44" (1/1) ... [2024-10-13 00:30:44,515 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:44" (1/1) ... [2024-10-13 00:30:44,539 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 00:30:44,540 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:44" (1/1) ... [2024-10-13 00:30:44,540 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:44" (1/1) ... [2024-10-13 00:30:44,559 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:44" (1/1) ... [2024-10-13 00:30:44,563 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:44" (1/1) ... [2024-10-13 00:30:44,565 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:44" (1/1) ... [2024-10-13 00:30:44,567 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:44" (1/1) ... [2024-10-13 00:30:44,573 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 00:30:44,574 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 00:30:44,575 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 00:30:44,575 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 00:30:44,576 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:44" (1/1) ... [2024-10-13 00:30:44,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:30:44,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:30:44,633 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 00:30:44,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 00:30:44,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 00:30:44,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 00:30:44,687 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 00:30:44,687 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 00:30:44,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 00:30:44,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 00:30:44,798 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 00:30:44,802 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 00:30:49,637 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-13 00:30:49,637 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 00:30:49,708 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 00:30:49,708 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 00:30:49,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:30:49 BoogieIcfgContainer [2024-10-13 00:30:49,710 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 00:30:49,712 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 00:30:49,713 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 00:30:49,717 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 00:30:49,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:30:43" (1/3) ... [2024-10-13 00:30:49,718 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2367a721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:30:49, skipping insertion in model container [2024-10-13 00:30:49,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:30:44" (2/3) ... [2024-10-13 00:30:49,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2367a721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:30:49, skipping insertion in model container [2024-10-13 00:30:49,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:30:49" (3/3) ... [2024-10-13 00:30:49,722 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-93.i [2024-10-13 00:30:49,738 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 00:30:49,739 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 00:30:49,818 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 00:30:49,827 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;@bcac90a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 00:30:49,828 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 00:30:49,832 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 00:30:49,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-13 00:30:49,847 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:30:49,848 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:30:49,848 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:30:49,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:30:49,854 INFO L85 PathProgramCache]: Analyzing trace with hash 660305440, now seen corresponding path program 1 times [2024-10-13 00:30:49,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:30:49,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [127864255] [2024-10-13 00:30:49,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:30:49,868 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:30:49,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:30:49,877 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 00:30:49,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 00:30:50,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:50,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 00:30:50,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:30:50,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 626 proven. 0 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2024-10-13 00:30:50,443 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 00:30:50,444 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:30:50,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [127864255] [2024-10-13 00:30:50,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [127864255] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:30:50,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:30:50,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 00:30:50,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502275998] [2024-10-13 00:30:50,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:30:50,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 00:30:50,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:30:50,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 00:30:50,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:30:50,482 INFO L87 Difference]: Start difference. First operand has 68 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-13 00:30:54,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:30:54,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:30:54,616 INFO L93 Difference]: Finished difference Result 133 states and 238 transitions. [2024-10-13 00:30:54,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 00:30:54,651 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 160 [2024-10-13 00:30:54,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:30:54,657 INFO L225 Difference]: With dead ends: 133 [2024-10-13 00:30:54,658 INFO L226 Difference]: Without dead ends: 66 [2024-10-13 00:30:54,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:30:54,668 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-13 00:30:54,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2024-10-13 00:30:54,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-13 00:30:54,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-13 00:30:54,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-13 00:30:54,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 102 transitions. [2024-10-13 00:30:54,740 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 102 transitions. Word has length 160 [2024-10-13 00:30:54,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:30:54,740 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 102 transitions. [2024-10-13 00:30:54,740 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-13 00:30:54,740 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 102 transitions. [2024-10-13 00:30:54,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-13 00:30:54,743 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:30:54,743 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:30:54,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 00:30:54,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:30:54,945 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:30:54,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:30:54,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1642639704, now seen corresponding path program 1 times [2024-10-13 00:30:54,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:30:54,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [916061950] [2024-10-13 00:30:54,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:30:54,947 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:30:54,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:30:54,950 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 00:30:54,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 00:30:55,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:30:55,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 00:30:55,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:30:55,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-13 00:30:55,472 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 00:30:55,472 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:30:55,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [916061950] [2024-10-13 00:30:55,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [916061950] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:30:55,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:30:55,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 00:30:55,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072779142] [2024-10-13 00:30:55,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:30:55,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 00:30:55,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:30:55,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 00:30:55,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 00:30:55,479 INFO L87 Difference]: Start difference. First operand 66 states and 102 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 00:30:59,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:31:03,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.45s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:31:03,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:31:03,267 INFO L93 Difference]: Finished difference Result 161 states and 245 transitions. [2024-10-13 00:31:03,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 00:31:03,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 160 [2024-10-13 00:31:03,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:31:03,270 INFO L225 Difference]: With dead ends: 161 [2024-10-13 00:31:03,270 INFO L226 Difference]: Without dead ends: 96 [2024-10-13 00:31:03,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 00:31:03,272 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 33 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2024-10-13 00:31:03,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 182 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 1 Unknown, 0 Unchecked, 7.8s Time] [2024-10-13 00:31:03,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-13 00:31:03,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2024-10-13 00:31:03,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 61 states have internal predecessors, (79), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 00:31:03,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 139 transitions. [2024-10-13 00:31:03,284 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 139 transitions. Word has length 160 [2024-10-13 00:31:03,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:31:03,285 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 139 transitions. [2024-10-13 00:31:03,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-13 00:31:03,285 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 139 transitions. [2024-10-13 00:31:03,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-13 00:31:03,287 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:31:03,287 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:31:03,300 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 (3)] Forceful destruction successful, exit code 0 [2024-10-13 00:31:03,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:31:03,489 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:31:03,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:31:03,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1205716214, now seen corresponding path program 1 times [2024-10-13 00:31:03,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:31:03,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [395757673] [2024-10-13 00:31:03,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:31:03,490 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:31:03,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:31:03,495 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 00:31:03,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 00:31:04,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:31:04,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-13 00:31:04,083 INFO L278 TraceCheckSpWp]: Computing forward predicates...