./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_normal_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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_normal_file-66.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 836ad92e304b81ed0820392d23ad5f20819734bbfce0803ec8d4151f7117c333 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 07:32:31,715 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 07:32:31,828 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 07:32:31,834 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 07:32:31,835 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 07:32:31,862 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 07:32:31,863 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 07:32:31,863 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 07:32:31,864 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 07:32:31,865 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 07:32:31,866 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 07:32:31,866 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 07:32:31,867 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 07:32:31,868 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 07:32:31,871 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 07:32:31,872 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 07:32:31,872 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 07:32:31,872 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 07:32:31,872 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 07:32:31,872 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 07:32:31,872 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 07:32:31,873 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 07:32:31,873 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 07:32:31,873 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 07:32:31,874 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 07:32:31,874 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 07:32:31,874 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 07:32:31,874 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 07:32:31,874 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 07:32:31,875 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 07:32:31,875 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 07:32:31,875 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 07:32:31,875 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:32:31,875 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 07:32:31,876 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 07:32:31,876 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 07:32:31,876 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 07:32:31,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 07:32:31,878 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 07:32:31,878 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 07:32:31,879 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 07:32:31,879 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 07:32:31,879 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 -> 836ad92e304b81ed0820392d23ad5f20819734bbfce0803ec8d4151f7117c333 [2024-10-14 07:32:32,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 07:32:32,188 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 07:32:32,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 07:32:32,192 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 07:32:32,192 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 07:32:32,194 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-66.i [2024-10-14 07:32:33,610 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 07:32:33,812 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 07:32:33,816 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-66.i [2024-10-14 07:32:33,827 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b860edaf/4688b85b345047ce8e2040814bac3ec9/FLAG193955d8b [2024-10-14 07:32:33,839 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b860edaf/4688b85b345047ce8e2040814bac3ec9 [2024-10-14 07:32:33,841 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 07:32:33,842 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 07:32:33,843 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 07:32:33,843 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 07:32:33,847 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 07:32:33,848 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:32:33" (1/1) ... [2024-10-14 07:32:33,849 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29c66db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:32:33, skipping insertion in model container [2024-10-14 07:32:33,849 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:32:33" (1/1) ... [2024-10-14 07:32:33,875 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 07:32:33,997 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-66.i[913,926] [2024-10-14 07:32:34,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:32:34,055 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 07:32:34,066 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-66.i[913,926] [2024-10-14 07:32:34,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:32:34,106 INFO L204 MainTranslator]: Completed translation [2024-10-14 07:32:34,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:32:34 WrapperNode [2024-10-14 07:32:34,110 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 07:32:34,111 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 07:32:34,111 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 07:32:34,111 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 07:32:34,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:32:34" (1/1) ... [2024-10-14 07:32:34,163 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:32:34" (1/1) ... [2024-10-14 07:32:34,242 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 149 [2024-10-14 07:32:34,245 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 07:32:34,246 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 07:32:34,246 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 07:32:34,246 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 07:32:34,260 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:32:34" (1/1) ... [2024-10-14 07:32:34,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:32:34" (1/1) ... [2024-10-14 07:32:34,263 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:32:34" (1/1) ... [2024-10-14 07:32:34,286 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 07:32:34,290 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:32:34" (1/1) ... [2024-10-14 07:32:34,290 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:32:34" (1/1) ... [2024-10-14 07:32:34,296 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:32:34" (1/1) ... [2024-10-14 07:32:34,303 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:32:34" (1/1) ... [2024-10-14 07:32:34,308 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:32:34" (1/1) ... [2024-10-14 07:32:34,309 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:32:34" (1/1) ... [2024-10-14 07:32:34,316 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 07:32:34,318 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 07:32:34,318 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 07:32:34,318 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 07:32:34,319 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:32:34" (1/1) ... [2024-10-14 07:32:34,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:32:34,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:32:34,354 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 07:32:34,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 07:32:34,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 07:32:34,427 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 07:32:34,427 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 07:32:34,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 07:32:34,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 07:32:34,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 07:32:34,488 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 07:32:34,490 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 07:32:34,792 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-14 07:32:34,793 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 07:32:34,837 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 07:32:34,837 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 07:32:34,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:32:34 BoogieIcfgContainer [2024-10-14 07:32:34,838 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 07:32:34,841 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 07:32:34,842 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 07:32:34,844 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 07:32:34,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:32:33" (1/3) ... [2024-10-14 07:32:34,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15214c3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:32:34, skipping insertion in model container [2024-10-14 07:32:34,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:32:34" (2/3) ... [2024-10-14 07:32:34,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15214c3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:32:34, skipping insertion in model container [2024-10-14 07:32:34,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:32:34" (3/3) ... [2024-10-14 07:32:34,846 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-66.i [2024-10-14 07:32:34,866 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 07:32:34,867 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 07:32:34,931 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 07:32:34,936 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;@52f03baf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 07:32:34,936 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 07:32:34,940 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 36 states have internal predecessors, (52), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 07:32:34,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-14 07:32:34,951 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:32:34,952 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:32:34,953 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:32:34,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:32:34,958 INFO L85 PathProgramCache]: Analyzing trace with hash -575482394, now seen corresponding path program 1 times [2024-10-14 07:32:34,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:32:34,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911563634] [2024-10-14 07:32:34,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:32:34,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:32:35,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:35,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:32:35,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:35,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:32:35,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:35,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:32:35,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:35,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:32:35,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:35,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:32:35,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:35,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:32:35,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:35,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:32:35,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:35,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:32:35,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:35,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:32:35,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:35,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:32:35,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:35,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 07:32:35,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:35,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:32:35,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:35,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 07:32:35,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:35,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 07:32:35,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:35,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 07:32:35,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:35,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 07:32:35,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:35,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 07:32:35,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:35,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 07:32:35,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:35,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 07:32:35,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:35,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 07:32:35,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:35,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 07:32:35,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:35,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 07:32:35,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:35,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 07:32:35,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:35,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 07:32:35,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:35,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 07:32:35,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:35,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 07:32:35,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:35,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 07:32:35,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:32:35,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911563634] [2024-10-14 07:32:35,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911563634] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:32:35,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:32:35,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 07:32:35,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187662499] [2024-10-14 07:32:35,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:32:35,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 07:32:35,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:32:35,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 07:32:35,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 07:32:35,400 INFO L87 Difference]: Start difference. First operand has 64 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 36 states have internal predecessors, (52), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 07:32:35,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:32:35,442 INFO L93 Difference]: Finished difference Result 125 states and 232 transitions. [2024-10-14 07:32:35,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 07:32:35,446 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 156 [2024-10-14 07:32:35,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:32:35,452 INFO L225 Difference]: With dead ends: 125 [2024-10-14 07:32:35,453 INFO L226 Difference]: Without dead ends: 62 [2024-10-14 07:32:35,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 07:32:35,461 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:32:35,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:32:35,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-14 07:32:35,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-10-14 07:32:35,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 states have internal predecessors, (47), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 07:32:35,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 99 transitions. [2024-10-14 07:32:35,505 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 99 transitions. Word has length 156 [2024-10-14 07:32:35,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:32:35,505 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 99 transitions. [2024-10-14 07:32:35,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 07:32:35,506 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 99 transitions. [2024-10-14 07:32:35,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-14 07:32:35,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:32:35,509 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:32:35,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 07:32:35,509 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:32:35,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:32:35,510 INFO L85 PathProgramCache]: Analyzing trace with hash 560531238, now seen corresponding path program 1 times [2024-10-14 07:32:35,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:32:35,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365776579] [2024-10-14 07:32:35,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:32:35,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:32:35,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:51,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:32:51,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:51,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:32:51,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:51,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:32:51,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:51,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:32:51,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:51,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:32:51,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:51,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:32:51,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:51,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:32:51,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:51,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:32:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:51,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:32:51,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:51,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:32:51,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:51,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 07:32:51,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:51,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:32:51,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:51,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 07:32:51,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:51,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 07:32:51,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:51,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 07:32:51,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:51,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 07:32:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:51,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 07:32:51,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:51,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 07:32:51,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:51,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 07:32:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:51,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 07:32:51,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:51,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 07:32:51,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:51,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 07:32:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:51,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 07:32:51,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:51,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 07:32:51,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:51,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 07:32:51,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:51,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 07:32:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:51,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 07:32:51,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:32:51,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365776579] [2024-10-14 07:32:51,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365776579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:32:51,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:32:51,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 07:32:51,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895402370] [2024-10-14 07:32:51,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:32:51,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 07:32:51,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:32:51,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 07:32:51,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2024-10-14 07:32:51,290 INFO L87 Difference]: Start difference. First operand 62 states and 99 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:32:52,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:32:52,295 INFO L93 Difference]: Finished difference Result 111 states and 173 transitions. [2024-10-14 07:32:52,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 07:32:52,296 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 156 [2024-10-14 07:32:52,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:32:52,300 INFO L225 Difference]: With dead ends: 111 [2024-10-14 07:32:52,302 INFO L226 Difference]: Without dead ends: 109 [2024-10-14 07:32:52,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2024-10-14 07:32:52,303 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 116 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 07:32:52,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 350 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 07:32:52,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-14 07:32:52,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 72. [2024-10-14 07:32:52,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 44 states have internal predecessors, (65), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 07:32:52,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 117 transitions. [2024-10-14 07:32:52,330 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 117 transitions. Word has length 156 [2024-10-14 07:32:52,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:32:52,335 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 117 transitions. [2024-10-14 07:32:52,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:32:52,336 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 117 transitions. [2024-10-14 07:32:52,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-14 07:32:52,337 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:32:52,337 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:32:52,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 07:32:52,338 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:32:52,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:32:52,338 INFO L85 PathProgramCache]: Analyzing trace with hash -248815388, now seen corresponding path program 1 times [2024-10-14 07:32:52,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:32:52,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236591461] [2024-10-14 07:32:52,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:32:52,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:32:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:52,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:32:52,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:52,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:32:52,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:52,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:32:52,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:52,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:32:52,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:52,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:32:52,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:52,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:32:52,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:52,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:32:52,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:52,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:32:52,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:52,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:32:52,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:52,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:32:52,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:52,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 07:32:52,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:52,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:32:52,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:52,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 07:32:52,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:52,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 07:32:52,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:52,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 07:32:52,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:52,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 07:32:52,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:52,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 07:32:52,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:52,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 07:32:52,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:52,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 07:32:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:52,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 07:32:52,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:52,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 07:32:52,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:52,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 07:32:52,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:52,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 07:32:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:52,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 07:32:52,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:52,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 07:32:52,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:52,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 07:32:52,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:52,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 07:32:52,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:32:52,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236591461] [2024-10-14 07:32:52,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236591461] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:32:52,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:32:52,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 07:32:52,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293373405] [2024-10-14 07:32:52,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:32:52,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 07:32:52,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:32:52,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 07:32:52,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 07:32:52,727 INFO L87 Difference]: Start difference. First operand 72 states and 117 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-10-14 07:32:52,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:32:52,904 INFO L93 Difference]: Finished difference Result 172 states and 276 transitions. [2024-10-14 07:32:52,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 07:32:52,911 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 156 [2024-10-14 07:32:52,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:32:52,913 INFO L225 Difference]: With dead ends: 172 [2024-10-14 07:32:52,913 INFO L226 Difference]: Without dead ends: 101 [2024-10-14 07:32:52,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-14 07:32:52,916 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 131 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:32:52,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 137 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:32:52,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-14 07:32:52,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2024-10-14 07:32:52,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 61 states have (on average 1.4426229508196722) internal successors, (88), 62 states have internal predecessors, (88), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-14 07:32:52,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 156 transitions. [2024-10-14 07:32:52,932 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 156 transitions. Word has length 156 [2024-10-14 07:32:52,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:32:52,933 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 156 transitions. [2024-10-14 07:32:52,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-10-14 07:32:52,933 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 156 transitions. [2024-10-14 07:32:52,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-14 07:32:52,935 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:32:52,935 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:32:52,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 07:32:52,936 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:32:52,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:32:52,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1995660673, now seen corresponding path program 1 times [2024-10-14 07:32:52,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:32:52,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897188972] [2024-10-14 07:32:52,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:32:52,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:32:52,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 07:32:52,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1301750211] [2024-10-14 07:32:52,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:32:52,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 07:32:52,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:32:52,999 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 07:32:52,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 07:32:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 07:32:53,237 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 07:32:53,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 07:32:53,340 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 07:32:53,340 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 07:32:53,341 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 07:32:53,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 07:32:53,543 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-10-14 07:32:53,547 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-14 07:32:53,640 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 07:32:53,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 07:32:53 BoogieIcfgContainer [2024-10-14 07:32:53,646 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 07:32:53,647 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 07:32:53,647 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 07:32:53,647 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 07:32:53,648 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:32:34" (3/4) ... [2024-10-14 07:32:53,649 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 07:32:53,650 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 07:32:53,651 INFO L158 Benchmark]: Toolchain (without parser) took 19808.63ms. Allocated memory was 218.1MB in the beginning and 589.3MB in the end (delta: 371.2MB). Free memory was 144.9MB in the beginning and 428.9MB in the end (delta: -284.0MB). Peak memory consumption was 90.0MB. Max. memory is 16.1GB. [2024-10-14 07:32:53,651 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 113.2MB. Free memory is still 70.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 07:32:53,652 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.15ms. Allocated memory is still 218.1MB. Free memory was 144.7MB in the beginning and 130.3MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 07:32:53,652 INFO L158 Benchmark]: Boogie Procedure Inliner took 134.37ms. Allocated memory is still 218.1MB. Free memory was 130.3MB in the beginning and 183.7MB in the end (delta: -53.4MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. [2024-10-14 07:32:53,652 INFO L158 Benchmark]: Boogie Preprocessor took 71.19ms. Allocated memory is still 218.1MB. Free memory was 183.7MB in the beginning and 179.1MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 07:32:53,652 INFO L158 Benchmark]: RCFGBuilder took 519.99ms. Allocated memory is still 218.1MB. Free memory was 179.1MB in the beginning and 153.1MB in the end (delta: 26.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-14 07:32:53,653 INFO L158 Benchmark]: TraceAbstraction took 18804.81ms. Allocated memory was 218.1MB in the beginning and 589.3MB in the end (delta: 371.2MB). Free memory was 152.2MB in the beginning and 429.9MB in the end (delta: -277.7MB). Peak memory consumption was 95.2MB. Max. memory is 16.1GB. [2024-10-14 07:32:53,653 INFO L158 Benchmark]: Witness Printer took 3.74ms. Allocated memory is still 589.3MB. Free memory is still 428.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 07:32:53,654 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.16ms. Allocated memory is still 113.2MB. Free memory is still 70.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.15ms. Allocated memory is still 218.1MB. Free memory was 144.7MB in the beginning and 130.3MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 134.37ms. Allocated memory is still 218.1MB. Free memory was 130.3MB in the beginning and 183.7MB in the end (delta: -53.4MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.19ms. Allocated memory is still 218.1MB. Free memory was 183.7MB in the beginning and 179.1MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 519.99ms. Allocated memory is still 218.1MB. Free memory was 179.1MB in the beginning and 153.1MB in the end (delta: 26.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 18804.81ms. Allocated memory was 218.1MB in the beginning and 589.3MB in the end (delta: 371.2MB). Free memory was 152.2MB in the beginning and 429.9MB in the end (delta: -277.7MB). Peak memory consumption was 95.2MB. Max. memory is 16.1GB. * Witness Printer took 3.74ms. Allocated memory is still 589.3MB. Free memory is still 428.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 129. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 50; [L23] unsigned char var_1_2 = 0; [L24] signed char var_1_3 = 8; [L25] signed char var_1_4 = 10; [L26] double var_1_5 = 16.5; [L27] signed char var_1_6 = 64; [L28] signed char var_1_7 = 2; [L29] unsigned short int var_1_8 = 256; [L30] unsigned char var_1_9 = 0; [L31] unsigned short int var_1_10 = 63583; [L32] unsigned short int var_1_11 = 33789; [L33] unsigned char var_1_12 = 1; [L34] unsigned char var_1_13 = 1; [L35] unsigned char var_1_14 = 0; [L36] signed long int var_1_15 = 8; [L37] signed short int var_1_16 = -16; [L38] unsigned short int var_1_17 = 32; [L39] signed short int var_1_18 = 16; [L40] signed short int var_1_19 = 25; [L41] signed short int var_1_20 = 25; [L42] signed short int var_1_21 = 50; [L133] isInitial = 1 [L134] FCALL initially() [L135] COND TRUE 1 [L136] FCALL updateLastVariables() [L137] CALL updateVariables() [L86] var_1_2 = __VERIFIER_nondet_uchar() [L87] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L87] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L88] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L88] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L89] var_1_3 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L90] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L91] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L91] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L92] var_1_4 = __VERIFIER_nondet_char() [L93] CALL assume_abort_if_not(var_1_4 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L93] RET assume_abort_if_not(var_1_4 >= -63) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L94] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L94] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256, var_1_9=0] [L95] var_1_6 = __VERIFIER_nondet_char() [L96] CALL assume_abort_if_not(var_1_6 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=2, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=2, var_1_8=256, var_1_9=0] [L96] RET assume_abort_if_not(var_1_6 >= -1) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=2, var_1_8=256, var_1_9=0] [L97] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=2, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=2, var_1_8=256, var_1_9=0] [L97] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=2, var_1_8=256, var_1_9=0] [L98] var_1_7 = __VERIFIER_nondet_char() [L99] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=0] [L99] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=0] [L100] CALL assume_abort_if_not(var_1_7 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=0] [L100] RET assume_abort_if_not(var_1_7 <= 127) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=0] [L101] var_1_9 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256] [L102] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256] [L103] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=1] [L103] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=1] [L104] var_1_10 = __VERIFIER_nondet_ushort() [L105] CALL assume_abort_if_not(var_1_10 >= 49150) VAL [\old(cond)=1, isInitial=1, var_1_10=-16386, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16386, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=1] [L105] RET assume_abort_if_not(var_1_10 >= 49150) VAL [isInitial=1, var_1_10=-16386, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=1] [L106] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=-16386, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16386, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=1] [L106] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, var_1_10=-16386, var_1_11=33789, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=1] [L107] var_1_11 = __VERIFIER_nondet_ushort() [L108] CALL assume_abort_if_not(var_1_11 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-16386, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16386, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=1] [L108] RET assume_abort_if_not(var_1_11 >= 32767) VAL [isInitial=1, var_1_10=-16386, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=1] [L109] CALL assume_abort_if_not(var_1_11 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=-16386, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16386, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=1] [L109] RET assume_abort_if_not(var_1_11 <= 65534) VAL [isInitial=1, var_1_10=-16386, var_1_11=32767, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=1] [L110] var_1_13 = __VERIFIER_nondet_uchar() [L111] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-16386, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16386, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=1] [L111] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=-16386, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=1] [L112] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-16386, var_1_11=32767, var_1_12=1, var_1_13=-255, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16386, var_1_11=32767, var_1_12=1, var_1_13=-255, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=1] [L112] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10=-16386, var_1_11=32767, var_1_12=1, var_1_13=-255, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=1] [L113] var_1_14 = __VERIFIER_nondet_uchar() [L114] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-16386, var_1_11=32767, var_1_12=1, var_1_13=-255, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16386, var_1_11=32767, var_1_12=1, var_1_13=-255, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=1] [L114] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=-16386, var_1_11=32767, var_1_12=1, var_1_13=-255, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=1] [L115] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-16386, var_1_11=32767, var_1_12=1, var_1_13=-255, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16386, var_1_11=32767, var_1_12=1, var_1_13=-255, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=1] [L115] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, var_1_10=-16386, var_1_11=32767, var_1_12=1, var_1_13=-255, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_17=32, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=1] [L116] var_1_17 = __VERIFIER_nondet_ushort() [L117] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-16386, var_1_11=32767, var_1_12=1, var_1_13=-255, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16386, var_1_11=32767, var_1_12=1, var_1_13=-255, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=1] [L117] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=-16386, var_1_11=32767, var_1_12=1, var_1_13=-255, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=1] [L118] CALL assume_abort_if_not(var_1_17 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=-16386, var_1_11=32767, var_1_12=1, var_1_13=-255, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16386, var_1_11=32767, var_1_12=1, var_1_13=-255, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=1] [L118] RET assume_abort_if_not(var_1_17 <= 65535) VAL [isInitial=1, var_1_10=-16386, var_1_11=32767, var_1_12=1, var_1_13=-255, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=1] [L119] var_1_20 = __VERIFIER_nondet_short() [L120] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-16386, var_1_11=32767, var_1_12=1, var_1_13=-255, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=188, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16386, var_1_11=32767, var_1_12=1, var_1_13=-255, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=188, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=1] [L120] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=-16386, var_1_11=32767, var_1_12=1, var_1_13=-255, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=188, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=1] [L121] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=-16386, var_1_11=32767, var_1_12=1, var_1_13=-255, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=188, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16386, var_1_11=32767, var_1_12=1, var_1_13=-255, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=188, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=1] [L121] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, var_1_10=-16386, var_1_11=32767, var_1_12=1, var_1_13=-255, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=188, var_1_21=50, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=1] [L122] var_1_21 = __VERIFIER_nondet_short() [L123] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-16386, var_1_11=32767, var_1_12=1, var_1_13=-255, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=188, var_1_21=188, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16386, var_1_11=32767, var_1_12=1, var_1_13=-255, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=188, var_1_21=188, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=1] [L123] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_10=-16386, var_1_11=32767, var_1_12=1, var_1_13=-255, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=188, var_1_21=188, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=1] [L124] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=-16386, var_1_11=32767, var_1_12=1, var_1_13=-255, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=188, var_1_21=188, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16386, var_1_11=32767, var_1_12=1, var_1_13=-255, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=188, var_1_21=188, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=1] [L124] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, var_1_10=-16386, var_1_11=32767, var_1_12=1, var_1_13=-255, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=188, var_1_21=188, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=1] [L137] RET updateVariables() [L138] CALL step() [L46] COND TRUE \read(var_1_2) [L47] var_1_1 = (var_1_3 + var_1_4) VAL [isInitial=1, var_1_10=-16386, var_1_11=32767, var_1_12=1, var_1_13=-255, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-126, var_1_20=188, var_1_21=188, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=1] [L49] COND TRUE var_1_4 >= (var_1_6 - var_1_7) VAL [isInitial=1, var_1_10=-16386, var_1_11=32767, var_1_12=1, var_1_13=-255, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-126, var_1_20=188, var_1_21=188, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/2, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=1] [L50] COND TRUE \read(var_1_2) [L51] var_1_5 = 8.25 VAL [isInitial=1, var_1_10=-16386, var_1_11=32767, var_1_12=1, var_1_13=-255, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-126, var_1_20=188, var_1_21=188, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/4, var_1_6=61, var_1_7=127, var_1_8=256, var_1_9=1] [L54] COND FALSE !(-25 == var_1_6) [L59] var_1_8 = ((((var_1_7) > (var_1_11)) ? (var_1_7) : (var_1_11))) VAL [isInitial=1, var_1_10=-16386, var_1_11=32767, var_1_12=1, var_1_13=-255, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-126, var_1_20=188, var_1_21=188, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/4, var_1_6=61, var_1_7=127, var_1_8=32767, var_1_9=1] [L61] COND TRUE var_1_8 >= var_1_7 [L62] var_1_12 = (! var_1_14) VAL [isInitial=1, var_1_10=-16386, var_1_11=32767, var_1_12=1, var_1_13=-255, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-126, var_1_20=188, var_1_21=188, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/4, var_1_6=61, var_1_7=127, var_1_8=32767, var_1_9=1] [L64] COND TRUE -64 > (var_1_6 + var_1_1) [L65] var_1_15 = (var_1_11 - var_1_7) VAL [isInitial=1, var_1_10=-16386, var_1_11=32767, var_1_12=1, var_1_13=-255, var_1_14=0, var_1_15=32640, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-126, var_1_20=188, var_1_21=188, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/4, var_1_6=61, var_1_7=127, var_1_8=32767, var_1_9=1] [L73] COND FALSE !(var_1_8 > (((((var_1_11) > (var_1_17)) ? (var_1_11) : (var_1_17))) + (var_1_15 / var_1_10))) VAL [isInitial=1, var_1_10=-16386, var_1_11=32767, var_1_12=1, var_1_13=-255, var_1_14=0, var_1_15=32640, var_1_16=-16, var_1_17=-32769, var_1_18=16, var_1_19=25, var_1_1=-126, var_1_20=188, var_1_21=188, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/4, var_1_6=61, var_1_7=127, var_1_8=32767, var_1_9=1] [L76] COND TRUE var_1_1 < var_1_6 [L77] var_1_18 = (var_1_6 - var_1_7) VAL [isInitial=1, var_1_10=-16386, var_1_11=32767, var_1_12=1, var_1_13=-255, var_1_14=0, var_1_15=32640, var_1_16=-16, var_1_17=-32769, var_1_18=-66, var_1_19=25, var_1_1=-126, var_1_20=188, var_1_21=188, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/4, var_1_6=61, var_1_7=127, var_1_8=32767, var_1_9=1] [L81] COND TRUE \read(var_1_13) [L82] var_1_19 = ((var_1_7 - ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21)))) + var_1_6) VAL [isInitial=1, var_1_10=-16386, var_1_11=32767, var_1_12=1, var_1_13=-255, var_1_14=0, var_1_15=32640, var_1_16=-16, var_1_17=-32769, var_1_18=-66, var_1_19=0, var_1_1=-126, var_1_20=188, var_1_21=188, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/4, var_1_6=61, var_1_7=127, var_1_8=32767, var_1_9=1] [L138] RET step() [L139] CALL, EXPR property() [L129-L130] return (((((((var_1_2 ? (var_1_1 == ((signed char) (var_1_3 + var_1_4))) : 1) && ((var_1_4 >= (var_1_6 - var_1_7)) ? (var_1_2 ? (var_1_5 == ((double) 8.25)) : 1) : 1)) && ((-25 == var_1_6) ? ((var_1_2 && var_1_9) ? (var_1_8 == ((unsigned short int) ((((((var_1_10 - 10) - 16)) > ((var_1_11 - var_1_7))) ? (((var_1_10 - 10) - 16)) : ((var_1_11 - var_1_7)))))) : 1) : (var_1_8 == ((unsigned short int) ((((var_1_7) > (var_1_11)) ? (var_1_7) : (var_1_11))))))) && ((var_1_8 >= var_1_7) ? (var_1_12 == ((unsigned char) (! var_1_14))) : 1)) && ((-64 > (var_1_6 + var_1_1)) ? (var_1_15 == ((signed long int) (var_1_11 - var_1_7))) : ((! var_1_12) ? (var_1_12 ? (var_1_15 == ((signed long int) 4)) : 1) : 1))) && ((var_1_8 > (((((var_1_11) > (var_1_17)) ? (var_1_11) : (var_1_17))) + (var_1_15 / var_1_10))) ? (var_1_16 == ((signed short int) var_1_4)) : 1)) && ((var_1_1 < var_1_6) ? (var_1_18 == ((signed short int) (var_1_6 - var_1_7))) : (var_1_18 == ((signed short int) (((((var_1_6 + var_1_4)) < (var_1_1)) ? ((var_1_6 + var_1_4)) : (var_1_1))))))) && (var_1_13 ? (var_1_19 == ((signed short int) ((var_1_7 - ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21)))) + var_1_6))) : 1) ; [L139] RET, EXPR property() [L139] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-16386, var_1_11=32767, var_1_12=1, var_1_13=-255, var_1_14=0, var_1_15=32640, var_1_16=-16, var_1_17=-32769, var_1_18=-66, var_1_19=0, var_1_1=-126, var_1_20=188, var_1_21=188, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/4, var_1_6=61, var_1_7=127, var_1_8=32767, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_10=-16386, var_1_11=32767, var_1_12=1, var_1_13=-255, var_1_14=0, var_1_15=32640, var_1_16=-16, var_1_17=-32769, var_1_18=-66, var_1_19=0, var_1_1=-126, var_1_20=188, var_1_21=188, var_1_2=1, var_1_3=-63, var_1_4=-63, var_1_5=33/4, var_1_6=61, var_1_7=127, var_1_8=32767, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 64 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.6s, OverallIterations: 4, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 247 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 247 mSDsluCounter, 583 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 305 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 290 IncrementalHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 278 mSDtfsCounter, 290 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 204 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=3, InterpolantAutomatonStates: 17, 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, 40 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 16.3s InterpolantComputationTime, 782 NumberOfCodeBlocks, 782 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 465 ConstructedInterpolants, 0 QuantifiedInterpolants, 4442 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 3900/3900 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 07:32:53,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-66.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 836ad92e304b81ed0820392d23ad5f20819734bbfce0803ec8d4151f7117c333 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 07:32:55,812 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 07:32:55,869 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 07:32:55,872 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 07:32:55,874 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 07:32:55,900 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 07:32:55,903 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 07:32:55,903 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 07:32:55,904 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 07:32:55,904 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 07:32:55,904 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 07:32:55,904 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 07:32:55,905 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 07:32:55,905 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 07:32:55,905 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 07:32:55,905 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 07:32:55,905 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 07:32:55,906 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 07:32:55,906 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 07:32:55,908 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 07:32:55,908 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 07:32:55,909 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 07:32:55,909 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 07:32:55,909 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 07:32:55,910 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 07:32:55,912 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 07:32:55,913 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 07:32:55,913 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 07:32:55,913 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 07:32:55,913 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 07:32:55,913 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 07:32:55,914 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 07:32:55,914 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 07:32:55,914 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 07:32:55,914 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:32:55,914 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 07:32:55,914 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 07:32:55,914 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 07:32:55,914 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 07:32:55,915 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 07:32:55,915 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 07:32:55,915 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 07:32:55,915 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 07:32:55,916 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 07:32:55,916 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 07:32:55,916 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 -> 836ad92e304b81ed0820392d23ad5f20819734bbfce0803ec8d4151f7117c333 [2024-10-14 07:32:56,185 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 07:32:56,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 07:32:56,212 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 07:32:56,213 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 07:32:56,214 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 07:32:56,216 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-66.i [2024-10-14 07:32:57,751 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 07:32:57,993 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 07:32:57,993 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-66.i [2024-10-14 07:32:58,005 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67799a625/6535539cba5e49adb7d1254a973b86a0/FLAGb7cc8561e [2024-10-14 07:32:58,020 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67799a625/6535539cba5e49adb7d1254a973b86a0 [2024-10-14 07:32:58,022 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 07:32:58,023 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 07:32:58,028 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 07:32:58,029 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 07:32:58,034 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 07:32:58,036 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:32:58" (1/1) ... [2024-10-14 07:32:58,037 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67faecd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:32:58, skipping insertion in model container [2024-10-14 07:32:58,037 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:32:58" (1/1) ... [2024-10-14 07:32:58,065 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 07:32:58,214 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-66.i[913,926] [2024-10-14 07:32:58,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:32:58,306 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 07:32:58,321 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-66.i[913,926] [2024-10-14 07:32:58,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:32:58,383 INFO L204 MainTranslator]: Completed translation [2024-10-14 07:32:58,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:32:58 WrapperNode [2024-10-14 07:32:58,384 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 07:32:58,386 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 07:32:58,387 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 07:32:58,387 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 07:32:58,393 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:32:58" (1/1) ... [2024-10-14 07:32:58,403 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:32:58" (1/1) ... [2024-10-14 07:32:58,422 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 143 [2024-10-14 07:32:58,423 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 07:32:58,423 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 07:32:58,423 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 07:32:58,423 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 07:32:58,437 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:32:58" (1/1) ... [2024-10-14 07:32:58,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:32:58" (1/1) ... [2024-10-14 07:32:58,441 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:32:58" (1/1) ... [2024-10-14 07:32:58,465 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 07:32:58,469 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:32:58" (1/1) ... [2024-10-14 07:32:58,469 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:32:58" (1/1) ... [2024-10-14 07:32:58,479 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:32:58" (1/1) ... [2024-10-14 07:32:58,486 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:32:58" (1/1) ... [2024-10-14 07:32:58,490 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:32:58" (1/1) ... [2024-10-14 07:32:58,495 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:32:58" (1/1) ... [2024-10-14 07:32:58,498 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 07:32:58,501 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 07:32:58,501 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 07:32:58,501 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 07:32:58,502 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:32:58" (1/1) ... [2024-10-14 07:32:58,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:32:58,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:32:58,533 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 07:32:58,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 07:32:58,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 07:32:58,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 07:32:58,577 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 07:32:58,577 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 07:32:58,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 07:32:58,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 07:32:58,645 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 07:32:58,647 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 07:32:58,994 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-14 07:32:58,994 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 07:32:59,085 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 07:32:59,086 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 07:32:59,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:32:59 BoogieIcfgContainer [2024-10-14 07:32:59,087 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 07:32:59,088 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 07:32:59,089 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 07:32:59,091 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 07:32:59,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:32:58" (1/3) ... [2024-10-14 07:32:59,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51be4fdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:32:59, skipping insertion in model container [2024-10-14 07:32:59,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:32:58" (2/3) ... [2024-10-14 07:32:59,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51be4fdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:32:59, skipping insertion in model container [2024-10-14 07:32:59,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:32:59" (3/3) ... [2024-10-14 07:32:59,095 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-66.i [2024-10-14 07:32:59,113 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 07:32:59,114 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 07:32:59,179 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 07:32:59,186 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;@5aa5e941, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 07:32:59,187 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 07:32:59,190 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 36 states have internal predecessors, (52), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 07:32:59,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-14 07:32:59,203 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:32:59,204 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:32:59,205 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:32:59,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:32:59,210 INFO L85 PathProgramCache]: Analyzing trace with hash -575482394, now seen corresponding path program 1 times [2024-10-14 07:32:59,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:32:59,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [29498370] [2024-10-14 07:32:59,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:32:59,223 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:32:59,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:32:59,226 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 07:32:59,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 07:32:59,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:32:59,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 07:32:59,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:32:59,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 674 proven. 0 refuted. 0 times theorem prover too weak. 626 trivial. 0 not checked. [2024-10-14 07:32:59,462 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 07:32:59,463 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:32:59,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [29498370] [2024-10-14 07:32:59,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [29498370] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:32:59,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:32:59,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 07:32:59,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081956056] [2024-10-14 07:32:59,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:32:59,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 07:32:59,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:32:59,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 07:32:59,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 07:32:59,496 INFO L87 Difference]: Start difference. First operand has 64 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 36 states have internal predecessors, (52), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 07:32:59,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:32:59,554 INFO L93 Difference]: Finished difference Result 125 states and 232 transitions. [2024-10-14 07:32:59,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 07:32:59,561 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 156 [2024-10-14 07:32:59,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:32:59,567 INFO L225 Difference]: With dead ends: 125 [2024-10-14 07:32:59,567 INFO L226 Difference]: Without dead ends: 62 [2024-10-14 07:32:59,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 07:32:59,574 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:32:59,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:32:59,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-14 07:32:59,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-10-14 07:32:59,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 34 states have internal predecessors, (47), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 07:32:59,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 99 transitions. [2024-10-14 07:32:59,622 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 99 transitions. Word has length 156 [2024-10-14 07:32:59,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:32:59,623 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 99 transitions. [2024-10-14 07:32:59,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 07:32:59,623 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 99 transitions. [2024-10-14 07:32:59,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-14 07:32:59,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:32:59,631 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:32:59,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-14 07:32:59,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:32:59,836 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:32:59,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:32:59,837 INFO L85 PathProgramCache]: Analyzing trace with hash 560531238, now seen corresponding path program 1 times [2024-10-14 07:32:59,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:32:59,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [414021045] [2024-10-14 07:32:59,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:32:59,839 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:32:59,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:32:59,863 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 07:32:59,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 07:33:00,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:33:00,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-14 07:33:00,110 INFO L278 TraceCheckSpWp]: Computing forward predicates...