./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-27.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-27.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 00bef7012df83cfea6557911ccded0b7d229289545c394298f9cdde0162b421c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:22:51,809 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:22:51,890 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 00:22:51,894 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:22:51,894 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:22:51,913 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:22:51,914 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:22:51,914 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:22:51,915 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:22:51,915 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:22:51,916 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:22:51,916 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:22:51,916 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:22:51,917 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:22:51,917 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:22:51,917 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:22:51,918 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:22:51,918 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:22:51,919 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:22:51,919 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:22:51,919 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:22:51,924 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:22:51,924 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:22:51,924 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:22:51,925 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:22:51,925 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:22:51,925 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:22:51,926 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:22:51,926 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:22:51,926 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:22:51,927 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:22:51,927 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:22:51,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:22:51,928 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:22:51,928 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:22:51,928 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:22:51,929 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 00:22:51,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:22:51,929 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:22:51,930 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:22:51,930 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:22:51,930 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:22:51,931 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 -> 00bef7012df83cfea6557911ccded0b7d229289545c394298f9cdde0162b421c [2024-11-09 00:22:52,212 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:22:52,242 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:22:52,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:22:52,249 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:22:52,250 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:22:52,252 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-27.i [2024-11-09 00:22:54,170 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:22:54,388 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:22:54,389 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-27.i [2024-11-09 00:22:54,403 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c843bfc4/536d77eac694449db79d760ba2380d1e/FLAGf269bbb21 [2024-11-09 00:22:54,423 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c843bfc4/536d77eac694449db79d760ba2380d1e [2024-11-09 00:22:54,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:22:54,428 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:22:54,430 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:22:54,430 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:22:54,436 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:22:54,437 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:22:54" (1/1) ... [2024-11-09 00:22:54,440 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a2b719e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:22:54, skipping insertion in model container [2024-11-09 00:22:54,440 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:22:54" (1/1) ... [2024-11-09 00:22:54,475 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:22:54,665 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-27.i[916,929] [2024-11-09 00:22:54,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:22:54,766 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:22:54,780 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-27.i[916,929] [2024-11-09 00:22:54,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:22:54,841 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:22:54,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:22:54 WrapperNode [2024-11-09 00:22:54,843 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:22:54,844 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:22:54,845 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:22:54,845 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:22:54,853 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:22:54" (1/1) ... [2024-11-09 00:22:54,869 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:22:54" (1/1) ... [2024-11-09 00:22:54,987 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 213 [2024-11-09 00:22:54,988 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:22:54,988 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:22:54,989 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:22:54,989 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:22:55,033 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:22:54" (1/1) ... [2024-11-09 00:22:55,033 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:22:54" (1/1) ... [2024-11-09 00:22:55,038 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:22:54" (1/1) ... [2024-11-09 00:22:55,062 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 00:22:55,063 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:22:54" (1/1) ... [2024-11-09 00:22:55,063 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:22:54" (1/1) ... [2024-11-09 00:22:55,075 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:22:54" (1/1) ... [2024-11-09 00:22:55,079 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:22:54" (1/1) ... [2024-11-09 00:22:55,085 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:22:54" (1/1) ... [2024-11-09 00:22:55,088 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:22:54" (1/1) ... [2024-11-09 00:22:55,096 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:22:55,097 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:22:55,098 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:22:55,098 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:22:55,099 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:22:54" (1/1) ... [2024-11-09 00:22:55,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:22:55,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:22:55,152 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 00:22:55,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 00:22:55,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:22:55,215 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:22:55,216 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:22:55,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 00:22:55,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:22:55,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:22:55,321 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:22:55,325 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:22:55,859 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-09 00:22:55,860 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:22:55,875 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:22:55,875 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:22:55,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:22:55 BoogieIcfgContainer [2024-11-09 00:22:55,876 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:22:55,878 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:22:55,878 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:22:55,883 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:22:55,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:22:54" (1/3) ... [2024-11-09 00:22:55,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d694884 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:22:55, skipping insertion in model container [2024-11-09 00:22:55,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:22:54" (2/3) ... [2024-11-09 00:22:55,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d694884 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:22:55, skipping insertion in model container [2024-11-09 00:22:55,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:22:55" (3/3) ... [2024-11-09 00:22:55,886 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-27.i [2024-11-09 00:22:55,905 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:22:55,905 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:22:55,984 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:22:55,995 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;@1658264c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:22:55,996 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:22:56,001 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 65 states have (on average 1.4307692307692308) internal successors, (93), 66 states have internal predecessors, (93), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-09 00:22:56,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-09 00:22:56,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:22:56,026 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:22:56,026 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:22:56,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:22:56,034 INFO L85 PathProgramCache]: Analyzing trace with hash -254734511, now seen corresponding path program 1 times [2024-11-09 00:22:56,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:22:56,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340743649] [2024-11-09 00:22:56,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:22:56,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:56,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:56,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:22:56,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:56,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:22:56,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:56,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:22:56,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:56,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:22:56,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:56,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:22:56,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:56,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:22:56,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:56,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:22:56,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:56,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:22:56,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:56,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:22:56,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:56,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:22:56,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:56,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 00:22:56,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:56,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:22:56,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:56,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:22:56,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:56,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:22:56,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:56,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 00:22:56,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:56,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:22:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:56,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 00:22:56,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:56,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 00:22:56,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:56,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-09 00:22:56,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:56,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 00:22:56,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:56,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-09 00:22:56,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:56,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-09 00:22:56,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:56,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-09 00:22:56,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:56,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-09 00:22:56,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:56,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-09 00:22:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:56,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-09 00:22:56,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:56,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-09 00:22:56,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:56,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-09 00:22:56,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:22:56,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340743649] [2024-11-09 00:22:56,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340743649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:22:56,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:22:56,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:22:56,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627052272] [2024-11-09 00:22:56,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:22:56,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:22:56,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:22:56,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:22:56,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:22:56,769 INFO L87 Difference]: Start difference. First operand has 95 states, 65 states have (on average 1.4307692307692308) internal successors, (93), 66 states have internal predecessors, (93), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-09 00:22:56,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:22:56,807 INFO L93 Difference]: Finished difference Result 183 states and 315 transitions. [2024-11-09 00:22:56,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:22:56,810 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 180 [2024-11-09 00:22:56,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:22:56,820 INFO L225 Difference]: With dead ends: 183 [2024-11-09 00:22:56,821 INFO L226 Difference]: Without dead ends: 91 [2024-11-09 00:22:56,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:22:56,831 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:22:56,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:22:56,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-09 00:22:56,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-09 00:22:56,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 62 states have (on average 1.3709677419354838) internal successors, (85), 62 states have internal predecessors, (85), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-09 00:22:56,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 139 transitions. [2024-11-09 00:22:56,936 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 139 transitions. Word has length 180 [2024-11-09 00:22:56,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:22:56,937 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 139 transitions. [2024-11-09 00:22:56,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-09 00:22:56,938 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 139 transitions. [2024-11-09 00:22:56,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-09 00:22:56,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:22:56,942 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:22:56,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 00:22:56,942 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:22:56,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:22:56,943 INFO L85 PathProgramCache]: Analyzing trace with hash 339478149, now seen corresponding path program 1 times [2024-11-09 00:22:56,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:22:56,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003166511] [2024-11-09 00:22:56,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:22:56,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:57,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:57,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:22:57,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:57,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:22:57,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:57,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:22:57,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:57,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:22:57,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:57,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:22:57,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:57,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:22:57,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:57,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:22:57,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:57,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:22:57,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:57,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:22:57,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:57,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:22:57,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:57,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 00:22:57,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:57,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:22:57,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:57,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:22:57,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:57,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:22:57,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:57,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 00:22:57,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:57,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:22:57,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:57,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 00:22:57,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:57,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 00:22:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:57,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-09 00:22:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:57,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 00:22:57,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:57,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-09 00:22:57,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:57,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-09 00:22:57,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:57,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-09 00:22:57,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:57,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-09 00:22:57,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:57,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-09 00:22:57,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:57,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-09 00:22:57,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:57,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-09 00:22:57,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:57,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-09 00:22:57,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:22:57,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003166511] [2024-11-09 00:22:57,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003166511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:22:57,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:22:57,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 00:22:57,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173011398] [2024-11-09 00:22:57,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:22:57,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 00:22:57,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:22:57,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 00:22:57,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 00:22:57,298 INFO L87 Difference]: Start difference. First operand 91 states and 139 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-09 00:22:57,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:22:57,412 INFO L93 Difference]: Finished difference Result 263 states and 403 transitions. [2024-11-09 00:22:57,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 00:22:57,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 181 [2024-11-09 00:22:57,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:22:57,420 INFO L225 Difference]: With dead ends: 263 [2024-11-09 00:22:57,420 INFO L226 Difference]: Without dead ends: 175 [2024-11-09 00:22:57,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 00:22:57,424 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 129 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 00:22:57,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 281 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 00:22:57,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-09 00:22:57,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 102. [2024-11-09 00:22:57,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 73 states have (on average 1.356164383561644) internal successors, (99), 73 states have internal predecessors, (99), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-09 00:22:57,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 153 transitions. [2024-11-09 00:22:57,455 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 153 transitions. Word has length 181 [2024-11-09 00:22:57,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:22:57,456 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 153 transitions. [2024-11-09 00:22:57,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-09 00:22:57,457 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 153 transitions. [2024-11-09 00:22:57,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-09 00:22:57,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:22:57,464 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:22:57,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 00:22:57,465 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:22:57,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:22:57,467 INFO L85 PathProgramCache]: Analyzing trace with hash -358718780, now seen corresponding path program 1 times [2024-11-09 00:22:57,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:22:57,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687667186] [2024-11-09 00:22:57,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:22:57,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:22:57,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:58,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:22:58,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:58,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:22:58,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:58,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:22:58,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:58,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:22:58,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:58,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:22:58,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:58,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:22:58,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:58,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:22:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:58,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:22:58,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:58,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:22:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:58,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:22:58,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:58,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 00:22:58,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:58,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:22:58,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:58,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:22:58,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:58,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:22:58,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:58,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 00:22:58,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:58,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:22:58,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:58,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 00:22:58,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:58,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 00:22:58,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:58,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-09 00:22:58,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:58,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 00:22:58,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:58,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-09 00:22:58,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:58,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-09 00:22:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:58,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-09 00:22:58,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:58,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-09 00:22:58,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:58,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-09 00:22:58,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:58,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-09 00:22:58,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:58,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-09 00:22:58,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:58,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 39 proven. 39 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-11-09 00:22:58,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:22:58,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687667186] [2024-11-09 00:22:58,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687667186] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:22:58,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746870220] [2024-11-09 00:22:58,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:22:58,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:22:58,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:22:58,910 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 00:22:58,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 00:22:59,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:22:59,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-09 00:22:59,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:23:01,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 861 proven. 261 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2024-11-09 00:23:01,249 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:23:04,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746870220] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:23:04,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 00:23:04,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 24] total 27 [2024-11-09 00:23:04,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778171721] [2024-11-09 00:23:04,029 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 00:23:04,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-09 00:23:04,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:23:04,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-09 00:23:04,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=1298, Unknown=0, NotChecked=0, Total=1640 [2024-11-09 00:23:04,036 INFO L87 Difference]: Start difference. First operand 102 states and 153 transitions. Second operand has 27 states, 27 states have (on average 4.333333333333333) internal successors, (117), 25 states have internal predecessors, (117), 9 states have call successors, (53), 8 states have call predecessors, (53), 13 states have return successors, (54), 9 states have call predecessors, (54), 9 states have call successors, (54) [2024-11-09 00:23:06,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:23:06,737 INFO L93 Difference]: Finished difference Result 330 states and 455 transitions. [2024-11-09 00:23:06,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-11-09 00:23:06,737 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 4.333333333333333) internal successors, (117), 25 states have internal predecessors, (117), 9 states have call successors, (53), 8 states have call predecessors, (53), 13 states have return successors, (54), 9 states have call predecessors, (54), 9 states have call successors, (54) Word has length 182 [2024-11-09 00:23:06,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:23:06,742 INFO L225 Difference]: With dead ends: 330 [2024-11-09 00:23:06,742 INFO L226 Difference]: Without dead ends: 231 [2024-11-09 00:23:06,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1683 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1330, Invalid=5476, Unknown=0, NotChecked=0, Total=6806 [2024-11-09 00:23:06,749 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 527 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 1919 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 1988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 00:23:06,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 917 Invalid, 1988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1919 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 00:23:06,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-09 00:23:06,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 200. [2024-11-09 00:23:06,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 145 states have (on average 1.2551724137931035) internal successors, (182), 146 states have internal predecessors, (182), 40 states have call successors, (40), 14 states have call predecessors, (40), 14 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-09 00:23:06,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 262 transitions. [2024-11-09 00:23:06,789 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 262 transitions. Word has length 182 [2024-11-09 00:23:06,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:23:06,790 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 262 transitions. [2024-11-09 00:23:06,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.333333333333333) internal successors, (117), 25 states have internal predecessors, (117), 9 states have call successors, (53), 8 states have call predecessors, (53), 13 states have return successors, (54), 9 states have call predecessors, (54), 9 states have call successors, (54) [2024-11-09 00:23:06,790 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 262 transitions. [2024-11-09 00:23:06,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-09 00:23:06,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:23:06,797 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:23:06,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 00:23:06,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:23:06,999 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:23:07,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:23:07,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1369836030, now seen corresponding path program 1 times [2024-11-09 00:23:07,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:23:07,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793152542] [2024-11-09 00:23:07,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:23:07,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:23:07,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:07,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:23:07,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:07,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:23:07,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:07,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:23:07,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:07,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:23:07,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:07,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:23:07,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:07,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:23:07,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:07,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:23:07,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:07,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:23:07,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:07,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:23:07,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:07,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:23:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:07,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 00:23:07,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:07,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:23:07,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:07,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:23:07,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:07,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:23:08,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:08,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 00:23:08,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:08,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:23:08,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:08,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 00:23:08,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:08,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 00:23:08,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:08,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-09 00:23:08,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:08,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 00:23:08,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:08,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-09 00:23:08,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:08,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-09 00:23:08,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:08,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-09 00:23:08,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:08,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-09 00:23:08,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:08,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-09 00:23:08,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:08,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-09 00:23:08,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:08,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-09 00:23:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:08,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 48 proven. 102 refuted. 0 times theorem prover too weak. 1254 trivial. 0 not checked. [2024-11-09 00:23:08,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:23:08,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793152542] [2024-11-09 00:23:08,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793152542] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:23:08,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677113378] [2024-11-09 00:23:08,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:23:08,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:23:08,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:23:08,101 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 00:23:08,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 00:23:08,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:08,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 00:23:08,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:23:09,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 842 proven. 159 refuted. 0 times theorem prover too weak. 403 trivial. 0 not checked. [2024-11-09 00:23:09,310 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:23:10,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 57 proven. 168 refuted. 0 times theorem prover too weak. 1179 trivial. 0 not checked. [2024-11-09 00:23:10,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677113378] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 00:23:10,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 00:23:10,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 14] total 31 [2024-11-09 00:23:10,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251672382] [2024-11-09 00:23:10,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 00:23:10,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-09 00:23:10,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:23:10,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-09 00:23:10,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=712, Unknown=0, NotChecked=0, Total=930 [2024-11-09 00:23:10,146 INFO L87 Difference]: Start difference. First operand 200 states and 262 transitions. Second operand has 31 states, 31 states have (on average 4.935483870967742) internal successors, (153), 31 states have internal predecessors, (153), 9 states have call successors, (81), 5 states have call predecessors, (81), 11 states have return successors, (81), 7 states have call predecessors, (81), 9 states have call successors, (81) [2024-11-09 00:23:11,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:23:11,898 INFO L93 Difference]: Finished difference Result 772 states and 1029 transitions. [2024-11-09 00:23:11,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-09 00:23:11,899 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 4.935483870967742) internal successors, (153), 31 states have internal predecessors, (153), 9 states have call successors, (81), 5 states have call predecessors, (81), 11 states have return successors, (81), 7 states have call predecessors, (81), 9 states have call successors, (81) Word has length 182 [2024-11-09 00:23:11,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:23:11,906 INFO L225 Difference]: With dead ends: 772 [2024-11-09 00:23:11,906 INFO L226 Difference]: Without dead ends: 575 [2024-11-09 00:23:11,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 399 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=588, Invalid=1862, Unknown=0, NotChecked=0, Total=2450 [2024-11-09 00:23:11,909 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 1108 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 1462 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 1585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 00:23:11,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1113 Valid, 866 Invalid, 1585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1462 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 00:23:11,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2024-11-09 00:23:11,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 425. [2024-11-09 00:23:11,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 316 states have (on average 1.2879746835443038) internal successors, (407), 318 states have internal predecessors, (407), 80 states have call successors, (80), 28 states have call predecessors, (80), 28 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-09 00:23:11,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 567 transitions. [2024-11-09 00:23:11,961 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 567 transitions. Word has length 182 [2024-11-09 00:23:11,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:23:11,962 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 567 transitions. [2024-11-09 00:23:11,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 4.935483870967742) internal successors, (153), 31 states have internal predecessors, (153), 9 states have call successors, (81), 5 states have call predecessors, (81), 11 states have return successors, (81), 7 states have call predecessors, (81), 9 states have call successors, (81) [2024-11-09 00:23:11,962 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 567 transitions. [2024-11-09 00:23:11,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-09 00:23:11,965 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:23:11,965 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:23:11,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 00:23:12,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-09 00:23:12,167 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:23:12,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:23:12,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1002901770, now seen corresponding path program 1 times [2024-11-09 00:23:12,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:23:12,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445842013] [2024-11-09 00:23:12,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:23:12,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:23:12,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 00:23:12,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [633339176] [2024-11-09 00:23:12,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:23:12,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:23:12,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:23:12,416 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 00:23:12,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 00:23:12,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:12,636 INFO L255 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 00:23:12,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:23:13,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 152 proven. 147 refuted. 0 times theorem prover too weak. 1105 trivial. 0 not checked. [2024-11-09 00:23:13,109 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:23:13,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 3 proven. 150 refuted. 0 times theorem prover too weak. 1251 trivial. 0 not checked. [2024-11-09 00:23:13,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:23:13,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445842013] [2024-11-09 00:23:13,417 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 00:23:13,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633339176] [2024-11-09 00:23:13,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633339176] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 00:23:13,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 00:23:13,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-11-09 00:23:13,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963619932] [2024-11-09 00:23:13,418 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 00:23:13,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 00:23:13,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:23:13,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 00:23:13,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2024-11-09 00:23:13,421 INFO L87 Difference]: Start difference. First operand 425 states and 567 transitions. Second operand has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 15 states have internal predecessors, (83), 4 states have call successors, (53), 3 states have call predecessors, (53), 7 states have return successors, (54), 3 states have call predecessors, (54), 4 states have call successors, (54) [2024-11-09 00:23:13,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:23:13,955 INFO L93 Difference]: Finished difference Result 855 states and 1139 transitions. [2024-11-09 00:23:13,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 00:23:13,956 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 15 states have internal predecessors, (83), 4 states have call successors, (53), 3 states have call predecessors, (53), 7 states have return successors, (54), 3 states have call predecessors, (54), 4 states have call successors, (54) Word has length 182 [2024-11-09 00:23:13,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:23:13,961 INFO L225 Difference]: With dead ends: 855 [2024-11-09 00:23:13,961 INFO L226 Difference]: Without dead ends: 433 [2024-11-09 00:23:13,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 348 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2024-11-09 00:23:13,973 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 66 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 00:23:13,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 410 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 00:23:13,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2024-11-09 00:23:14,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 425. [2024-11-09 00:23:14,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 316 states have (on average 1.2816455696202531) internal successors, (405), 318 states have internal predecessors, (405), 80 states have call successors, (80), 28 states have call predecessors, (80), 28 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-09 00:23:14,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 565 transitions. [2024-11-09 00:23:14,080 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 565 transitions. Word has length 182 [2024-11-09 00:23:14,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:23:14,080 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 565 transitions. [2024-11-09 00:23:14,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 15 states have internal predecessors, (83), 4 states have call successors, (53), 3 states have call predecessors, (53), 7 states have return successors, (54), 3 states have call predecessors, (54), 4 states have call successors, (54) [2024-11-09 00:23:14,081 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 565 transitions. [2024-11-09 00:23:14,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-09 00:23:14,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:23:14,083 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:23:14,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 00:23:14,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:23:14,284 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:23:14,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:23:14,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1368837492, now seen corresponding path program 1 times [2024-11-09 00:23:14,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:23:14,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154637796] [2024-11-09 00:23:14,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:23:14,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:23:14,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 00:23:14,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [553043511] [2024-11-09 00:23:14,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:23:14,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:23:14,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:23:14,538 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 00:23:14,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 00:23:14,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:23:14,905 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:23:15,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:23:15,177 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 00:23:15,177 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 00:23:15,178 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 00:23:15,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 00:23:15,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:23:15,384 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-09 00:23:15,504 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 00:23:15,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:23:15 BoogieIcfgContainer [2024-11-09 00:23:15,507 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 00:23:15,507 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:23:15,508 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:23:15,508 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:23:15,508 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:22:55" (3/4) ... [2024-11-09 00:23:15,510 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 00:23:15,512 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:23:15,512 INFO L158 Benchmark]: Toolchain (without parser) took 21084.55ms. Allocated memory was 176.2MB in the beginning and 377.5MB in the end (delta: 201.3MB). Free memory was 107.6MB in the beginning and 129.0MB in the end (delta: -21.4MB). Peak memory consumption was 182.9MB. Max. memory is 16.1GB. [2024-11-09 00:23:15,512 INFO L158 Benchmark]: CDTParser took 0.62ms. Allocated memory is still 113.2MB. Free memory is still 75.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:23:15,513 INFO L158 Benchmark]: CACSL2BoogieTranslator took 412.88ms. Allocated memory is still 176.2MB. Free memory was 107.4MB in the beginning and 89.6MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 00:23:15,513 INFO L158 Benchmark]: Boogie Procedure Inliner took 144.06ms. Allocated memory is still 176.2MB. Free memory was 89.6MB in the beginning and 144.4MB in the end (delta: -54.8MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. [2024-11-09 00:23:15,513 INFO L158 Benchmark]: Boogie Preprocessor took 108.06ms. Allocated memory is still 176.2MB. Free memory was 144.4MB in the beginning and 137.4MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-09 00:23:15,513 INFO L158 Benchmark]: RCFGBuilder took 778.60ms. Allocated memory is still 176.2MB. Free memory was 136.7MB in the beginning and 101.4MB in the end (delta: 35.3MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-09 00:23:15,514 INFO L158 Benchmark]: TraceAbstraction took 19628.87ms. Allocated memory was 176.2MB in the beginning and 377.5MB in the end (delta: 201.3MB). Free memory was 100.7MB in the beginning and 130.0MB in the end (delta: -29.3MB). Peak memory consumption was 174.8MB. Max. memory is 16.1GB. [2024-11-09 00:23:15,514 INFO L158 Benchmark]: Witness Printer took 4.18ms. Allocated memory is still 377.5MB. Free memory was 130.0MB in the beginning and 129.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:23:15,515 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.62ms. Allocated memory is still 113.2MB. Free memory is still 75.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 412.88ms. Allocated memory is still 176.2MB. Free memory was 107.4MB in the beginning and 89.6MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 144.06ms. Allocated memory is still 176.2MB. Free memory was 89.6MB in the beginning and 144.4MB in the end (delta: -54.8MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 108.06ms. Allocated memory is still 176.2MB. Free memory was 144.4MB in the beginning and 137.4MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 778.60ms. Allocated memory is still 176.2MB. Free memory was 136.7MB in the beginning and 101.4MB in the end (delta: 35.3MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 19628.87ms. Allocated memory was 176.2MB in the beginning and 377.5MB in the end (delta: 201.3MB). Free memory was 100.7MB in the beginning and 130.0MB in the end (delta: -29.3MB). Peak memory consumption was 174.8MB. Max. memory is 16.1GB. * Witness Printer took 4.18ms. Allocated memory is still 377.5MB. Free memory was 130.0MB in the beginning and 129.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 182, overapproximation of someBinaryFLOATComparisonOperation at line 182, overapproximation of someUnaryDOUBLEoperation at line 94. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 32; [L23] signed char var_1_3 = 25; [L24] signed char var_1_4 = 10; [L25] signed char var_1_5 = -10; [L26] signed char var_1_6 = -1; [L27] signed short int var_1_7 = -4; [L28] signed char var_1_8 = 50; [L29] signed short int var_1_9 = 2; [L30] unsigned long int var_1_10 = 128; [L31] unsigned char var_1_11 = 2; [L32] unsigned long int var_1_12 = 2781423228; [L33] unsigned long int var_1_13 = 3552320529; [L34] double var_1_14 = 2.25; [L35] unsigned char var_1_15 = 5; [L36] unsigned char var_1_16 = 64; [L37] double var_1_17 = 9.48; [L38] double var_1_18 = 256.05; [L39] float var_1_19 = 1.1; [L40] float var_1_21 = 16.5; [L41] float var_1_22 = 9.4; [L42] unsigned short int var_1_23 = 100; [L43] unsigned char var_1_24 = 5; [L44] unsigned short int var_1_25 = 4; [L45] unsigned short int var_1_26 = 48215; [L46] unsigned short int var_1_27 = 10; [L47] unsigned short int var_1_28 = 1; [L48] signed char var_1_29 = 0; [L49] unsigned long int var_1_30 = 1524073358; [L50] unsigned char var_1_31 = 1; [L51] double var_1_32 = 64.45; VAL [isInitial=0, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=25, var_1_4=10, var_1_5=-10, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L186] isInitial = 1 [L187] FCALL initially() [L188] COND TRUE 1 [L189] FCALL updateLastVariables() [L190] CALL updateVariables() [L136] var_1_3 = __VERIFIER_nondet_char() [L137] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=10, var_1_5=-10, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=10, var_1_5=-10, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L137] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=10, var_1_5=-10, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L138] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=10, var_1_5=-10, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=10, var_1_5=-10, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L138] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=10, var_1_5=-10, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L139] var_1_4 = __VERIFIER_nondet_char() [L140] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=-10, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=-10, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L140] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=-10, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L141] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=-10, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=-10, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L141] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=-10, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L142] var_1_5 = __VERIFIER_nondet_char() [L143] CALL assume_abort_if_not(var_1_5 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L143] RET assume_abort_if_not(var_1_5 >= -63) VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L144] CALL assume_abort_if_not(var_1_5 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L144] RET assume_abort_if_not(var_1_5 <= 63) VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=-1, var_1_7=-4, var_1_8=50, var_1_9=2] [L145] var_1_6 = __VERIFIER_nondet_char() [L146] CALL assume_abort_if_not(var_1_6 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L146] RET assume_abort_if_not(var_1_6 >= -63) VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L147] CALL assume_abort_if_not(var_1_6 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L147] RET assume_abort_if_not(var_1_6 <= 63) VAL [isInitial=1, var_1_10=128, var_1_11=2, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L148] var_1_11 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L149] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=128, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L150] CALL assume_abort_if_not(var_1_11 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L150] RET assume_abort_if_not(var_1_11 <= 255) VAL [isInitial=1, var_1_10=128, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L151] CALL assume_abort_if_not(var_1_11 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L151] RET assume_abort_if_not(var_1_11 != 0) VAL [isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2781423228, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L152] var_1_12 = __VERIFIER_nondet_ulong() [L153] CALL assume_abort_if_not(var_1_12 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L153] RET assume_abort_if_not(var_1_12 >= 2147483647) VAL [isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L154] CALL assume_abort_if_not(var_1_12 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L154] RET assume_abort_if_not(var_1_12 <= 4294967294) VAL [isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=3552320529, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L155] var_1_13 = __VERIFIER_nondet_ulong() [L156] CALL assume_abort_if_not(var_1_13 >= 3221225470) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L156] RET assume_abort_if_not(var_1_13 >= 3221225470) VAL [isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L157] CALL assume_abort_if_not(var_1_13 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L157] RET assume_abort_if_not(var_1_13 <= 4294967294) VAL [isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=5, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L158] var_1_15 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=3, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=3, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L159] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=3, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L160] CALL assume_abort_if_not(var_1_15 <= 128) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=3, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=3, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L160] RET assume_abort_if_not(var_1_15 <= 128) VAL [isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=3, var_1_16=64, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L161] var_1_16 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=3, var_1_16=127, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=3, var_1_16=127, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L162] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=3, var_1_16=127, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L163] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=3, var_1_16=127, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=3, var_1_16=127, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L163] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=3, var_1_16=127, var_1_17=237/25, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L164] var_1_17 = __VERIFIER_nondet_double() [L165] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=3, var_1_16=127, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=3, var_1_16=127, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L165] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=3, var_1_16=127, var_1_18=5121/20, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L166] var_1_18 = __VERIFIER_nondet_double() [L167] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=3, var_1_16=127, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=3, var_1_16=127, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L167] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=3, var_1_16=127, var_1_19=11/10, var_1_1=32, var_1_21=33/2, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L168] var_1_21 = __VERIFIER_nondet_float() [L169] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=3, var_1_16=127, var_1_19=11/10, var_1_1=32, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=3, var_1_16=127, var_1_19=11/10, var_1_1=32, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L169] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=3, var_1_16=127, var_1_19=11/10, var_1_1=32, var_1_22=47/5, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L170] var_1_22 = __VERIFIER_nondet_float() [L171] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=3, var_1_16=127, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=3, var_1_16=127, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L171] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=3, var_1_16=127, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=48215, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L172] var_1_26 = __VERIFIER_nondet_ushort() [L173] CALL assume_abort_if_not(var_1_26 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=3, var_1_16=127, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=3, var_1_16=127, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L173] RET assume_abort_if_not(var_1_26 >= 32767) VAL [isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=3, var_1_16=127, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L174] CALL assume_abort_if_not(var_1_26 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=3, var_1_16=127, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=3, var_1_16=127, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L174] RET assume_abort_if_not(var_1_26 <= 65534) VAL [isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=3, var_1_16=127, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1524073358, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L175] var_1_30 = __VERIFIER_nondet_ulong() [L176] CALL assume_abort_if_not(var_1_30 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=3, var_1_16=127, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=3, var_1_16=127, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L176] RET assume_abort_if_not(var_1_30 >= 1073741823) VAL [isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=3, var_1_16=127, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L177] CALL assume_abort_if_not(var_1_30 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=3, var_1_16=127, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=3, var_1_16=127, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L177] RET assume_abort_if_not(var_1_30 <= 2147483647) VAL [isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=3, var_1_16=127, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=-4, var_1_8=50, var_1_9=2] [L190] RET updateVariables() [L191] CALL step() [L55] var_1_7 = ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4))) [L56] signed long int stepLocal_0 = 128 - 256; VAL [isInitial=1, stepLocal_0=-128, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=3, var_1_16=127, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=63, var_1_8=50, var_1_9=2] [L57] COND FALSE !((var_1_4 * var_1_3) < stepLocal_0) [L60] var_1_8 = -16 VAL [isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=3, var_1_16=127, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=63, var_1_8=-16, var_1_9=2] [L62] var_1_9 = var_1_6 [L63] signed char stepLocal_4 = var_1_4; VAL [isInitial=1, stepLocal_4=63, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=3, var_1_16=127, var_1_19=11/10, var_1_1=32, var_1_23=100, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=63, var_1_8=-16, var_1_9=1] [L64] COND TRUE var_1_12 >= stepLocal_4 [L65] var_1_23 = var_1_16 VAL [isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=3, var_1_16=127, var_1_19=11/10, var_1_1=32, var_1_23=127, var_1_24=5, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=63, var_1_8=-16, var_1_9=1] [L67] var_1_24 = (var_1_16 + var_1_3) VAL [isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=3, var_1_16=127, var_1_19=11/10, var_1_1=32, var_1_23=127, var_1_24=189, var_1_25=4, var_1_26=32767, var_1_27=10, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=63, var_1_8=-16, var_1_9=1] [L68] COND TRUE var_1_8 != (var_1_11 + var_1_5) [L69] var_1_27 = var_1_15 VAL [isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=3, var_1_16=127, var_1_19=11/10, var_1_1=32, var_1_23=127, var_1_24=189, var_1_25=4, var_1_26=32767, var_1_27=3, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=1, var_1_32=1289/20, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=63, var_1_8=-16, var_1_9=1] [L71] var_1_31 = 0 [L72] var_1_32 = var_1_17 VAL [isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=3, var_1_16=127, var_1_17=2, var_1_19=11/10, var_1_1=32, var_1_23=127, var_1_24=189, var_1_25=4, var_1_26=32767, var_1_27=3, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=63, var_1_8=-16, var_1_9=1] [L73] COND FALSE !(! (! var_1_31)) VAL [isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=3, var_1_16=127, var_1_17=2, var_1_19=11/10, var_1_1=32, var_1_23=127, var_1_24=189, var_1_25=4, var_1_26=32767, var_1_27=3, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=63, var_1_8=-16, var_1_9=1] [L76] COND FALSE !(\read(var_1_31)) [L79] var_1_1 = var_1_4 VAL [isInitial=1, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=3, var_1_16=127, var_1_17=2, var_1_19=11/10, var_1_1=63, var_1_23=127, var_1_24=189, var_1_25=4, var_1_26=32767, var_1_27=3, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=63, var_1_8=-16, var_1_9=1] [L82] signed long int stepLocal_1 = (var_1_9 * 128) / var_1_11; VAL [isInitial=1, stepLocal_1=0, var_1_10=128, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=3, var_1_16=127, var_1_17=2, var_1_19=11/10, var_1_1=63, var_1_23=127, var_1_24=189, var_1_25=4, var_1_26=32767, var_1_27=3, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=63, var_1_8=-16, var_1_9=1] [L83] COND FALSE !(\read(var_1_31)) [L90] var_1_10 = var_1_13 VAL [isInitial=1, stepLocal_1=0, var_1_10=7516192766, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=3, var_1_16=127, var_1_17=2, var_1_19=11/10, var_1_1=63, var_1_23=127, var_1_24=189, var_1_25=4, var_1_26=32767, var_1_27=3, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=63, var_1_8=-16, var_1_9=1] [L92] signed long int stepLocal_2 = (- var_1_11) / (var_1_15 + var_1_16); VAL [isInitial=1, stepLocal_1=0, stepLocal_2=-1, var_1_10=7516192766, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=9/4, var_1_15=3, var_1_16=127, var_1_17=2, var_1_19=11/10, var_1_1=63, var_1_23=127, var_1_24=189, var_1_25=4, var_1_26=32767, var_1_27=3, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=63, var_1_8=-16, var_1_9=1] [L93] COND TRUE stepLocal_2 <= var_1_3 [L94] var_1_14 = ((((((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17)))) > (var_1_18)) ? (((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17)))) : (var_1_18))) VAL [isInitial=1, stepLocal_1=0, var_1_10=7516192766, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=3, var_1_15=3, var_1_16=127, var_1_17=2, var_1_18=0, var_1_19=11/10, var_1_1=63, var_1_23=127, var_1_24=189, var_1_25=4, var_1_26=32767, var_1_27=3, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=63, var_1_8=-16, var_1_9=1] [L100] unsigned long int stepLocal_5 = var_1_13; VAL [isInitial=1, stepLocal_1=0, stepLocal_5=7516192766, var_1_10=7516192766, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=3, var_1_15=3, var_1_16=127, var_1_17=2, var_1_18=0, var_1_19=11/10, var_1_1=63, var_1_23=127, var_1_24=189, var_1_25=4, var_1_26=32767, var_1_27=3, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=63, var_1_8=-16, var_1_9=1] [L101] COND FALSE !((~ var_1_10) >= stepLocal_5) VAL [isInitial=1, stepLocal_1=0, var_1_10=7516192766, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=3, var_1_15=3, var_1_16=127, var_1_17=2, var_1_18=0, var_1_19=11/10, var_1_1=63, var_1_23=127, var_1_24=189, var_1_25=4, var_1_26=32767, var_1_27=3, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=63, var_1_8=-16, var_1_9=1] [L104] COND TRUE -16 <= var_1_27 VAL [isInitial=1, stepLocal_1=0, var_1_10=7516192766, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=3, var_1_15=3, var_1_16=127, var_1_17=2, var_1_18=0, var_1_19=11/10, var_1_1=63, var_1_23=127, var_1_24=189, var_1_25=4, var_1_26=32767, var_1_27=3, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=63, var_1_8=-16, var_1_9=1] [L105] COND TRUE var_1_5 == var_1_28 [L106] var_1_25 = ((((var_1_4) > (var_1_8)) ? (var_1_4) : (var_1_8))) VAL [isInitial=1, stepLocal_1=0, var_1_10=7516192766, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=3, var_1_15=3, var_1_16=127, var_1_17=2, var_1_18=0, var_1_19=11/10, var_1_1=63, var_1_23=127, var_1_24=189, var_1_25=63, var_1_26=32767, var_1_27=3, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=63, var_1_8=-16, var_1_9=1] [L111] unsigned long int stepLocal_3 = var_1_10; VAL [isInitial=1, stepLocal_1=0, stepLocal_3=7516192766, var_1_10=7516192766, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=3, var_1_15=3, var_1_16=127, var_1_17=2, var_1_18=0, var_1_19=11/10, var_1_1=63, var_1_23=127, var_1_24=189, var_1_25=63, var_1_26=32767, var_1_27=3, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=63, var_1_8=-16, var_1_9=1] [L112] COND FALSE !(\read(var_1_31)) [L119] var_1_19 = var_1_22 VAL [isInitial=1, stepLocal_1=0, stepLocal_3=7516192766, var_1_10=7516192766, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=3, var_1_15=3, var_1_16=127, var_1_17=2, var_1_18=0, var_1_19=4, var_1_1=63, var_1_22=4, var_1_23=127, var_1_24=189, var_1_25=63, var_1_26=32767, var_1_27=3, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=63, var_1_8=-16, var_1_9=1] [L121] EXPR (var_1_6 / var_1_11) | var_1_5 VAL [isInitial=1, stepLocal_1=0, stepLocal_3=7516192766, var_1_10=7516192766, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=3, var_1_15=3, var_1_16=127, var_1_17=2, var_1_18=0, var_1_19=4, var_1_1=63, var_1_22=4, var_1_23=127, var_1_24=189, var_1_25=63, var_1_26=32767, var_1_27=3, var_1_28=1, var_1_29=0, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=63, var_1_8=-16, var_1_9=1] [L121] COND FALSE !((var_1_16 + var_1_3) < ((var_1_6 / var_1_11) | var_1_5)) [L126] COND FALSE !(((((var_1_19 + var_1_22) < 0 ) ? -(var_1_19 + var_1_22) : (var_1_19 + var_1_22))) < var_1_18) [L131] var_1_29 = var_1_6 VAL [isInitial=1, stepLocal_1=0, stepLocal_3=7516192766, var_1_10=7516192766, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=3, var_1_15=3, var_1_16=127, var_1_17=2, var_1_18=0, var_1_19=4, var_1_1=63, var_1_22=4, var_1_23=127, var_1_24=189, var_1_25=63, var_1_26=32767, var_1_27=3, var_1_28=1, var_1_29=1, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=63, var_1_8=-16, var_1_9=1] [L191] RET step() [L192] CALL, EXPR property() [L182] EXPR (((((((((((((! (! var_1_31)) ? (var_1_1 == ((signed char) ((((((var_1_3 - var_1_4)) > (var_1_5)) ? ((var_1_3 - var_1_4)) : (var_1_5))) + var_1_6))) : (var_1_31 ? (var_1_1 == ((signed char) var_1_3)) : (var_1_1 == ((signed char) var_1_4)))) && (var_1_7 == ((signed short int) ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4)))))) && (((var_1_4 * var_1_3) < (128 - 256)) ? (var_1_8 == ((signed char) (var_1_4 - 4))) : (var_1_8 == ((signed char) -16)))) && (var_1_9 == ((signed short int) var_1_6))) && (var_1_31 ? ((((var_1_9 * 128) / var_1_11) != (((((var_1_4 - var_1_3)) > (var_1_1)) ? ((var_1_4 - var_1_3)) : (var_1_1)))) ? (var_1_10 == ((unsigned long int) (((((var_1_12) < ((var_1_13 - var_1_3))) ? (var_1_12) : ((var_1_13 - var_1_3)))) - var_1_4))) : (var_1_10 == ((unsigned long int) var_1_11))) : (var_1_10 == ((unsigned long int) var_1_13)))) && ((((- var_1_11) / (var_1_15 + var_1_16)) <= var_1_3) ? (var_1_14 == ((double) ((((((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17)))) > (var_1_18)) ? (((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17)))) : (var_1_18))))) : (var_1_31 ? (var_1_14 == ((double) var_1_17)) : 1))) && (var_1_31 ? ((var_1_10 < (var_1_15 + (var_1_13 + var_1_25))) ? (var_1_19 == ((float) (var_1_21 - (var_1_22 + 8.25f)))) : (var_1_19 == ((float) var_1_18))) : (var_1_19 == ((float) var_1_22)))) && ((var_1_12 >= var_1_4) ? (var_1_23 == ((unsigned short int) var_1_16)) : 1)) && (var_1_24 == ((unsigned char) (var_1_16 + var_1_3)))) && ((-16 <= var_1_27) ? ((var_1_5 == var_1_28) ? (var_1_25 == ((unsigned short int) ((((var_1_4) > (var_1_8)) ? (var_1_4) : (var_1_8))))) : 1) : (var_1_25 == ((unsigned short int) (((((var_1_26) < 0 ) ? -(var_1_26) : (var_1_26))) - var_1_4))))) && ((var_1_8 != (var_1_11 + var_1_5)) ? (var_1_27 == ((unsigned short int) var_1_15)) : 1)) && (((~ var_1_10) >= var_1_13) ? (var_1_28 == ((unsigned short int) (var_1_26 - var_1_4))) : 1)) && (((var_1_16 + var_1_3) < ((var_1_6 / var_1_11) | var_1_5)) ? (((3214144168u - (var_1_30 - var_1_10)) != (- var_1_27)) ? (var_1_29 == ((signed char) (((((var_1_3 + var_1_5)) > (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))))) ? ((var_1_3 + var_1_5)) : (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6)))))))) : 1) : ((((((var_1_19 + var_1_22) < 0 ) ? -(var_1_19 + var_1_22) : (var_1_19 + var_1_22))) < var_1_18) ? ((var_1_22 <= var_1_19) ? (var_1_29 == ((signed char) var_1_4)) : 1) : (var_1_29 == ((signed char) var_1_6)))) VAL [isInitial=1, var_1_10=7516192766, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=3, var_1_15=3, var_1_16=127, var_1_17=2, var_1_18=0, var_1_19=4, var_1_1=63, var_1_22=4, var_1_23=127, var_1_24=189, var_1_25=63, var_1_26=32767, var_1_27=3, var_1_28=1, var_1_29=1, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=63, var_1_8=-16, var_1_9=1] [L182-L183] return (((((((((((((((! (! var_1_31)) ? (var_1_1 == ((signed char) ((((((var_1_3 - var_1_4)) > (var_1_5)) ? ((var_1_3 - var_1_4)) : (var_1_5))) + var_1_6))) : (var_1_31 ? (var_1_1 == ((signed char) var_1_3)) : (var_1_1 == ((signed char) var_1_4)))) && (var_1_7 == ((signed short int) ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4)))))) && (((var_1_4 * var_1_3) < (128 - 256)) ? (var_1_8 == ((signed char) (var_1_4 - 4))) : (var_1_8 == ((signed char) -16)))) && (var_1_9 == ((signed short int) var_1_6))) && (var_1_31 ? ((((var_1_9 * 128) / var_1_11) != (((((var_1_4 - var_1_3)) > (var_1_1)) ? ((var_1_4 - var_1_3)) : (var_1_1)))) ? (var_1_10 == ((unsigned long int) (((((var_1_12) < ((var_1_13 - var_1_3))) ? (var_1_12) : ((var_1_13 - var_1_3)))) - var_1_4))) : (var_1_10 == ((unsigned long int) var_1_11))) : (var_1_10 == ((unsigned long int) var_1_13)))) && ((((- var_1_11) / (var_1_15 + var_1_16)) <= var_1_3) ? (var_1_14 == ((double) ((((((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17)))) > (var_1_18)) ? (((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17)))) : (var_1_18))))) : (var_1_31 ? (var_1_14 == ((double) var_1_17)) : 1))) && (var_1_31 ? ((var_1_10 < (var_1_15 + (var_1_13 + var_1_25))) ? (var_1_19 == ((float) (var_1_21 - (var_1_22 + 8.25f)))) : (var_1_19 == ((float) var_1_18))) : (var_1_19 == ((float) var_1_22)))) && ((var_1_12 >= var_1_4) ? (var_1_23 == ((unsigned short int) var_1_16)) : 1)) && (var_1_24 == ((unsigned char) (var_1_16 + var_1_3)))) && ((-16 <= var_1_27) ? ((var_1_5 == var_1_28) ? (var_1_25 == ((unsigned short int) ((((var_1_4) > (var_1_8)) ? (var_1_4) : (var_1_8))))) : 1) : (var_1_25 == ((unsigned short int) (((((var_1_26) < 0 ) ? -(var_1_26) : (var_1_26))) - var_1_4))))) && ((var_1_8 != (var_1_11 + var_1_5)) ? (var_1_27 == ((unsigned short int) var_1_15)) : 1)) && (((~ var_1_10) >= var_1_13) ? (var_1_28 == ((unsigned short int) (var_1_26 - var_1_4))) : 1)) && (((var_1_16 + var_1_3) < ((var_1_6 / var_1_11) | var_1_5)) ? (((3214144168u - (var_1_30 - var_1_10)) != (- var_1_27)) ? (var_1_29 == ((signed char) (((((var_1_3 + var_1_5)) > (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))))) ? ((var_1_3 + var_1_5)) : (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6)))))))) : 1) : ((((((var_1_19 + var_1_22) < 0 ) ? -(var_1_19 + var_1_22) : (var_1_19 + var_1_22))) < var_1_18) ? ((var_1_22 <= var_1_19) ? (var_1_29 == ((signed char) var_1_4)) : 1) : (var_1_29 == ((signed char) var_1_6))))) && (var_1_31 == ((unsigned char) 0))) && (var_1_32 == ((double) var_1_17)) ; [L192] RET, EXPR property() [L192] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=7516192766, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=3, var_1_15=3, var_1_16=127, var_1_17=2, var_1_18=0, var_1_19=4, var_1_1=63, var_1_22=4, var_1_23=127, var_1_24=189, var_1_25=63, var_1_26=32767, var_1_27=3, var_1_28=1, var_1_29=1, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=63, var_1_8=-16, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_10=7516192766, var_1_11=130, var_1_12=2147483647, var_1_13=7516192766, var_1_14=3, var_1_15=3, var_1_16=127, var_1_17=2, var_1_18=0, var_1_19=4, var_1_1=63, var_1_22=4, var_1_23=127, var_1_24=189, var_1_25=63, var_1_26=32767, var_1_27=3, var_1_28=1, var_1_29=1, var_1_30=1073741823, var_1_31=0, var_1_32=2, var_1_3=62, var_1_4=63, var_1_5=1, var_1_6=1, var_1_7=63, var_1_8=-16, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 95 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.4s, OverallIterations: 6, TraceHistogramMax: 27, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1838 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1830 mSDsluCounter, 2613 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1992 mSDsCounter, 205 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3845 IncrementalHoareTripleChecker+Invalid, 4050 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 205 mSolverCounterUnsat, 621 mSDtfsCounter, 3845 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1389 GetRequests, 1240 SyntacticMatches, 1 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2426 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=425occurred in iteration=4, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 5 MinimizatonAttempts, 262 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 1817 NumberOfCodeBlocks, 1817 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1626 ConstructedInterpolants, 0 QuantifiedInterpolants, 8826 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1277 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 9 InterpolantComputations, 2 PerfectInterpolantSequences, 11610/12636 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 00:23:15,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-27.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 00bef7012df83cfea6557911ccded0b7d229289545c394298f9cdde0162b421c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:23:18,734 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:23:18,830 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 00:23:18,835 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:23:18,836 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:23:18,875 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:23:18,879 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:23:18,880 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:23:18,880 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:23:18,881 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:23:18,881 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:23:18,881 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:23:18,882 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:23:18,882 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:23:18,883 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:23:18,883 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:23:18,884 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:23:18,885 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:23:18,885 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:23:18,885 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:23:18,886 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:23:18,889 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:23:18,890 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:23:18,890 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 00:23:18,890 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 00:23:18,890 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:23:18,891 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 00:23:18,891 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:23:18,891 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:23:18,891 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:23:18,892 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:23:18,892 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:23:18,892 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:23:18,892 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:23:18,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:23:18,893 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:23:18,895 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:23:18,896 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:23:18,896 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 00:23:18,896 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 00:23:18,896 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:23:18,898 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:23:18,898 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:23:18,898 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:23:18,898 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 -> 00bef7012df83cfea6557911ccded0b7d229289545c394298f9cdde0162b421c [2024-11-09 00:23:19,289 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:23:19,319 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:23:19,323 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:23:19,324 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:23:19,325 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:23:19,327 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-27.i [2024-11-09 00:23:21,183 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:23:21,528 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:23:21,528 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-27.i [2024-11-09 00:23:21,542 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bebe39866/0ab6d5e049964457b926b15be3245513/FLAG5e17dfc0c [2024-11-09 00:23:21,797 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bebe39866/0ab6d5e049964457b926b15be3245513 [2024-11-09 00:23:21,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:23:21,802 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:23:21,803 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:23:21,803 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:23:21,808 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:23:21,809 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:23:21" (1/1) ... [2024-11-09 00:23:21,810 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@762fc696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:23:21, skipping insertion in model container [2024-11-09 00:23:21,810 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:23:21" (1/1) ... [2024-11-09 00:23:21,838 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:23:22,014 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-27.i[916,929] [2024-11-09 00:23:22,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:23:22,160 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:23:22,178 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-27.i[916,929] [2024-11-09 00:23:22,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:23:22,253 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:23:22,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:23:22 WrapperNode [2024-11-09 00:23:22,254 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:23:22,255 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:23:22,255 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:23:22,255 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:23:22,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:23:22" (1/1) ... [2024-11-09 00:23:22,277 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:23:22" (1/1) ... [2024-11-09 00:23:22,334 INFO L138 Inliner]: procedures = 27, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 186 [2024-11-09 00:23:22,337 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:23:22,338 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:23:22,339 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:23:22,339 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:23:22,349 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:23:22" (1/1) ... [2024-11-09 00:23:22,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:23:22" (1/1) ... [2024-11-09 00:23:22,361 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:23:22" (1/1) ... [2024-11-09 00:23:22,384 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 00:23:22,388 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:23:22" (1/1) ... [2024-11-09 00:23:22,389 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:23:22" (1/1) ... [2024-11-09 00:23:22,411 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:23:22" (1/1) ... [2024-11-09 00:23:22,415 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:23:22" (1/1) ... [2024-11-09 00:23:22,418 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:23:22" (1/1) ... [2024-11-09 00:23:22,420 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:23:22" (1/1) ... [2024-11-09 00:23:22,423 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:23:22,424 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:23:22,425 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:23:22,425 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:23:22,426 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:23:22" (1/1) ... [2024-11-09 00:23:22,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:23:22,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:23:22,469 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 00:23:22,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 00:23:22,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:23:22,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 00:23:22,525 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:23:22,525 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:23:22,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:23:22,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:23:22,635 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:23:22,638 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:23:27,765 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-09 00:23:27,766 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:23:27,779 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:23:27,779 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:23:27,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:23:27 BoogieIcfgContainer [2024-11-09 00:23:27,780 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:23:27,782 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:23:27,782 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:23:27,785 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:23:27,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:23:21" (1/3) ... [2024-11-09 00:23:27,786 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d63b0db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:23:27, skipping insertion in model container [2024-11-09 00:23:27,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:23:22" (2/3) ... [2024-11-09 00:23:27,787 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d63b0db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:23:27, skipping insertion in model container [2024-11-09 00:23:27,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:23:27" (3/3) ... [2024-11-09 00:23:27,788 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-27.i [2024-11-09 00:23:27,829 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:23:27,829 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:23:27,890 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:23:27,896 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;@646bfc2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:23:27,897 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:23:27,901 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 57 states have internal predecessors, (79), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-09 00:23:27,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-09 00:23:27,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:23:27,915 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:23:27,916 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:23:27,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:23:27,921 INFO L85 PathProgramCache]: Analyzing trace with hash 51728933, now seen corresponding path program 1 times [2024-11-09 00:23:27,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:23:27,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [140355450] [2024-11-09 00:23:27,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:23:27,935 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:23:27,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:23:27,939 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:23:27,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 00:23:28,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:28,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 00:23:28,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:23:28,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 584 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2024-11-09 00:23:28,479 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:23:28,483 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:23:28,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [140355450] [2024-11-09 00:23:28,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [140355450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:23:28,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:23:28,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:23:28,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582938695] [2024-11-09 00:23:28,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:23:28,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:23:28,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:23:28,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:23:28,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:23:28,515 INFO L87 Difference]: Start difference. First operand has 86 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 57 states have internal predecessors, (79), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-09 00:23:28,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:23:28,565 INFO L93 Difference]: Finished difference Result 165 states and 287 transitions. [2024-11-09 00:23:28,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:23:28,569 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 177 [2024-11-09 00:23:28,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:23:28,576 INFO L225 Difference]: With dead ends: 165 [2024-11-09 00:23:28,577 INFO L226 Difference]: Without dead ends: 82 [2024-11-09 00:23:28,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:23:28,584 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:23:28,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:23:28,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-09 00:23:28,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-09 00:23:28,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 53 states have internal predecessors, (71), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-09 00:23:28,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 125 transitions. [2024-11-09 00:23:28,630 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 125 transitions. Word has length 177 [2024-11-09 00:23:28,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:23:28,631 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 125 transitions. [2024-11-09 00:23:28,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-09 00:23:28,631 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 125 transitions. [2024-11-09 00:23:28,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-09 00:23:28,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:23:28,635 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:23:28,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 00:23:28,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-11-09 00:23:28,837 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:23:28,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:23:28,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1119708623, now seen corresponding path program 1 times [2024-11-09 00:23:28,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:23:28,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1394913671] [2024-11-09 00:23:28,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:23:28,840 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:23:28,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:23:28,844 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:23:28,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 00:23:29,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:29,321 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 00:23:29,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:23:33,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 84 proven. 216 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-09 00:23:33,495 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:23:35,493 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:23:35,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1394913671] [2024-11-09 00:23:35,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1394913671] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:23:35,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1530419740] [2024-11-09 00:23:35,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:23:35,494 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 00:23:35,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 00:23:35,500 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 00:23:35,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-09 00:23:36,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:36,094 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 00:23:36,100 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:23:36,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-09 00:23:36,231 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:23:36,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1530419740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:23:36,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 00:23:36,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2024-11-09 00:23:36,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125060270] [2024-11-09 00:23:36,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:23:36,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 00:23:36,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:23:36,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 00:23:36,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2024-11-09 00:23:36,236 INFO L87 Difference]: Start difference. First operand 82 states and 125 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-09 00:23:39,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:23:39,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:23:39,447 INFO L93 Difference]: Finished difference Result 236 states and 361 transitions. [2024-11-09 00:23:39,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 00:23:39,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 178 [2024-11-09 00:23:39,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:23:39,497 INFO L225 Difference]: With dead ends: 236 [2024-11-09 00:23:39,498 INFO L226 Difference]: Without dead ends: 157 [2024-11-09 00:23:39,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 498 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2024-11-09 00:23:39,500 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 115 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-09 00:23:39,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 241 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-09 00:23:39,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-09 00:23:39,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 93. [2024-11-09 00:23:39,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 64 states have (on average 1.328125) internal successors, (85), 64 states have internal predecessors, (85), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-09 00:23:39,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 139 transitions. [2024-11-09 00:23:39,522 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 139 transitions. Word has length 178 [2024-11-09 00:23:39,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:23:39,526 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 139 transitions. [2024-11-09 00:23:39,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-09 00:23:39,527 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 139 transitions. [2024-11-09 00:23:39,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-09 00:23:39,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:23:39,532 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:23:39,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-11-09 00:23:39,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 00:23:39,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:23:39,941 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:23:39,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:23:39,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1776204910, now seen corresponding path program 1 times [2024-11-09 00:23:39,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:23:39,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1921347633] [2024-11-09 00:23:39,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:23:39,943 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:23:39,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:23:39,948 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:23:39,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 00:23:40,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:40,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 00:23:40,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:23:42,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 84 proven. 216 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-09 00:23:42,998 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:23:44,587 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:23:44,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1921347633] [2024-11-09 00:23:44,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1921347633] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:23:44,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [792054287] [2024-11-09 00:23:44,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:23:44,588 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 00:23:44,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 00:23:44,594 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 00:23:44,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-09 00:23:46,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:46,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 00:23:46,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:23:50,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 84 proven. 216 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-09 00:23:50,356 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:23:51,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [792054287] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:23:51,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 00:23:51,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2024-11-09 00:23:51,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189716630] [2024-11-09 00:23:51,970 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 00:23:51,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 00:23:51,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:23:51,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 00:23:51,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2024-11-09 00:23:51,972 INFO L87 Difference]: Start difference. First operand 93 states and 139 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) [2024-11-09 00:23:57,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.56s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:23:58,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:23:58,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:23:58,425 INFO L93 Difference]: Finished difference Result 197 states and 286 transitions. [2024-11-09 00:23:58,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 00:23:58,434 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) Word has length 179 [2024-11-09 00:23:58,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:23:58,437 INFO L225 Difference]: With dead ends: 197 [2024-11-09 00:23:58,437 INFO L226 Difference]: Without dead ends: 107 [2024-11-09 00:23:58,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 677 GetRequests, 661 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-11-09 00:23:58,439 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 52 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-11-09 00:23:58,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 352 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2024-11-09 00:23:58,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-09 00:23:58,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2024-11-09 00:23:58,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 73 states have (on average 1.273972602739726) internal successors, (93), 73 states have internal predecessors, (93), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-09 00:23:58,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 147 transitions. [2024-11-09 00:23:58,460 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 147 transitions. Word has length 179 [2024-11-09 00:23:58,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:23:58,465 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 147 transitions. [2024-11-09 00:23:58,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 4 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) [2024-11-09 00:23:58,466 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 147 transitions. [2024-11-09 00:23:58,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-09 00:23:58,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:23:58,468 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:23:58,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-09 00:23:58,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2024-11-09 00:23:58,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-09 00:23:58,870 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:23:58,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:23:58,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1910218416, now seen corresponding path program 1 times [2024-11-09 00:23:58,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:23:58,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2000688252] [2024-11-09 00:23:58,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:23:58,872 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:23:58,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:23:58,877 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:23:58,890 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 (7)] Waiting until timeout for monitored process [2024-11-09 00:23:59,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:23:59,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 00:23:59,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:24:00,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 728 proven. 39 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2024-11-09 00:24:00,309 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:24:01,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 39 proven. 39 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-11-09 00:24:01,672 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:24:01,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2000688252] [2024-11-09 00:24:01,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2000688252] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 00:24:01,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 00:24:01,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-09 00:24:01,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39896245] [2024-11-09 00:24:01,673 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 00:24:01,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 00:24:01,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:24:01,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 00:24:01,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-09 00:24:01,675 INFO L87 Difference]: Start difference. First operand 105 states and 147 transitions. Second operand has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 3 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) [2024-11-09 00:24:07,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:24:08,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:24:08,829 INFO L93 Difference]: Finished difference Result 269 states and 368 transitions. [2024-11-09 00:24:08,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 00:24:08,830 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 3 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) Word has length 179 [2024-11-09 00:24:08,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:24:08,832 INFO L225 Difference]: With dead ends: 269 [2024-11-09 00:24:08,832 INFO L226 Difference]: Without dead ends: 167 [2024-11-09 00:24:08,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2024-11-09 00:24:08,834 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 152 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2024-11-09 00:24:08,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 476 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2024-11-09 00:24:08,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-09 00:24:08,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 160. [2024-11-09 00:24:08,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 110 states have (on average 1.2363636363636363) internal successors, (136), 111 states have internal predecessors, (136), 40 states have call successors, (40), 9 states have call predecessors, (40), 9 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-09 00:24:08,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 216 transitions. [2024-11-09 00:24:08,853 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 216 transitions. Word has length 179 [2024-11-09 00:24:08,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:24:08,854 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 216 transitions. [2024-11-09 00:24:08,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 3 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) [2024-11-09 00:24:08,854 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 216 transitions. [2024-11-09 00:24:08,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-09 00:24:08,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:24:08,856 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:24:08,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-09 00:24:09,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:24:09,057 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:24:09,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:24:09,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1209153838, now seen corresponding path program 1 times [2024-11-09 00:24:09,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:24:09,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1178462079] [2024-11-09 00:24:09,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:24:09,059 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:24:09,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:24:09,062 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:24:09,064 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 (8)] Waiting until timeout for monitored process [2024-11-09 00:24:09,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:24:09,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-09 00:24:09,553 INFO L278 TraceCheckSpWp]: Computing forward predicates...