./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_codestructure_steplocals_file-13.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 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_codestructure_steplocals_file-13.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 2560b738ff052bf16c149e104498edb5d9849fa876e12776a2b593e99264618a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 02:35:31,708 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 02:35:31,780 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 02:35:31,787 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 02:35:31,797 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 02:35:31,869 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 02:35:31,873 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 02:35:31,874 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 02:35:31,874 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 02:35:31,879 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 02:35:31,880 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 02:35:31,880 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 02:35:31,880 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 02:35:31,881 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 02:35:31,881 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 02:35:31,881 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 02:35:31,881 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 02:35:31,882 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 02:35:31,882 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 02:35:31,892 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 02:35:31,892 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 02:35:31,901 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 02:35:31,902 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 02:35:31,904 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 02:35:31,904 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 02:35:31,904 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 02:35:31,904 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 02:35:31,904 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 02:35:31,905 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 02:35:31,905 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 02:35:31,905 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 02:35:31,905 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 02:35:31,905 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:35:31,905 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 02:35:31,906 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 02:35:31,906 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 02:35:31,906 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 02:35:31,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 02:35:31,913 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 02:35:31,914 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 02:35:31,914 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 02:35:31,914 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 02:35:31,915 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 -> 2560b738ff052bf16c149e104498edb5d9849fa876e12776a2b593e99264618a [2024-11-20 02:35:32,200 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 02:35:32,217 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 02:35:32,220 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 02:35:32,221 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 02:35:32,221 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 02:35:32,222 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-13.i [2024-11-20 02:35:34,013 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 02:35:34,393 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 02:35:34,398 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-13.i [2024-11-20 02:35:34,413 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6e706bd3/8187cf270ff04bd58f44ba657e5259e9/FLAGa2bbfbb44 [2024-11-20 02:35:34,634 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6e706bd3/8187cf270ff04bd58f44ba657e5259e9 [2024-11-20 02:35:34,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 02:35:34,650 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 02:35:34,655 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 02:35:34,656 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 02:35:34,670 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 02:35:34,673 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:35:34" (1/1) ... [2024-11-20 02:35:34,678 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78fb65a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:34, skipping insertion in model container [2024-11-20 02:35:34,684 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:35:34" (1/1) ... [2024-11-20 02:35:34,776 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 02:35:35,121 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-13.i[917,930] [2024-11-20 02:35:35,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:35:35,203 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 02:35:35,213 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-13.i[917,930] [2024-11-20 02:35:35,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:35:35,253 INFO L204 MainTranslator]: Completed translation [2024-11-20 02:35:35,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:35 WrapperNode [2024-11-20 02:35:35,254 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 02:35:35,255 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 02:35:35,255 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 02:35:35,255 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 02:35:35,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:35" (1/1) ... [2024-11-20 02:35:35,276 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:35" (1/1) ... [2024-11-20 02:35:35,321 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 177 [2024-11-20 02:35:35,321 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 02:35:35,322 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 02:35:35,326 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 02:35:35,326 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 02:35:35,344 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:35" (1/1) ... [2024-11-20 02:35:35,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:35" (1/1) ... [2024-11-20 02:35:35,355 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:35" (1/1) ... [2024-11-20 02:35:35,392 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 02:35:35,395 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:35" (1/1) ... [2024-11-20 02:35:35,395 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:35" (1/1) ... [2024-11-20 02:35:35,410 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:35" (1/1) ... [2024-11-20 02:35:35,421 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:35" (1/1) ... [2024-11-20 02:35:35,427 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:35" (1/1) ... [2024-11-20 02:35:35,431 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:35" (1/1) ... [2024-11-20 02:35:35,438 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 02:35:35,443 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 02:35:35,444 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 02:35:35,444 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 02:35:35,445 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:35" (1/1) ... [2024-11-20 02:35:35,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:35:35,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:35:35,500 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 02:35:35,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 02:35:35,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 02:35:35,585 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 02:35:35,586 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 02:35:35,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 02:35:35,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 02:35:35,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 02:35:35,702 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 02:35:35,704 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 02:35:36,090 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-20 02:35:36,091 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 02:35:36,115 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 02:35:36,120 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 02:35:36,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:35:36 BoogieIcfgContainer [2024-11-20 02:35:36,121 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 02:35:36,123 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 02:35:36,124 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 02:35:36,129 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 02:35:36,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:35:34" (1/3) ... [2024-11-20 02:35:36,131 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4962c097 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:35:36, skipping insertion in model container [2024-11-20 02:35:36,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:35" (2/3) ... [2024-11-20 02:35:36,131 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4962c097 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:35:36, skipping insertion in model container [2024-11-20 02:35:36,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:35:36" (3/3) ... [2024-11-20 02:35:36,133 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-13.i [2024-11-20 02:35:36,145 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 02:35:36,145 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 02:35:36,216 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 02:35:36,223 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;@6af41d9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 02:35:36,223 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 02:35:36,227 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 52 states have internal predecessors, (68), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 02:35:36,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-20 02:35:36,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:35:36,253 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:35:36,257 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:35:36,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:35:36,266 INFO L85 PathProgramCache]: Analyzing trace with hash -878372441, now seen corresponding path program 1 times [2024-11-20 02:35:36,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:35:36,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53741072] [2024-11-20 02:35:36,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:35:36,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:35:36,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:36,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:35:36,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:36,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:35:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:36,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:35:36,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:36,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:35:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:36,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:35:36,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:36,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:35:36,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:36,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:35:36,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:36,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:35:36,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:36,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:35:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:36,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:35:36,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:36,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:35:36,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:36,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:35:36,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:36,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:35:36,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:36,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:35:36,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:36,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:35:36,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:36,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 02:35:36,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:36,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 02:35:36,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:36,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 02:35:36,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:36,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 02:35:36,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:36,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 02:35:36,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:36,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 02:35:36,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:36,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 02:35:36,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:36,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 02:35:36,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:36,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 02:35:36,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:36,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 02:35:36,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:36,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 02:35:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:36,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 02:35:36,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:36,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 02:35:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:36,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-20 02:35:36,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:35:36,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53741072] [2024-11-20 02:35:36,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53741072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:35:36,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:35:36,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 02:35:36,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041908699] [2024-11-20 02:35:36,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:35:36,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 02:35:36,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:35:36,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 02:35:36,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:35:36,707 INFO L87 Difference]: Start difference. First operand has 82 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 52 states have internal predecessors, (68), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-20 02:35:36,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:35:36,744 INFO L93 Difference]: Finished difference Result 157 states and 270 transitions. [2024-11-20 02:35:36,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 02:35:36,746 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 179 [2024-11-20 02:35:36,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:35:36,757 INFO L225 Difference]: With dead ends: 157 [2024-11-20 02:35:36,761 INFO L226 Difference]: Without dead ends: 78 [2024-11-20 02:35:36,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:35:36,771 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:35:36,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:35:36,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-20 02:35:36,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-20 02:35:36,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 02:35:36,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 116 transitions. [2024-11-20 02:35:36,920 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 116 transitions. Word has length 179 [2024-11-20 02:35:36,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:35:36,920 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 116 transitions. [2024-11-20 02:35:36,957 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-20 02:35:36,957 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 116 transitions. [2024-11-20 02:35:36,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-20 02:35:36,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:35:36,960 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:35:36,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 02:35:36,966 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:35:36,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:35:36,966 INFO L85 PathProgramCache]: Analyzing trace with hash 550614943, now seen corresponding path program 1 times [2024-11-20 02:35:36,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:35:36,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874753954] [2024-11-20 02:35:36,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:35:36,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:35:37,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:35:37,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:35:37,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:35:37,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:35:37,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:35:37,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:35:37,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:35:37,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:35:37,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:35:37,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:35:37,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:35:37,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:35:37,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:35:37,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:35:37,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:35:37,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 02:35:37,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 02:35:37,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 02:35:37,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 02:35:37,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 02:35:37,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 02:35:37,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 02:35:37,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 02:35:37,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 02:35:37,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 02:35:37,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 02:35:37,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 02:35:37,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 02:35:37,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-20 02:35:37,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:35:37,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874753954] [2024-11-20 02:35:37,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874753954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:35:37,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:35:37,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 02:35:37,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923433351] [2024-11-20 02:35:37,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:35:37,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 02:35:37,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:35:37,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 02:35:37,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:35:37,328 INFO L87 Difference]: Start difference. First operand 78 states and 116 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 02:35:37,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:35:37,368 INFO L93 Difference]: Finished difference Result 196 states and 290 transitions. [2024-11-20 02:35:37,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 02:35:37,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 179 [2024-11-20 02:35:37,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:35:37,371 INFO L225 Difference]: With dead ends: 196 [2024-11-20 02:35:37,371 INFO L226 Difference]: Without dead ends: 121 [2024-11-20 02:35:37,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:35:37,373 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 55 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:35:37,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 273 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:35:37,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-20 02:35:37,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 118. [2024-11-20 02:35:37,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 76 states have internal predecessors, (94), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-20 02:35:37,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 174 transitions. [2024-11-20 02:35:37,392 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 174 transitions. Word has length 179 [2024-11-20 02:35:37,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:35:37,393 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 174 transitions. [2024-11-20 02:35:37,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 02:35:37,393 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 174 transitions. [2024-11-20 02:35:37,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-20 02:35:37,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:35:37,396 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:35:37,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 02:35:37,396 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:35:37,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:35:37,396 INFO L85 PathProgramCache]: Analyzing trace with hash -729248735, now seen corresponding path program 1 times [2024-11-20 02:35:37,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:35:37,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600839837] [2024-11-20 02:35:37,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:35:37,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:35:37,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:35:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:35:37,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:35:37,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:35:37,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:35:37,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:35:37,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:35:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:35:37,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:35:37,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:35:37,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:35:37,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:35:37,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:35:37,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:35:37,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:35:37,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 02:35:37,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 02:35:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 02:35:37,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 02:35:37,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 02:35:37,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 02:35:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 02:35:37,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 02:35:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 02:35:37,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 02:35:37,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 02:35:37,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 02:35:37,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 02:35:37,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:37,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-20 02:35:37,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:35:37,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600839837] [2024-11-20 02:35:37,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600839837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:35:37,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:35:37,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 02:35:37,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352148402] [2024-11-20 02:35:37,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:35:37,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 02:35:37,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:35:37,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 02:35:37,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 02:35:37,781 INFO L87 Difference]: Start difference. First operand 118 states and 174 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 02:35:37,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:35:37,907 INFO L93 Difference]: Finished difference Result 296 states and 430 transitions. [2024-11-20 02:35:37,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 02:35:37,908 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 179 [2024-11-20 02:35:37,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:35:37,910 INFO L225 Difference]: With dead ends: 296 [2024-11-20 02:35:37,911 INFO L226 Difference]: Without dead ends: 181 [2024-11-20 02:35:37,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 02:35:37,915 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 37 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 02:35:37,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 408 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 02:35:37,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-20 02:35:37,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 177. [2024-11-20 02:35:37,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 124 states have (on average 1.2741935483870968) internal successors, (158), 127 states have internal predecessors, (158), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-20 02:35:37,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 254 transitions. [2024-11-20 02:35:37,941 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 254 transitions. Word has length 179 [2024-11-20 02:35:37,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:35:37,943 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 254 transitions. [2024-11-20 02:35:37,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 02:35:37,943 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 254 transitions. [2024-11-20 02:35:37,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-20 02:35:37,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:35:37,949 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:35:37,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 02:35:37,949 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:35:37,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:35:37,949 INFO L85 PathProgramCache]: Analyzing trace with hash -28184157, now seen corresponding path program 1 times [2024-11-20 02:35:37,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:35:37,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721917735] [2024-11-20 02:35:37,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:35:37,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:35:38,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 02:35:38,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [682649964] [2024-11-20 02:35:38,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:35:38,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 02:35:38,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:35:38,077 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 02:35:38,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 02:35:38,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 02:35:38,292 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 02:35:38,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 02:35:38,490 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 02:35:38,494 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 02:35:38,496 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 02:35:38,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-20 02:35:38,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 02:35:38,704 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-20 02:35:38,909 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 02:35:38,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 02:35:38 BoogieIcfgContainer [2024-11-20 02:35:38,914 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 02:35:38,914 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 02:35:38,914 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 02:35:38,915 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 02:35:38,915 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:35:36" (3/4) ... [2024-11-20 02:35:38,917 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 02:35:38,918 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 02:35:38,919 INFO L158 Benchmark]: Toolchain (without parser) took 4268.46ms. Allocated memory is still 186.6MB. Free memory was 155.5MB in the beginning and 144.1MB in the end (delta: 11.4MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2024-11-20 02:35:38,919 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 136.3MB. Free memory is still 95.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 02:35:38,919 INFO L158 Benchmark]: CACSL2BoogieTranslator took 598.89ms. Allocated memory is still 186.6MB. Free memory was 155.5MB in the beginning and 139.1MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 02:35:38,921 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.90ms. Allocated memory is still 186.6MB. Free memory was 139.1MB in the beginning and 134.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 02:35:38,921 INFO L158 Benchmark]: Boogie Preprocessor took 120.18ms. Allocated memory is still 186.6MB. Free memory was 134.9MB in the beginning and 128.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 02:35:38,922 INFO L158 Benchmark]: RCFGBuilder took 678.34ms. Allocated memory is still 186.6MB. Free memory was 128.6MB in the beginning and 104.5MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-20 02:35:38,922 INFO L158 Benchmark]: TraceAbstraction took 2791.22ms. Allocated memory is still 186.6MB. Free memory was 104.5MB in the beginning and 144.1MB in the end (delta: -39.6MB). Peak memory consumption was 53.7MB. Max. memory is 16.1GB. [2024-11-20 02:35:38,922 INFO L158 Benchmark]: Witness Printer took 3.78ms. Allocated memory is still 186.6MB. Free memory is still 144.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 02:35:38,926 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 136.3MB. Free memory is still 95.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 598.89ms. Allocated memory is still 186.6MB. Free memory was 155.5MB in the beginning and 139.1MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.90ms. Allocated memory is still 186.6MB. Free memory was 139.1MB in the beginning and 134.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 120.18ms. Allocated memory is still 186.6MB. Free memory was 134.9MB in the beginning and 128.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 678.34ms. Allocated memory is still 186.6MB. Free memory was 128.6MB in the beginning and 104.5MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 2791.22ms. Allocated memory is still 186.6MB. Free memory was 104.5MB in the beginning and 144.1MB in the end (delta: -39.6MB). Peak memory consumption was 53.7MB. Max. memory is 16.1GB. * Witness Printer took 3.78ms. Allocated memory is still 186.6MB. Free memory is still 144.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 139. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 32; [L23] unsigned short int var_1_2 = 256; [L24] signed long int var_1_3 = 500; [L25] signed char var_1_4 = 16; [L26] unsigned char var_1_5 = 1; [L27] unsigned char var_1_6 = 1; [L28] unsigned short int var_1_7 = 50; [L29] unsigned char var_1_8 = 1; [L30] unsigned char var_1_9 = 0; [L31] unsigned char var_1_10 = 128; [L32] unsigned char var_1_11 = 64; [L33] signed char var_1_12 = -10; [L34] signed char var_1_13 = -10; [L35] signed char var_1_14 = -25; [L36] double var_1_15 = 64.875; [L37] unsigned long int var_1_16 = 1000000; [L38] double var_1_17 = 1.625; [L39] double var_1_18 = 32.2; [L40] double var_1_19 = 8.6; [L41] double var_1_20 = 10.5; [L42] signed short int var_1_21 = -64; [L43] unsigned char var_1_22 = 25; [L44] unsigned char var_1_23 = 0; [L45] unsigned long int var_1_24 = 5; VAL [isInitial=0, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_2=256, var_1_3=500, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L143] isInitial = 1 [L144] FCALL initially() [L145] COND TRUE 1 [L146] FCALL updateLastVariables() [L147] CALL updateVariables() [L91] var_1_2 = __VERIFIER_nondet_ushort() [L92] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=500, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=500, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L92] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=500, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L93] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=500, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=500, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L93] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=500, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L94] var_1_3 = __VERIFIER_nondet_long() [L95] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L95] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L96] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L96] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L97] var_1_4 = __VERIFIER_nondet_char() [L98] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L98] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L99] CALL assume_abort_if_not(var_1_4 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L99] RET assume_abort_if_not(var_1_4 <= 32) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L100] var_1_5 = __VERIFIER_nondet_uchar() [L101] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L101] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L102] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L102] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L103] var_1_6 = __VERIFIER_nondet_uchar() [L104] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=50, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=50, var_1_8=1, var_1_9=0] [L104] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=50, var_1_8=1, var_1_9=0] [L105] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=50, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=50, var_1_8=1, var_1_9=0] [L105] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=50, var_1_8=1, var_1_9=0] [L106] var_1_7 = __VERIFIER_nondet_ushort() [L107] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L107] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L108] CALL assume_abort_if_not(var_1_7 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L108] RET assume_abort_if_not(var_1_7 <= 65534) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L109] var_1_9 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1] [L110] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1] [L111] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L111] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L112] var_1_10 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L113] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L114] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L114] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L115] var_1_11 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_11 >= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=-193, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=-193, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L116] RET assume_abort_if_not(var_1_11 >= 63) VAL [isInitial=1, var_1_10=127, var_1_11=-193, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L117] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=-193, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=-193, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L117] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, var_1_10=127, var_1_11=-193, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L118] var_1_13 = __VERIFIER_nondet_char() [L119] CALL assume_abort_if_not(var_1_13 >= -31) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L119] RET assume_abort_if_not(var_1_13 >= -31) VAL [isInitial=1, var_1_10=127, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L120] CALL assume_abort_if_not(var_1_13 <= 31) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L120] RET assume_abort_if_not(var_1_13 <= 31) VAL [isInitial=1, var_1_10=127, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L121] var_1_14 = __VERIFIER_nondet_char() [L122] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=32, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=32, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L122] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, var_1_10=127, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=32, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L123] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=32, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=32, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L123] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, var_1_10=127, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=32, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L124] var_1_16 = __VERIFIER_nondet_ulong() [L125] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=32, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=32, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L125] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=127, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=32, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L126] CALL assume_abort_if_not(var_1_16 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=32, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=32, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L126] RET assume_abort_if_not(var_1_16 <= 4294967295) VAL [isInitial=1, var_1_10=127, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=32, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L127] var_1_17 = __VERIFIER_nondet_double() [L128] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=32, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=32, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L128] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=127, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=32, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L129] var_1_18 = __VERIFIER_nondet_double() [L130] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=32, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=32, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L130] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=127, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=32, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L131] var_1_19 = __VERIFIER_nondet_double() [L132] CALL assume_abort_if_not((var_1_19 >= -230584.3009213691390e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 2305843.009213691390e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=32, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=32, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L132] RET assume_abort_if_not((var_1_19 >= -230584.3009213691390e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 2305843.009213691390e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=127, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=32, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L133] var_1_20 = __VERIFIER_nondet_double() [L134] CALL assume_abort_if_not((var_1_20 >= -230584.3009213691390e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 2305843.009213691390e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=32, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=32, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L134] RET assume_abort_if_not((var_1_20 >= -230584.3009213691390e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 2305843.009213691390e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=127, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=32, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L147] RET updateVariables() [L148] CALL step() [L49] unsigned char stepLocal_1 = var_1_5; VAL [isInitial=1, stepLocal_1=0, var_1_10=127, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=32, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L50] EXPR var_1_3 >> var_1_4 VAL [isInitial=1, stepLocal_1=0, var_1_10=127, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=32, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L50] signed long int stepLocal_0 = var_1_3 >> var_1_4; [L51] COND FALSE !((~ var_1_2) != stepLocal_0) [L58] var_1_1 = 100 VAL [isInitial=1, stepLocal_1=0, var_1_10=127, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=32, var_1_15=519/8, var_1_1=100, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L60] COND FALSE !(\read(var_1_9)) VAL [isInitial=1, stepLocal_1=0, var_1_10=127, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=32, var_1_15=519/8, var_1_1=100, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L63] unsigned char stepLocal_2 = var_1_8; VAL [isInitial=1, stepLocal_1=0, stepLocal_2=1, var_1_10=127, var_1_11=-193, var_1_12=-10, var_1_13=31, var_1_14=32, var_1_15=519/8, var_1_1=100, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L64] COND TRUE var_1_10 > stepLocal_2 [L65] var_1_12 = ((var_1_4 + var_1_13) + var_1_14) VAL [isInitial=1, stepLocal_1=0, var_1_10=127, var_1_11=-193, var_1_12=63, var_1_13=31, var_1_14=32, var_1_15=519/8, var_1_1=100, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L67] unsigned short int stepLocal_3 = var_1_1; VAL [isInitial=1, stepLocal_1=0, stepLocal_3=100, var_1_10=127, var_1_11=-193, var_1_12=63, var_1_13=31, var_1_14=32, var_1_15=519/8, var_1_1=100, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L68] COND FALSE !(var_1_4 > stepLocal_3) [L71] var_1_15 = var_1_17 VAL [isInitial=1, stepLocal_1=0, var_1_10=127, var_1_11=-193, var_1_12=63, var_1_13=31, var_1_14=32, var_1_15=2, var_1_17=2, var_1_1=100, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L73] COND FALSE !(var_1_6 || var_1_9) VAL [isInitial=1, stepLocal_1=0, var_1_10=127, var_1_11=-193, var_1_12=63, var_1_13=31, var_1_14=32, var_1_15=2, var_1_17=2, var_1_1=100, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L78] COND TRUE ((- var_1_11) < 8) || var_1_9 [L79] var_1_22 = (var_1_4 + ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) VAL [isInitial=1, stepLocal_1=0, var_1_10=127, var_1_11=-193, var_1_12=63, var_1_13=31, var_1_14=32, var_1_15=2, var_1_17=2, var_1_1=100, var_1_21=-64, var_1_22=63, var_1_23=0, var_1_24=5, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L81] var_1_23 = (var_1_11 + var_1_4) VAL [isInitial=1, stepLocal_1=0, var_1_10=127, var_1_11=-193, var_1_12=63, var_1_13=31, var_1_14=32, var_1_15=2, var_1_17=2, var_1_1=100, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=5, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L82] COND TRUE var_1_18 <= var_1_20 [L83] var_1_24 = ((((var_1_8) < ((var_1_7 + var_1_11))) ? (var_1_8) : ((var_1_7 + var_1_11)))) VAL [isInitial=1, stepLocal_1=0, var_1_10=127, var_1_11=-193, var_1_12=63, var_1_13=31, var_1_14=32, var_1_15=2, var_1_17=2, var_1_1=100, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L148] RET step() [L149] CALL, EXPR property() [L139] EXPR var_1_3 >> var_1_4 VAL [isInitial=1, var_1_10=127, var_1_11=-193, var_1_12=63, var_1_13=31, var_1_14=32, var_1_15=2, var_1_17=2, var_1_1=100, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L139-L140] return (((((((((~ var_1_2) != (var_1_3 >> var_1_4)) ? ((var_1_5 || var_1_6) ? (var_1_1 == ((unsigned short int) var_1_4)) : (var_1_1 == ((unsigned short int) var_1_7))) : (var_1_1 == ((unsigned short int) 100))) && (var_1_9 ? (var_1_8 == ((unsigned char) (var_1_10 - (var_1_11 - var_1_4)))) : 1)) && ((var_1_10 > var_1_8) ? (var_1_12 == ((signed char) ((var_1_4 + var_1_13) + var_1_14))) : 1)) && ((var_1_4 > var_1_1) ? (var_1_15 == ((double) ((var_1_17 - var_1_18) + (((((var_1_19) > (499.25)) ? (var_1_19) : (499.25))) + var_1_20)))) : (var_1_15 == ((double) var_1_17)))) && ((var_1_6 || var_1_9) ? (((var_1_8 % var_1_10) > var_1_16) ? (var_1_21 == ((signed short int) (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) + var_1_14))) : 1) : 1)) && ((((- var_1_11) < 8) || var_1_9) ? (var_1_22 == ((unsigned char) (var_1_4 + ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) : 1)) && (var_1_23 == ((unsigned char) (var_1_11 + var_1_4)))) && ((var_1_18 <= var_1_20) ? (var_1_24 == ((unsigned long int) ((((var_1_8) < ((var_1_7 + var_1_11))) ? (var_1_8) : ((var_1_7 + var_1_11)))))) : ((9.99999999999998E13 < var_1_20) ? (var_1_24 == ((unsigned long int) var_1_23)) : 1)) ; [L149] RET, EXPR property() [L149] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=127, var_1_11=-193, var_1_12=63, var_1_13=31, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=2, var_1_1=100, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=127, var_1_11=-193, var_1_12=63, var_1_13=31, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=2, var_1_1=100, var_1_21=-64, var_1_22=63, var_1_23=63, var_1_24=1, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 82 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 4, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 92 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 92 mSDsluCounter, 797 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 396 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 83 IncrementalHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 401 mSDtfsCounter, 83 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 206 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=177occurred in iteration=3, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 7 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 895 NumberOfCodeBlocks, 895 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 534 ConstructedInterpolants, 0 QuantifiedInterpolants, 585 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 4536/4536 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 02:35:38,947 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_codestructure_steplocals_file-13.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 2560b738ff052bf16c149e104498edb5d9849fa876e12776a2b593e99264618a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 02:35:41,700 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 02:35:41,766 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 02:35:41,771 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 02:35:41,772 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 02:35:41,799 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 02:35:41,799 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 02:35:41,800 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 02:35:41,800 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 02:35:41,800 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 02:35:41,801 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 02:35:41,801 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 02:35:41,801 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 02:35:41,803 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 02:35:41,803 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 02:35:41,804 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 02:35:41,804 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 02:35:41,804 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 02:35:41,804 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 02:35:41,804 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 02:35:41,805 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 02:35:41,807 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 02:35:41,807 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 02:35:41,808 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 02:35:41,808 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 02:35:41,808 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 02:35:41,808 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 02:35:41,808 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 02:35:41,808 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 02:35:41,808 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 02:35:41,808 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 02:35:41,809 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 02:35:41,809 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 02:35:41,809 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 02:35:41,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:35:41,809 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 02:35:41,809 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 02:35:41,809 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 02:35:41,810 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 02:35:41,810 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 02:35:41,810 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 02:35:41,811 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 02:35:41,812 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 02:35:41,812 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 02:35:41,812 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 -> 2560b738ff052bf16c149e104498edb5d9849fa876e12776a2b593e99264618a [2024-11-20 02:35:42,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 02:35:42,147 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 02:35:42,149 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 02:35:42,149 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 02:35:42,151 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 02:35:42,152 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-13.i [2024-11-20 02:35:43,895 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 02:35:44,128 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 02:35:44,128 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-13.i [2024-11-20 02:35:44,135 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d771f6b2/46039f4277124ddba0eaa791fe811b27/FLAGc2a29336e [2024-11-20 02:35:44,146 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d771f6b2/46039f4277124ddba0eaa791fe811b27 [2024-11-20 02:35:44,148 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 02:35:44,149 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 02:35:44,151 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 02:35:44,167 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 02:35:44,176 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 02:35:44,177 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:35:44" (1/1) ... [2024-11-20 02:35:44,179 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f610eeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:44, skipping insertion in model container [2024-11-20 02:35:44,179 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:35:44" (1/1) ... [2024-11-20 02:35:44,229 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 02:35:44,392 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-13.i[917,930] [2024-11-20 02:35:44,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:35:44,468 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 02:35:44,479 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-13.i[917,930] [2024-11-20 02:35:44,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:35:44,528 INFO L204 MainTranslator]: Completed translation [2024-11-20 02:35:44,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:44 WrapperNode [2024-11-20 02:35:44,528 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 02:35:44,529 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 02:35:44,529 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 02:35:44,529 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 02:35:44,533 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:44" (1/1) ... [2024-11-20 02:35:44,548 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:44" (1/1) ... [2024-11-20 02:35:44,570 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 160 [2024-11-20 02:35:44,570 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 02:35:44,571 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 02:35:44,571 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 02:35:44,571 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 02:35:44,585 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:44" (1/1) ... [2024-11-20 02:35:44,585 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:44" (1/1) ... [2024-11-20 02:35:44,589 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:44" (1/1) ... [2024-11-20 02:35:44,609 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 02:35:44,612 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:44" (1/1) ... [2024-11-20 02:35:44,613 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:44" (1/1) ... [2024-11-20 02:35:44,638 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:44" (1/1) ... [2024-11-20 02:35:44,641 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:44" (1/1) ... [2024-11-20 02:35:44,648 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:44" (1/1) ... [2024-11-20 02:35:44,655 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:44" (1/1) ... [2024-11-20 02:35:44,658 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 02:35:44,659 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 02:35:44,663 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 02:35:44,663 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 02:35:44,664 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:44" (1/1) ... [2024-11-20 02:35:44,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:35:44,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:35:44,721 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 02:35:44,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 02:35:44,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 02:35:44,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 02:35:44,795 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 02:35:44,795 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 02:35:44,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 02:35:44,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 02:35:44,885 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 02:35:44,896 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 02:35:50,962 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-20 02:35:50,963 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 02:35:50,979 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 02:35:50,982 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 02:35:50,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:35:50 BoogieIcfgContainer [2024-11-20 02:35:50,983 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 02:35:50,984 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 02:35:50,988 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 02:35:50,991 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 02:35:50,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:35:44" (1/3) ... [2024-11-20 02:35:50,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd0b07f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:35:50, skipping insertion in model container [2024-11-20 02:35:50,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:35:44" (2/3) ... [2024-11-20 02:35:50,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd0b07f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:35:50, skipping insertion in model container [2024-11-20 02:35:50,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:35:50" (3/3) ... [2024-11-20 02:35:50,999 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-13.i [2024-11-20 02:35:51,012 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 02:35:51,012 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 02:35:51,088 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 02:35:51,098 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;@277ef764, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 02:35:51,099 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 02:35:51,106 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 46 states have internal predecessors, (60), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 02:35:51,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-20 02:35:51,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:35:51,121 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:35:51,121 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:35:51,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:35:51,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1522441889, now seen corresponding path program 1 times [2024-11-20 02:35:51,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:35:51,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [330313308] [2024-11-20 02:35:51,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:35:51,139 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 02:35:51,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:35:51,145 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 02:35:51,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 02:35:51,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:51,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 02:35:51,546 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:35:51,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 614 proven. 0 refuted. 0 times theorem prover too weak. 898 trivial. 0 not checked. [2024-11-20 02:35:51,581 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 02:35:51,582 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 02:35:51,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [330313308] [2024-11-20 02:35:51,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [330313308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:35:51,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:35:51,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 02:35:51,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554399748] [2024-11-20 02:35:51,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:35:51,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 02:35:51,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 02:35:51,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 02:35:51,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:35:51,604 INFO L87 Difference]: Start difference. First operand has 76 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 46 states have internal predecessors, (60), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) 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, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-20 02:35:51,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:35:51,643 INFO L93 Difference]: Finished difference Result 145 states and 254 transitions. [2024-11-20 02:35:51,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 02:35:51,644 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, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 175 [2024-11-20 02:35:51,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:35:51,651 INFO L225 Difference]: With dead ends: 145 [2024-11-20 02:35:51,651 INFO L226 Difference]: Without dead ends: 72 [2024-11-20 02:35:51,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:35:51,660 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:35:51,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:35:51,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-20 02:35:51,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-20 02:35:51,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 02:35:51,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 108 transitions. [2024-11-20 02:35:51,718 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 108 transitions. Word has length 175 [2024-11-20 02:35:51,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:35:51,718 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 108 transitions. [2024-11-20 02:35:51,719 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, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-20 02:35:51,719 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 108 transitions. [2024-11-20 02:35:51,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-20 02:35:51,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:35:51,723 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:35:51,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-20 02:35:51,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 02:35:51,924 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:35:51,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:35:51,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1013204137, now seen corresponding path program 1 times [2024-11-20 02:35:51,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:35:51,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [933467371] [2024-11-20 02:35:51,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:35:51,928 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 02:35:51,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:35:51,932 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 02:35:51,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 02:35:52,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:35:52,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-20 02:35:52,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:35:54,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 428 proven. 132 refuted. 0 times theorem prover too weak. 952 trivial. 0 not checked. [2024-11-20 02:35:54,220 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 02:35:55,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 15 proven. 66 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-20 02:35:55,042 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 02:35:55,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [933467371] [2024-11-20 02:35:55,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [933467371] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 02:35:55,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 02:35:55,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2024-11-20 02:35:55,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346987743] [2024-11-20 02:35:55,043 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 02:35:55,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-20 02:35:55,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 02:35:55,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-20 02:35:55,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2024-11-20 02:35:55,050 INFO L87 Difference]: Start difference. First operand 72 states and 108 transitions. Second operand has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 14 states have internal predecessors, (70), 4 states have call successors, (51), 3 states have call predecessors, (51), 5 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) [2024-11-20 02:35:58,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 02:36:02,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.48s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 02:36:03,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:36:03,614 INFO L93 Difference]: Finished difference Result 209 states and 299 transitions. [2024-11-20 02:36:03,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-20 02:36:03,622 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 14 states have internal predecessors, (70), 4 states have call successors, (51), 3 states have call predecessors, (51), 5 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) Word has length 175 [2024-11-20 02:36:03,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:36:03,626 INFO L225 Difference]: With dead ends: 209 [2024-11-20 02:36:03,626 INFO L226 Difference]: Without dead ends: 140 [2024-11-20 02:36:03,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=191, Invalid=459, Unknown=0, NotChecked=0, Total=650 [2024-11-20 02:36:03,630 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 318 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2024-11-20 02:36:03,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 353 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2024-11-20 02:36:03,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-20 02:36:03,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 106. [2024-11-20 02:36:03,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 70 states have internal predecessors, (86), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-20 02:36:03,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 150 transitions. [2024-11-20 02:36:03,656 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 150 transitions. Word has length 175 [2024-11-20 02:36:03,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:36:03,656 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 150 transitions. [2024-11-20 02:36:03,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 14 states have internal predecessors, (70), 4 states have call successors, (51), 3 states have call predecessors, (51), 5 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) [2024-11-20 02:36:03,657 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 150 transitions. [2024-11-20 02:36:03,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-20 02:36:03,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:36:03,665 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:36:03,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-20 02:36:03,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 02:36:03,870 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:36:03,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:36:03,870 INFO L85 PathProgramCache]: Analyzing trace with hash -333145767, now seen corresponding path program 1 times [2024-11-20 02:36:03,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:36:03,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1111820655] [2024-11-20 02:36:03,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:36:03,872 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 02:36:03,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:36:03,874 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-11-20 02:36:03,876 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-11-20 02:36:04,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:36:04,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 02:36:04,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:36:04,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-20 02:36:04,321 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 02:36:04,326 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 02:36:04,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1111820655] [2024-11-20 02:36:04,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1111820655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:36:04,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:36:04,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 02:36:04,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367061229] [2024-11-20 02:36:04,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:36:04,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 02:36:04,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 02:36:04,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 02:36:04,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:36:04,330 INFO L87 Difference]: Start difference. First operand 106 states and 150 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 02:36:07,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.38s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 02:36:07,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:36:07,879 INFO L93 Difference]: Finished difference Result 282 states and 394 transitions. [2024-11-20 02:36:07,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 02:36:07,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 175 [2024-11-20 02:36:07,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:36:07,884 INFO L225 Difference]: With dead ends: 282 [2024-11-20 02:36:07,885 INFO L226 Difference]: Without dead ends: 179 [2024-11-20 02:36:07,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:36:07,887 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 51 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-20 02:36:07,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 250 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-20 02:36:07,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-20 02:36:07,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2024-11-20 02:36:07,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 119 states have (on average 1.2352941176470589) internal successors, (147), 122 states have internal predecessors, (147), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-20 02:36:07,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 243 transitions. [2024-11-20 02:36:07,945 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 243 transitions. Word has length 175 [2024-11-20 02:36:07,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:36:07,946 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 243 transitions. [2024-11-20 02:36:07,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 02:36:07,946 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 243 transitions. [2024-11-20 02:36:07,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-20 02:36:07,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:36:07,951 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:36:07,987 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-11-20 02:36:08,155 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-11-20 02:36:08,156 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:36:08,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:36:08,157 INFO L85 PathProgramCache]: Analyzing trace with hash -919951781, now seen corresponding path program 1 times [2024-11-20 02:36:08,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:36:08,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1670868500] [2024-11-20 02:36:08,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:36:08,159 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 02:36:08,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:36:08,161 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-11-20 02:36:08,162 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-11-20 02:36:08,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:36:08,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-20 02:36:08,461 INFO L278 TraceCheckSpWp]: Computing forward predicates...