./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-17.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-17.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 15862785551f39db90b9c8d8e6460be87c768e7360e2cb9ff7b91b0e99a83c5a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 02:28:36,157 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 02:28:36,216 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 02:28:36,220 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 02:28:36,223 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 02:28:36,246 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 02:28:36,247 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 02:28:36,247 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 02:28:36,248 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 02:28:36,248 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 02:28:36,248 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 02:28:36,249 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 02:28:36,249 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 02:28:36,250 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 02:28:36,250 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 02:28:36,250 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 02:28:36,253 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 02:28:36,254 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 02:28:36,254 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 02:28:36,254 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 02:28:36,254 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 02:28:36,258 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 02:28:36,258 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 02:28:36,259 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 02:28:36,259 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 02:28:36,259 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 02:28:36,259 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 02:28:36,260 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 02:28:36,260 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 02:28:36,260 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 02:28:36,260 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 02:28:36,261 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 02:28:36,261 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:28:36,261 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 02:28:36,261 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 02:28:36,262 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 02:28:36,262 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 02:28:36,262 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 02:28:36,264 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 02:28:36,264 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 02:28:36,264 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 02:28:36,265 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 02:28:36,265 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 -> 15862785551f39db90b9c8d8e6460be87c768e7360e2cb9ff7b91b0e99a83c5a [2024-10-13 02:28:36,514 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 02:28:36,539 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 02:28:36,541 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 02:28:36,542 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 02:28:36,543 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 02:28:36,544 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-17.i [2024-10-13 02:28:38,023 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 02:28:38,243 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 02:28:38,244 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-17.i [2024-10-13 02:28:38,254 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98a21263f/f6af227f53b346678c5f0d4027bc6dbe/FLAG2086fde64 [2024-10-13 02:28:38,271 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98a21263f/f6af227f53b346678c5f0d4027bc6dbe [2024-10-13 02:28:38,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 02:28:38,275 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 02:28:38,276 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 02:28:38,276 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 02:28:38,282 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 02:28:38,283 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:28:38" (1/1) ... [2024-10-13 02:28:38,286 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@677da2fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:38, skipping insertion in model container [2024-10-13 02:28:38,287 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:28:38" (1/1) ... [2024-10-13 02:28:38,322 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 02:28:38,513 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-17.i[919,932] [2024-10-13 02:28:38,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:28:38,618 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 02:28:38,628 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-17.i[919,932] [2024-10-13 02:28:38,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:28:38,697 INFO L204 MainTranslator]: Completed translation [2024-10-13 02:28:38,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:38 WrapperNode [2024-10-13 02:28:38,698 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 02:28:38,699 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 02:28:38,699 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 02:28:38,699 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 02:28:38,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:38" (1/1) ... [2024-10-13 02:28:38,720 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:38" (1/1) ... [2024-10-13 02:28:38,772 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 238 [2024-10-13 02:28:38,773 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 02:28:38,774 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 02:28:38,774 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 02:28:38,774 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 02:28:38,785 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:38" (1/1) ... [2024-10-13 02:28:38,785 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:38" (1/1) ... [2024-10-13 02:28:38,789 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:38" (1/1) ... [2024-10-13 02:28:38,808 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 02:28:38,809 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:38" (1/1) ... [2024-10-13 02:28:38,809 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:38" (1/1) ... [2024-10-13 02:28:38,821 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:38" (1/1) ... [2024-10-13 02:28:38,829 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:38" (1/1) ... [2024-10-13 02:28:38,836 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:38" (1/1) ... [2024-10-13 02:28:38,842 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:38" (1/1) ... [2024-10-13 02:28:38,854 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 02:28:38,855 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 02:28:38,855 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 02:28:38,855 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 02:28:38,856 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:38" (1/1) ... [2024-10-13 02:28:38,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:28:38,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:28:38,896 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 02:28:38,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 02:28:38,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 02:28:38,977 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 02:28:38,982 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 02:28:38,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 02:28:38,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 02:28:38,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 02:28:39,154 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 02:28:39,158 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 02:28:39,676 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-13 02:28:39,676 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 02:28:39,714 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 02:28:39,714 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 02:28:39,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:28:39 BoogieIcfgContainer [2024-10-13 02:28:39,715 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 02:28:39,716 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 02:28:39,717 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 02:28:39,720 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 02:28:39,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:28:38" (1/3) ... [2024-10-13 02:28:39,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43ae9891 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:28:39, skipping insertion in model container [2024-10-13 02:28:39,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:38" (2/3) ... [2024-10-13 02:28:39,722 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43ae9891 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:28:39, skipping insertion in model container [2024-10-13 02:28:39,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:28:39" (3/3) ... [2024-10-13 02:28:39,723 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-17.i [2024-10-13 02:28:39,742 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 02:28:39,742 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 02:28:39,806 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 02:28:39,813 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;@d01d25b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 02:28:39,814 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 02:28:39,821 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 69 states have (on average 1.5217391304347827) internal successors, (105), 70 states have internal predecessors, (105), 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 02:28:39,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-13 02:28:39,837 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:28:39,838 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:28:39,838 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:28:39,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:28:39,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1229534036, now seen corresponding path program 1 times [2024-10-13 02:28:39,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:28:39,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090660318] [2024-10-13 02:28:39,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:28:39,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:28:39,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:40,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:28:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:40,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:28:40,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:40,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:28:40,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:40,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:28:40,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:40,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:28:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:40,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:28:40,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:40,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:28:40,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:40,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:28:40,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:40,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:28:40,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:40,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 02:28:40,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:40,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 02:28:40,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:40,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 02:28:40,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:40,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 02:28:40,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:40,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:28:40,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:40,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:28:40,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:40,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:28:40,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:40,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:28:40,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:40,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:28:40,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:40,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:28:40,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:40,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:28:40,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:40,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 02:28:40,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:40,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:28:40,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:40,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 02:28:40,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:40,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 02:28:40,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:40,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 02:28:40,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:40,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 02:28:40,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:40,396 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 02:28:40,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:28:40,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090660318] [2024-10-13 02:28:40,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090660318] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:28:40,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:28:40,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:28:40,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582257512] [2024-10-13 02:28:40,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:28:40,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 02:28:40,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:28:40,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 02:28:40,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:28:40,477 INFO L87 Difference]: Start difference. First operand has 98 states, 69 states have (on average 1.5217391304347827) internal successors, (105), 70 states have internal predecessors, (105), 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 21.5) internal successors, (43), 2 states have internal predecessors, (43), 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 02:28:40,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:28:40,540 INFO L93 Difference]: Finished difference Result 193 states and 338 transitions. [2024-10-13 02:28:40,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 02:28:40,544 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 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 170 [2024-10-13 02:28:40,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:28:40,565 INFO L225 Difference]: With dead ends: 193 [2024-10-13 02:28:40,569 INFO L226 Difference]: Without dead ends: 96 [2024-10-13 02:28:40,576 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 02:28:40,581 INFO L432 NwaCegarLoop]: 149 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, 149 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 02:28:40,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:28:40,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-13 02:28:40,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-10-13 02:28:40,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 68 states have (on average 1.4705882352941178) internal successors, (100), 68 states have internal predecessors, (100), 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 02:28:40,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 152 transitions. [2024-10-13 02:28:40,656 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 152 transitions. Word has length 170 [2024-10-13 02:28:40,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:28:40,656 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 152 transitions. [2024-10-13 02:28:40,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 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 02:28:40,657 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 152 transitions. [2024-10-13 02:28:40,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-13 02:28:40,663 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:28:40,664 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:28:40,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 02:28:40,665 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:28:40,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:28:40,667 INFO L85 PathProgramCache]: Analyzing trace with hash 180708580, now seen corresponding path program 1 times [2024-10-13 02:28:40,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:28:40,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837370238] [2024-10-13 02:28:40,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:28:40,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:28:40,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:41,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:28:41,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:41,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:28:41,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:41,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:28:41,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:41,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:28:41,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:41,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:28:41,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:41,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:28:41,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:41,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:28:41,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:41,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:28:41,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:41,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:28:41,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:41,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 02:28:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:41,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 02:28:41,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:41,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 02:28:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:41,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 02:28:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:41,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:28:41,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:41,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:28:41,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:41,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:28:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:41,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:28:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:41,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:28:41,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:41,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:28:41,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:41,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:28:41,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:41,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 02:28:41,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:41,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:28:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:41,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 02:28:41,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:41,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 02:28:41,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:41,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 02:28:41,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:41,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 02:28:41,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:41,579 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 02:28:41,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:28:41,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837370238] [2024-10-13 02:28:41,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837370238] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:28:41,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:28:41,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:28:41,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956813574] [2024-10-13 02:28:41,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:28:41,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:28:41,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:28:41,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:28:41,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:28:41,586 INFO L87 Difference]: Start difference. First operand 96 states and 152 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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 02:28:41,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:28:41,744 INFO L93 Difference]: Finished difference Result 246 states and 390 transitions. [2024-10-13 02:28:41,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:28:41,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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 170 [2024-10-13 02:28:41,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:28:41,749 INFO L225 Difference]: With dead ends: 246 [2024-10-13 02:28:41,751 INFO L226 Difference]: Without dead ends: 151 [2024-10-13 02:28:41,752 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 02:28:41,755 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 38 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:28:41,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 248 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 02:28:41,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-13 02:28:41,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 147. [2024-10-13 02:28:41,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 92 states have (on average 1.391304347826087) internal successors, (128), 92 states have internal predecessors, (128), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-13 02:28:41,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 232 transitions. [2024-10-13 02:28:41,798 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 232 transitions. Word has length 170 [2024-10-13 02:28:41,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:28:41,799 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 232 transitions. [2024-10-13 02:28:41,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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 02:28:41,800 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 232 transitions. [2024-10-13 02:28:41,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-13 02:28:41,802 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:28:41,802 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:28:41,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 02:28:41,803 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:28:41,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:28:41,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1758038695, now seen corresponding path program 1 times [2024-10-13 02:28:41,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:28:41,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983046235] [2024-10-13 02:28:41,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:28:41,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:28:41,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:41,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:28:41,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:41,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:28:41,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:41,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:28:41,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:41,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:28:41,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:41,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:28:41,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:41,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:28:41,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:41,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:28:41,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:41,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:28:41,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:41,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:28:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:41,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 02:28:41,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:41,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 02:28:41,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:41,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 02:28:41,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:41,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 02:28:41,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:41,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:28:41,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:41,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:28:41,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:41,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:28:41,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:41,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:28:41,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:41,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:28:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:41,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:28:41,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:41,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:28:41,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:41,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 02:28:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:41,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:28:41,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:41,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 02:28:41,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:41,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 02:28:41,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:41,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 02:28:41,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:42,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 02:28:42,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:42,004 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 02:28:42,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:28:42,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983046235] [2024-10-13 02:28:42,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983046235] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:28:42,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:28:42,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:28:42,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46046757] [2024-10-13 02:28:42,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:28:42,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:28:42,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:28:42,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:28:42,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:28:42,010 INFO L87 Difference]: Start difference. First operand 147 states and 232 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 02:28:42,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:28:42,129 INFO L93 Difference]: Finished difference Result 243 states and 385 transitions. [2024-10-13 02:28:42,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:28:42,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 171 [2024-10-13 02:28:42,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:28:42,134 INFO L225 Difference]: With dead ends: 243 [2024-10-13 02:28:42,137 INFO L226 Difference]: Without dead ends: 148 [2024-10-13 02:28:42,138 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 02:28:42,140 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:28:42,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 258 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 02:28:42,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-10-13 02:28:42,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2024-10-13 02:28:42,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 93 states have internal predecessors, (129), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-13 02:28:42,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 233 transitions. [2024-10-13 02:28:42,165 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 233 transitions. Word has length 171 [2024-10-13 02:28:42,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:28:42,165 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 233 transitions. [2024-10-13 02:28:42,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 02:28:42,166 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 233 transitions. [2024-10-13 02:28:42,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-13 02:28:42,170 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:28:42,171 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:28:42,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 02:28:42,171 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:28:42,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:28:42,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1235904693, now seen corresponding path program 1 times [2024-10-13 02:28:42,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:28:42,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965894988] [2024-10-13 02:28:42,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:28:42,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:28:42,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:43,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:28:43,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:43,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:28:43,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:43,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:28:43,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:43,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:28:43,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:43,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:28:43,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:43,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:28:43,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:43,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:28:43,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:43,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:28:43,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:43,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:28:43,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:43,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 02:28:43,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:43,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 02:28:43,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:43,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 02:28:43,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:43,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 02:28:43,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:43,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:28:43,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:43,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:28:43,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:43,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:28:43,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:43,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:28:43,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:43,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:28:43,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:43,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:28:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:43,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:28:43,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:43,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 02:28:43,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:43,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:28:43,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:43,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 02:28:43,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:43,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 02:28:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:43,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 02:28:43,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:43,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 02:28:43,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:43,617 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 02:28:43,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:28:43,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965894988] [2024-10-13 02:28:43,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965894988] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:28:43,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:28:43,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 02:28:43,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305023625] [2024-10-13 02:28:43,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:28:43,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 02:28:43,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:28:43,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 02:28:43,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-13 02:28:43,622 INFO L87 Difference]: Start difference. First operand 148 states and 233 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 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 02:28:45,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:28:45,177 INFO L93 Difference]: Finished difference Result 439 states and 679 transitions. [2024-10-13 02:28:45,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 02:28:45,177 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 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 171 [2024-10-13 02:28:45,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:28:45,181 INFO L225 Difference]: With dead ends: 439 [2024-10-13 02:28:45,181 INFO L226 Difference]: Without dead ends: 343 [2024-10-13 02:28:45,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2024-10-13 02:28:45,183 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 516 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:28:45,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 517 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 842 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 02:28:45,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-10-13 02:28:45,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 223. [2024-10-13 02:28:45,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 163 states have (on average 1.4723926380368098) internal successors, (240), 164 states have internal predecessors, (240), 56 states have call successors, (56), 3 states have call predecessors, (56), 3 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-13 02:28:45,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 352 transitions. [2024-10-13 02:28:45,232 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 352 transitions. Word has length 171 [2024-10-13 02:28:45,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:28:45,234 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 352 transitions. [2024-10-13 02:28:45,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 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 02:28:45,235 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 352 transitions. [2024-10-13 02:28:45,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-13 02:28:45,240 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:28:45,240 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:28:45,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 02:28:45,241 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:28:45,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:28:45,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1628931703, now seen corresponding path program 1 times [2024-10-13 02:28:45,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:28:45,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762686126] [2024-10-13 02:28:45,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:28:45,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:28:45,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:46,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:28:46,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:46,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:28:46,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:46,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:28:46,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:46,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:28:46,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:46,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:28:46,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:46,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:28:46,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:46,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:28:46,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:46,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:28:46,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:46,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:28:46,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:46,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 02:28:46,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:46,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 02:28:46,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:46,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 02:28:46,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:46,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 02:28:46,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:46,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:28:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:46,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:28:46,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:46,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:28:46,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:46,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:28:46,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:46,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:28:46,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:46,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:28:46,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:46,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:28:46,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:46,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 02:28:46,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:46,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:28:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:46,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 02:28:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:46,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 02:28:46,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:46,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 02:28:46,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:46,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 02:28:46,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:46,717 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 02:28:46,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:28:46,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762686126] [2024-10-13 02:28:46,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762686126] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:28:46,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:28:46,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 02:28:46,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861319164] [2024-10-13 02:28:46,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:28:46,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 02:28:46,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:28:46,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 02:28:46,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-13 02:28:46,722 INFO L87 Difference]: Start difference. First operand 223 states and 352 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 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 02:28:48,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:28:48,070 INFO L93 Difference]: Finished difference Result 516 states and 805 transitions. [2024-10-13 02:28:48,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 02:28:48,071 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 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 171 [2024-10-13 02:28:48,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:28:48,079 INFO L225 Difference]: With dead ends: 516 [2024-10-13 02:28:48,080 INFO L226 Difference]: Without dead ends: 383 [2024-10-13 02:28:48,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-10-13 02:28:48,082 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 361 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:28:48,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 577 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 02:28:48,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-10-13 02:28:48,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 203. [2024-10-13 02:28:48,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 143 states have (on average 1.4545454545454546) internal successors, (208), 144 states have internal predecessors, (208), 56 states have call successors, (56), 3 states have call predecessors, (56), 3 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-13 02:28:48,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 320 transitions. [2024-10-13 02:28:48,143 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 320 transitions. Word has length 171 [2024-10-13 02:28:48,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:28:48,145 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 320 transitions. [2024-10-13 02:28:48,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 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 02:28:48,146 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 320 transitions. [2024-10-13 02:28:48,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-13 02:28:48,148 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:28:48,149 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:28:48,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 02:28:48,149 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:28:48,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:28:48,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1779198925, now seen corresponding path program 1 times [2024-10-13 02:28:48,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:28:48,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592913367] [2024-10-13 02:28:48,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:28:48,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:28:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:48,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:28:48,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:48,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:28:48,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:48,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:28:48,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:48,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:28:48,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:48,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:28:48,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:48,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:28:48,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:48,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:28:48,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:48,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:28:48,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:48,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:28:48,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:48,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 02:28:48,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:48,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 02:28:48,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:48,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 02:28:48,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:48,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 02:28:48,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:48,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:28:48,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:48,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:28:48,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:48,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 02:28:48,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:48,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:28:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:48,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 02:28:48,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:48,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:28:48,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:48,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:28:48,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:48,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 02:28:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:48,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:28:48,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:48,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 02:28:48,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:48,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 02:28:48,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:48,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 02:28:48,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:48,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 02:28:48,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:48,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 30 proven. 45 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-10-13 02:28:48,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:28:48,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592913367] [2024-10-13 02:28:48,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592913367] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 02:28:48,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013645619] [2024-10-13 02:28:48,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:28:48,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:28:48,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:28:48,727 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 02:28:48,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 02:28:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:48,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-13 02:28:48,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:28:49,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 645 proven. 45 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2024-10-13 02:28:49,511 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:28:49,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 30 proven. 45 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-10-13 02:28:49,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013645619] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 02:28:49,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 02:28:49,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 18 [2024-10-13 02:28:49,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787483905] [2024-10-13 02:28:49,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 02:28:49,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-13 02:28:49,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:28:49,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-13 02:28:49,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2024-10-13 02:28:49,945 INFO L87 Difference]: Start difference. First operand 203 states and 320 transitions. Second operand has 18 states, 18 states have (on average 5.166666666666667) internal successors, (93), 18 states have internal predecessors, (93), 5 states have call successors, (67), 3 states have call predecessors, (67), 6 states have return successors, (68), 5 states have call predecessors, (68), 5 states have call successors, (68) [2024-10-13 02:28:51,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:28:51,457 INFO L93 Difference]: Finished difference Result 873 states and 1350 transitions. [2024-10-13 02:28:51,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-13 02:28:51,458 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.166666666666667) internal successors, (93), 18 states have internal predecessors, (93), 5 states have call successors, (67), 3 states have call predecessors, (67), 6 states have return successors, (68), 5 states have call predecessors, (68), 5 states have call successors, (68) Word has length 171 [2024-10-13 02:28:51,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:28:51,464 INFO L225 Difference]: With dead ends: 873 [2024-10-13 02:28:51,465 INFO L226 Difference]: Without dead ends: 721 [2024-10-13 02:28:51,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 386 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=428, Invalid=1294, Unknown=0, NotChecked=0, Total=1722 [2024-10-13 02:28:51,468 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 953 mSDsluCounter, 1228 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 323 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 964 SdHoareTripleChecker+Valid, 1341 SdHoareTripleChecker+Invalid, 1378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 323 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:28:51,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [964 Valid, 1341 Invalid, 1378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [323 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 02:28:51,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2024-10-13 02:28:51,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 479. [2024-10-13 02:28:51,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 350 states have (on average 1.3685714285714285) internal successors, (479), 354 states have internal predecessors, (479), 116 states have call successors, (116), 12 states have call predecessors, (116), 12 states have return successors, (116), 112 states have call predecessors, (116), 116 states have call successors, (116) [2024-10-13 02:28:51,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 711 transitions. [2024-10-13 02:28:51,535 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 711 transitions. Word has length 171 [2024-10-13 02:28:51,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:28:51,536 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 711 transitions. [2024-10-13 02:28:51,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.166666666666667) internal successors, (93), 18 states have internal predecessors, (93), 5 states have call successors, (67), 3 states have call predecessors, (67), 6 states have return successors, (68), 5 states have call predecessors, (68), 5 states have call successors, (68) [2024-10-13 02:28:51,537 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 711 transitions. [2024-10-13 02:28:51,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-13 02:28:51,539 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:28:51,539 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:28:51,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 02:28:51,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-13 02:28:51,741 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:28:51,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:28:51,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1098331661, now seen corresponding path program 1 times [2024-10-13 02:28:51,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:28:51,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044549333] [2024-10-13 02:28:51,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:28:51,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:28:51,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 02:28:51,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [925723465] [2024-10-13 02:28:51,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:28:51,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:28:51,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:28:51,851 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 02:28:51,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 02:28:51,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 02:28:51,997 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 02:28:52,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 02:28:52,172 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 02:28:52,173 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 02:28:52,174 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 02:28:52,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 02:28:52,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-13 02:28:52,379 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:28:52,508 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 02:28:52,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 02:28:52 BoogieIcfgContainer [2024-10-13 02:28:52,512 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 02:28:52,512 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 02:28:52,512 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 02:28:52,512 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 02:28:52,513 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:28:39" (3/4) ... [2024-10-13 02:28:52,515 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 02:28:52,516 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 02:28:52,517 INFO L158 Benchmark]: Toolchain (without parser) took 14242.49ms. Allocated memory was 138.4MB in the beginning and 255.9MB in the end (delta: 117.4MB). Free memory was 96.6MB in the beginning and 87.1MB in the end (delta: 9.5MB). Peak memory consumption was 125.4MB. Max. memory is 16.1GB. [2024-10-13 02:28:52,517 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 100.7MB. Free memory is still 68.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 02:28:52,518 INFO L158 Benchmark]: CACSL2BoogieTranslator took 422.25ms. Allocated memory is still 138.4MB. Free memory was 96.6MB in the beginning and 79.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 02:28:52,518 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.82ms. Allocated memory is still 138.4MB. Free memory was 79.8MB in the beginning and 75.1MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 02:28:52,518 INFO L158 Benchmark]: Boogie Preprocessor took 80.39ms. Allocated memory is still 138.4MB. Free memory was 75.1MB in the beginning and 68.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 02:28:52,518 INFO L158 Benchmark]: RCFGBuilder took 859.48ms. Allocated memory is still 138.4MB. Free memory was 68.8MB in the beginning and 77.2MB in the end (delta: -8.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 02:28:52,519 INFO L158 Benchmark]: TraceAbstraction took 12795.24ms. Allocated memory was 138.4MB in the beginning and 255.9MB in the end (delta: 117.4MB). Free memory was 76.6MB in the beginning and 87.1MB in the end (delta: -10.5MB). Peak memory consumption was 109.0MB. Max. memory is 16.1GB. [2024-10-13 02:28:52,519 INFO L158 Benchmark]: Witness Printer took 4.41ms. Allocated memory is still 255.9MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 02:28:52,520 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.17ms. Allocated memory is still 100.7MB. Free memory is still 68.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 422.25ms. Allocated memory is still 138.4MB. Free memory was 96.6MB in the beginning and 79.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.82ms. Allocated memory is still 138.4MB. Free memory was 79.8MB in the beginning and 75.1MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.39ms. Allocated memory is still 138.4MB. Free memory was 75.1MB in the beginning and 68.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 859.48ms. Allocated memory is still 138.4MB. Free memory was 68.8MB in the beginning and 77.2MB in the end (delta: -8.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 12795.24ms. Allocated memory was 138.4MB in the beginning and 255.9MB in the end (delta: 117.4MB). Free memory was 76.6MB in the beginning and 87.1MB in the end (delta: -10.5MB). Peak memory consumption was 109.0MB. Max. memory is 16.1GB. * Witness Printer took 4.41ms. Allocated memory is still 255.9MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 187, overapproximation of someBinaryFLOATComparisonOperation at line 120. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 25; [L23] unsigned char var_1_2 = 25; [L24] unsigned char var_1_3 = 0; [L25] unsigned char var_1_4 = 0; [L26] signed long int var_1_5 = 4; [L27] unsigned char var_1_7 = 0; [L28] unsigned char var_1_8 = 1; [L29] unsigned char var_1_9 = 0; [L30] unsigned char var_1_10 = 0; [L31] double var_1_11 = 7.3; [L32] double var_1_12 = 1.25; [L33] double var_1_13 = 128.8; [L34] signed char var_1_14 = -1; [L35] signed char var_1_15 = 10; [L36] signed short int var_1_16 = 8; [L37] unsigned long int var_1_18 = 128; [L38] unsigned long int var_1_19 = 3963666122; [L39] float var_1_20 = 15.875; [L40] float var_1_21 = 4.2; [L41] float var_1_22 = 5.5; [L42] signed short int var_1_23 = -10; [L43] unsigned long int var_1_30 = 1000000000; [L44] unsigned long int var_1_31 = 4155847319; [L45] float var_1_33 = 99.25; [L46] signed long int var_1_34 = 10; [L47] unsigned char var_1_35 = 16; [L48] unsigned char var_1_36 = 100; [L49] signed long int var_1_39 = -128; [L50] signed long int var_1_40 = 1792665454; [L51] unsigned char last_1_var_1_8 = 1; [L52] signed char last_1_var_1_14 = -1; [L191] isInitial = 1 [L192] FCALL initially() [L193] COND TRUE 1 [L194] CALL updateLastVariables() [L183] last_1_var_1_8 = var_1_8 [L184] last_1_var_1_14 = var_1_14 [L194] RET updateLastVariables() [L195] CALL updateVariables() [L140] var_1_2 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L141] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L142] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L142] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L143] var_1_3 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L144] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L145] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L145] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L146] var_1_4 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L147] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L148] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L148] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L149] var_1_7 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_8=1, var_1_9=0] [L150] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_8=1, var_1_9=0] [L151] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=0] [L151] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=0] [L152] var_1_9 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L153] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L154] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L154] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L155] var_1_10 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L156] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L157] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L157] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L158] var_1_12 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L159] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L160] var_1_13 = __VERIFIER_nondet_double() [L161] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L161] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L162] var_1_15 = __VERIFIER_nondet_char() [L163] CALL assume_abort_if_not(var_1_15 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L163] RET assume_abort_if_not(var_1_15 >= -127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L164] CALL assume_abort_if_not(var_1_15 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L164] RET assume_abort_if_not(var_1_15 <= 126) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L165] var_1_19 = __VERIFIER_nondet_ulong() [L166] CALL assume_abort_if_not(var_1_19 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L166] RET assume_abort_if_not(var_1_19 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L167] CALL assume_abort_if_not(var_1_19 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L167] RET assume_abort_if_not(var_1_19 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L168] var_1_21 = __VERIFIER_nondet_float() [L169] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L169] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L170] var_1_22 = __VERIFIER_nondet_float() [L171] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L171] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L172] var_1_31 = __VERIFIER_nondet_ulong() [L173] CALL assume_abort_if_not(var_1_31 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L173] RET assume_abort_if_not(var_1_31 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L174] CALL assume_abort_if_not(var_1_31 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L174] RET assume_abort_if_not(var_1_31 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L175] var_1_36 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L176] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L177] CALL assume_abort_if_not(var_1_36 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L177] RET assume_abort_if_not(var_1_36 <= 254) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=-250, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L178] var_1_40 = __VERIFIER_nondet_long() [L179] CALL assume_abort_if_not(var_1_40 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L179] RET assume_abort_if_not(var_1_40 >= 1073741823) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L180] CALL assume_abort_if_not(var_1_40 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L180] RET assume_abort_if_not(var_1_40 <= 2147483646) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L195] RET updateVariables() [L196] CALL step() [L56] unsigned char stepLocal_0 = last_1_var_1_8; VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_0=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L57] COND TRUE stepLocal_0 && last_1_var_1_8 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L58] COND TRUE \read(last_1_var_1_8) [L59] var_1_5 = (((((last_1_var_1_14) < 0 ) ? -(last_1_var_1_14) : (last_1_var_1_14))) - ((((var_1_4) < (var_1_2)) ? (var_1_4) : (var_1_2)))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=1] [L64] COND TRUE var_1_5 < var_1_3 [L65] var_1_8 = ((var_1_7 || (last_1_var_1_8 || var_1_9)) && var_1_10) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=1] [L69] COND TRUE \read(var_1_8) [L70] var_1_34 = ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=1, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=1] [L72] EXPR var_1_1 >> var_1_5 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=1, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=1] [L72] COND FALSE !(var_1_1 > (var_1_1 >> var_1_5)) [L79] var_1_39 = var_1_14 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=1, var_1_35=16, var_1_36=0, var_1_39=-1, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=1] [L81] var_1_1 = (50 + ((((var_1_2) < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) ? (var_1_2) : (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=51, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=1, var_1_35=16, var_1_36=0, var_1_39=-1, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=1] [L82] COND FALSE !(128u <= var_1_1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=51, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=1, var_1_35=16, var_1_36=0, var_1_39=-1, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=1] [L97] COND FALSE !((64.4f + 1.5f) <= var_1_13) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=51, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=1, var_1_35=16, var_1_36=0, var_1_39=-1, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=1] [L102] COND FALSE !(var_1_5 >= var_1_1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=51, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=1, var_1_35=16, var_1_36=0, var_1_39=-1, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=1] [L105] COND TRUE var_1_31 > var_1_1 [L106] var_1_35 = var_1_36 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=51, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=1, var_1_35=0, var_1_36=0, var_1_39=-1, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=1] [L114] unsigned char stepLocal_3 = var_1_9 && var_1_8; VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_3=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=2147483647, var_1_1=51, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=1, var_1_35=0, var_1_36=0, var_1_39=-1, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=1] [L115] COND TRUE stepLocal_3 || (var_1_8 && var_1_10) [L116] var_1_18 = (var_1_19 - (((((1991720936u - var_1_1)) < (var_1_2)) ? ((1991720936u - var_1_1)) : (var_1_2)))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=2147483646, var_1_19=2147483647, var_1_1=51, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=1, var_1_35=0, var_1_36=0, var_1_39=-1, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=1] [L120] var_1_20 = ((((var_1_21) < (var_1_22)) ? (var_1_21) : (var_1_22))) [L121] signed long int stepLocal_1 = 8 + var_1_14; VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_1=7, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=2147483646, var_1_19=2147483647, var_1_1=51, var_1_20=3, var_1_21=3, var_1_22=0, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=1, var_1_35=0, var_1_36=0, var_1_39=-1, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=1] [L122] COND TRUE var_1_4 == stepLocal_1 [L123] var_1_11 = ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=2147483646, var_1_19=2147483647, var_1_1=51, var_1_20=3, var_1_21=3, var_1_22=0, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=2147483647, var_1_33=397/4, var_1_34=1, var_1_35=0, var_1_36=0, var_1_39=-1, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=1] [L125] var_1_33 = var_1_21 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=2147483646, var_1_19=2147483647, var_1_1=51, var_1_20=3, var_1_21=3, var_1_22=0, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=2147483647, var_1_33=3, var_1_34=1, var_1_35=0, var_1_36=0, var_1_39=-1, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=1] [L126] EXPR var_1_15 & var_1_1 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=2147483646, var_1_19=2147483647, var_1_1=51, var_1_20=3, var_1_21=3, var_1_22=0, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=2147483647, var_1_33=3, var_1_34=1, var_1_35=0, var_1_36=0, var_1_39=-1, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=1] [L126] unsigned long int stepLocal_2 = var_1_18 * (var_1_15 & var_1_1); [L127] COND FALSE !(var_1_12 >= 9.6) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_2=0, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=2147483646, var_1_19=2147483647, var_1_1=51, var_1_20=3, var_1_21=3, var_1_22=0, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=2147483647, var_1_33=3, var_1_34=1, var_1_35=0, var_1_36=0, var_1_39=-1, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=1] [L196] RET step() [L197] CALL, EXPR property() [L187] EXPR (((((var_1_1 == ((unsigned char) (50 + ((((var_1_2) < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) ? (var_1_2) : (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))))))) && ((last_1_var_1_8 && last_1_var_1_8) ? (last_1_var_1_8 ? (var_1_5 == ((signed long int) (((((last_1_var_1_14) < 0 ) ? -(last_1_var_1_14) : (last_1_var_1_14))) - ((((var_1_4) < (var_1_2)) ? (var_1_4) : (var_1_2)))))) : (var_1_5 == ((signed long int) 8))) : 1)) && ((var_1_5 < var_1_3) ? (var_1_8 == ((unsigned char) ((var_1_7 || (last_1_var_1_8 || var_1_9)) && var_1_10))) : (var_1_8 == ((unsigned char) (! var_1_10))))) && ((var_1_4 == (8 + var_1_14)) ? (var_1_11 == ((double) ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))))) : 1)) && (((64.4f + 1.5f) <= var_1_13) ? ((var_1_1 >= var_1_4) ? (var_1_14 == ((signed char) var_1_15)) : 1) : 1)) && ((var_1_12 >= 9.6) ? (var_1_10 ? (var_1_16 == ((signed short int) (2 - var_1_1))) : (((var_1_18 * (var_1_15 & var_1_1)) <= var_1_3) ? (var_1_16 == ((signed short int) var_1_18)) : (var_1_16 == ((signed short int) var_1_4)))) : 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=2147483646, var_1_19=2147483647, var_1_1=51, var_1_20=3, var_1_21=3, var_1_22=0, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=2147483647, var_1_33=3, var_1_34=1, var_1_35=0, var_1_36=0, var_1_39=-1, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=1] [L187-L188] return ((((((var_1_1 == ((unsigned char) (50 + ((((var_1_2) < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) ? (var_1_2) : (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))))))) && ((last_1_var_1_8 && last_1_var_1_8) ? (last_1_var_1_8 ? (var_1_5 == ((signed long int) (((((last_1_var_1_14) < 0 ) ? -(last_1_var_1_14) : (last_1_var_1_14))) - ((((var_1_4) < (var_1_2)) ? (var_1_4) : (var_1_2)))))) : (var_1_5 == ((signed long int) 8))) : 1)) && ((var_1_5 < var_1_3) ? (var_1_8 == ((unsigned char) ((var_1_7 || (last_1_var_1_8 || var_1_9)) && var_1_10))) : (var_1_8 == ((unsigned char) (! var_1_10))))) && ((var_1_4 == (8 + var_1_14)) ? (var_1_11 == ((double) ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))))) : 1)) && (((64.4f + 1.5f) <= var_1_13) ? ((var_1_1 >= var_1_4) ? (var_1_14 == ((signed char) var_1_15)) : 1) : 1)) && ((var_1_12 >= 9.6) ? (var_1_10 ? (var_1_16 == ((signed short int) (2 - var_1_1))) : (((var_1_18 * (var_1_15 & var_1_1)) <= var_1_3) ? (var_1_16 == ((signed short int) var_1_18)) : (var_1_16 == ((signed short int) var_1_4)))) : 1)) && (((var_1_9 && var_1_8) || (var_1_8 && var_1_10)) ? (var_1_18 == ((unsigned long int) (var_1_19 - (((((1991720936u - var_1_1)) < (var_1_2)) ? ((1991720936u - var_1_1)) : (var_1_2)))))) : (var_1_18 == ((unsigned long int) var_1_2))) ; [L197] RET, EXPR property() [L197] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=2147483646, var_1_19=2147483647, var_1_1=51, var_1_20=3, var_1_21=3, var_1_22=0, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=2147483647, var_1_33=3, var_1_34=1, var_1_35=0, var_1_36=0, var_1_39=-1, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=2147483646, var_1_19=2147483647, var_1_1=51, var_1_20=3, var_1_21=3, var_1_22=0, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=2147483647, var_1_33=3, var_1_34=1, var_1_35=0, var_1_36=0, var_1_39=-1, var_1_3=-250, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 98 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.6s, OverallIterations: 7, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1879 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1868 mSDsluCounter, 3090 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2247 mSDsCounter, 527 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2856 IncrementalHoareTripleChecker+Invalid, 3383 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 527 mSolverCounterUnsat, 843 mSDtfsCounter, 2856 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 766 GetRequests, 692 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=479occurred in iteration=6, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 546 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 1537 NumberOfCodeBlocks, 1537 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1358 ConstructedInterpolants, 0 QuantifiedInterpolants, 5266 SizeOfPredicates, 5 NumberOfNonLiveVariables, 397 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 10265/10400 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 02:28:52,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-17.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 15862785551f39db90b9c8d8e6460be87c768e7360e2cb9ff7b91b0e99a83c5a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 02:28:54,864 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 02:28:54,944 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 02:28:54,952 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 02:28:54,952 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 02:28:54,981 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 02:28:54,982 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 02:28:54,982 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 02:28:54,982 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 02:28:54,983 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 02:28:54,983 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 02:28:54,984 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 02:28:54,984 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 02:28:54,984 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 02:28:54,985 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 02:28:54,985 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 02:28:54,985 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 02:28:54,986 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 02:28:54,986 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 02:28:54,986 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 02:28:54,987 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 02:28:54,991 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 02:28:54,991 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 02:28:54,992 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 02:28:54,992 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 02:28:54,992 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 02:28:54,993 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 02:28:54,993 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 02:28:54,993 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 02:28:54,993 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 02:28:54,993 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 02:28:54,994 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 02:28:54,994 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 02:28:54,994 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 02:28:54,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:28:54,995 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 02:28:54,995 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 02:28:54,995 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 02:28:54,997 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 02:28:54,998 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 02:28:54,998 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 02:28:54,999 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 02:28:54,999 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 02:28:54,999 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 02:28:55,000 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 02:28:55,000 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 -> 15862785551f39db90b9c8d8e6460be87c768e7360e2cb9ff7b91b0e99a83c5a [2024-10-13 02:28:55,328 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 02:28:55,357 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 02:28:55,360 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 02:28:55,361 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 02:28:55,362 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 02:28:55,364 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-17.i [2024-10-13 02:28:57,081 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 02:28:57,292 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 02:28:57,297 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-17.i [2024-10-13 02:28:57,321 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6701259d7/f2cd777d344a4959be0948634ca14066/FLAG0e1c033e4 [2024-10-13 02:28:57,339 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6701259d7/f2cd777d344a4959be0948634ca14066 [2024-10-13 02:28:57,343 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 02:28:57,345 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 02:28:57,346 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 02:28:57,347 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 02:28:57,352 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 02:28:57,353 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:28:57" (1/1) ... [2024-10-13 02:28:57,356 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e14d318 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:57, skipping insertion in model container [2024-10-13 02:28:57,356 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:28:57" (1/1) ... [2024-10-13 02:28:57,388 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 02:28:57,609 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-17.i[919,932] [2024-10-13 02:28:57,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:28:57,727 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 02:28:57,741 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-17.i[919,932] [2024-10-13 02:28:57,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:28:57,829 INFO L204 MainTranslator]: Completed translation [2024-10-13 02:28:57,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:57 WrapperNode [2024-10-13 02:28:57,830 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 02:28:57,831 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 02:28:57,832 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 02:28:57,832 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 02:28:57,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:57" (1/1) ... [2024-10-13 02:28:57,855 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:57" (1/1) ... [2024-10-13 02:28:57,903 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 188 [2024-10-13 02:28:57,904 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 02:28:57,905 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 02:28:57,905 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 02:28:57,905 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 02:28:57,916 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:57" (1/1) ... [2024-10-13 02:28:57,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:57" (1/1) ... [2024-10-13 02:28:57,922 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:57" (1/1) ... [2024-10-13 02:28:57,941 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 02:28:57,941 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:57" (1/1) ... [2024-10-13 02:28:57,942 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:57" (1/1) ... [2024-10-13 02:28:57,953 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:57" (1/1) ... [2024-10-13 02:28:57,957 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:57" (1/1) ... [2024-10-13 02:28:57,959 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:57" (1/1) ... [2024-10-13 02:28:57,961 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:57" (1/1) ... [2024-10-13 02:28:57,966 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 02:28:57,967 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 02:28:57,967 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 02:28:57,967 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 02:28:57,968 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:57" (1/1) ... [2024-10-13 02:28:57,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:28:57,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:28:58,017 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 02:28:58,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 02:28:58,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 02:28:58,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 02:28:58,063 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 02:28:58,063 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 02:28:58,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 02:28:58,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 02:28:58,158 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 02:28:58,162 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 02:28:59,080 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-13 02:28:59,081 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 02:28:59,138 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 02:28:59,139 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 02:28:59,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:28:59 BoogieIcfgContainer [2024-10-13 02:28:59,139 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 02:28:59,141 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 02:28:59,141 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 02:28:59,144 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 02:28:59,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:28:57" (1/3) ... [2024-10-13 02:28:59,145 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f8dbd39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:28:59, skipping insertion in model container [2024-10-13 02:28:59,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:57" (2/3) ... [2024-10-13 02:28:59,146 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f8dbd39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:28:59, skipping insertion in model container [2024-10-13 02:28:59,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:28:59" (3/3) ... [2024-10-13 02:28:59,149 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-17.i [2024-10-13 02:28:59,166 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 02:28:59,166 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 02:28:59,253 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 02:28:59,259 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;@2332eb1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 02:28:59,259 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 02:28:59,262 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 50 states have (on average 1.52) internal successors, (76), 51 states have internal predecessors, (76), 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 02:28:59,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-13 02:28:59,274 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:28:59,275 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, 1, 1, 1, 1] [2024-10-13 02:28:59,275 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:28:59,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:28:59,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1910996483, now seen corresponding path program 1 times [2024-10-13 02:28:59,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:28:59,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1287691749] [2024-10-13 02:28:59,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:28:59,293 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:28:59,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:28:59,296 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:28:59,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 02:28:59,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:59,584 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 02:28:59,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:28:59,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 674 proven. 0 refuted. 0 times theorem prover too weak. 626 trivial. 0 not checked. [2024-10-13 02:28:59,669 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:28:59,670 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:28:59,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1287691749] [2024-10-13 02:28:59,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1287691749] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:28:59,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:28:59,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:28:59,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205447] [2024-10-13 02:28:59,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:28:59,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 02:28:59,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:28:59,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 02:28:59,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:28:59,701 INFO L87 Difference]: Start difference. First operand has 79 states, 50 states have (on average 1.52) internal successors, (76), 51 states have internal predecessors, (76), 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 21.0) internal successors, (42), 2 states have internal predecessors, (42), 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 02:28:59,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:28:59,855 INFO L93 Difference]: Finished difference Result 155 states and 280 transitions. [2024-10-13 02:28:59,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 02:28:59,869 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 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 165 [2024-10-13 02:28:59,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:28:59,878 INFO L225 Difference]: With dead ends: 155 [2024-10-13 02:28:59,879 INFO L226 Difference]: Without dead ends: 77 [2024-10-13 02:28:59,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:28:59,888 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 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.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:28:59,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 02:28:59,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-13 02:28:59,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-13 02:28:59,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 49 states have (on average 1.4489795918367347) internal successors, (71), 49 states have internal predecessors, (71), 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 02:28:59,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 123 transitions. [2024-10-13 02:28:59,933 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 123 transitions. Word has length 165 [2024-10-13 02:28:59,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:28:59,934 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 123 transitions. [2024-10-13 02:28:59,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 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 02:28:59,935 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 123 transitions. [2024-10-13 02:28:59,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-13 02:28:59,938 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:28:59,939 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, 1, 1, 1, 1] [2024-10-13 02:28:59,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-13 02:29:00,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:29:00,140 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:29:00,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:29:00,141 INFO L85 PathProgramCache]: Analyzing trace with hash -932600123, now seen corresponding path program 1 times [2024-10-13 02:29:00,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:29:00,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [763723872] [2024-10-13 02:29:00,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:29:00,143 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:29:00,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:29:00,146 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:29:00,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 02:29:00,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:29:00,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 02:29:00,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:29:00,978 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 02:29:00,979 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:29:00,979 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:29:00,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [763723872] [2024-10-13 02:29:00,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [763723872] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:29:00,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:29:00,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 02:29:00,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031897352] [2024-10-13 02:29:00,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:29:00,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 02:29:00,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:29:00,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 02:29:00,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:29:00,987 INFO L87 Difference]: Start difference. First operand 77 states and 123 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 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 02:29:01,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:29:01,928 INFO L93 Difference]: Finished difference Result 230 states and 368 transitions. [2024-10-13 02:29:01,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 02:29:01,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 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 165 [2024-10-13 02:29:01,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:29:01,940 INFO L225 Difference]: With dead ends: 230 [2024-10-13 02:29:01,940 INFO L226 Difference]: Without dead ends: 154 [2024-10-13 02:29:01,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 02:29:01,942 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 70 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 02:29:01,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 401 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 02:29:01,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-10-13 02:29:01,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 125. [2024-10-13 02:29:01,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 70 states have (on average 1.3142857142857143) internal successors, (92), 70 states have internal predecessors, (92), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-13 02:29:01,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 196 transitions. [2024-10-13 02:29:01,986 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 196 transitions. Word has length 165 [2024-10-13 02:29:01,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:29:01,987 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 196 transitions. [2024-10-13 02:29:01,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 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 02:29:01,987 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 196 transitions. [2024-10-13 02:29:01,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-13 02:29:01,991 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:29:01,991 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, 1, 1, 1, 1, 1] [2024-10-13 02:29:01,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 02:29:02,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:29:02,192 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:29:02,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:29:02,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1678307088, now seen corresponding path program 1 times [2024-10-13 02:29:02,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:29:02,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1709453067] [2024-10-13 02:29:02,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:29:02,194 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:29:02,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:29:02,196 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:29:02,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 02:29:02,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:29:02,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 02:29:02,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:29:03,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 645 proven. 45 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2024-10-13 02:29:03,277 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:29:03,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 30 proven. 45 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-10-13 02:29:03,773 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:29:03,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1709453067] [2024-10-13 02:29:03,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1709453067] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 02:29:03,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 02:29:03,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2024-10-13 02:29:03,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390933622] [2024-10-13 02:29:03,774 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 02:29:03,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 02:29:03,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:29:03,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 02:29:03,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-13 02:29:03,780 INFO L87 Difference]: Start difference. First operand 125 states and 196 transitions. Second operand has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 4 states have call successors, (52), 3 states have call predecessors, (52), 5 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) [2024-10-13 02:29:07,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:29:07,578 INFO L93 Difference]: Finished difference Result 607 states and 960 transitions. [2024-10-13 02:29:07,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-13 02:29:07,579 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 4 states have call successors, (52), 3 states have call predecessors, (52), 5 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) Word has length 166 [2024-10-13 02:29:07,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:29:07,584 INFO L225 Difference]: With dead ends: 607 [2024-10-13 02:29:07,585 INFO L226 Difference]: Without dead ends: 531 [2024-10-13 02:29:07,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=254, Invalid=502, Unknown=0, NotChecked=0, Total=756 [2024-10-13 02:29:07,587 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 958 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 315 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 983 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 315 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-13 02:29:07,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [983 Valid, 599 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [315 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-13 02:29:07,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2024-10-13 02:29:07,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 366. [2024-10-13 02:29:07,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 244 states have (on average 1.4221311475409837) internal successors, (347), 246 states have internal predecessors, (347), 114 states have call successors, (114), 7 states have call predecessors, (114), 7 states have return successors, (114), 112 states have call predecessors, (114), 114 states have call successors, (114) [2024-10-13 02:29:07,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 575 transitions. [2024-10-13 02:29:07,663 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 575 transitions. Word has length 166 [2024-10-13 02:29:07,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:29:07,664 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 575 transitions. [2024-10-13 02:29:07,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 4 states have call successors, (52), 3 states have call predecessors, (52), 5 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) [2024-10-13 02:29:07,664 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 575 transitions. [2024-10-13 02:29:07,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-13 02:29:07,667 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:29:07,667 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, 1, 1, 1, 1, 1] [2024-10-13 02:29:07,681 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 (4)] Forceful destruction successful, exit code 0 [2024-10-13 02:29:07,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:29:07,869 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:29:07,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:29:07,873 INFO L85 PathProgramCache]: Analyzing trace with hash -657238734, now seen corresponding path program 1 times [2024-10-13 02:29:07,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:29:07,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1153535642] [2024-10-13 02:29:07,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:29:07,875 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:29:07,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:29:07,876 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:29:07,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 02:29:08,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:29:08,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-13 02:29:08,081 INFO L278 TraceCheckSpWp]: Computing forward predicates...