./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-49.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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_codestructure_normal_file-49.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 02fd9ca01e9b4cf3bb802fdecc600f36b127dae39ec959fa79aabe6d1e914ff2 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 01:15:17,934 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 01:15:17,971 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 01:15:17,975 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 01:15:17,975 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 01:15:17,990 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 01:15:17,990 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 01:15:17,991 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 01:15:17,991 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 01:15:17,992 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 01:15:17,992 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 01:15:17,992 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 01:15:17,996 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 01:15:17,996 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 01:15:17,996 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 01:15:17,997 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 01:15:17,997 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 01:15:17,997 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 01:15:17,997 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 01:15:17,998 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 01:15:17,998 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 01:15:17,998 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 01:15:17,999 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 01:15:17,999 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 01:15:17,999 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 01:15:17,999 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 01:15:18,000 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 01:15:18,000 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 01:15:18,000 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 01:15:18,000 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 01:15:18,001 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 01:15:18,001 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 01:15:18,001 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:15:18,001 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 01:15:18,001 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 01:15:18,002 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 01:15:18,002 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 01:15:18,002 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 01:15:18,002 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 01:15:18,002 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 01:15:18,003 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 01:15:18,003 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 01:15:18,003 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 -> 02fd9ca01e9b4cf3bb802fdecc600f36b127dae39ec959fa79aabe6d1e914ff2 [2024-11-12 01:15:18,261 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 01:15:18,284 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 01:15:18,288 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 01:15:18,289 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 01:15:18,289 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 01:15:18,290 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-49.i [2024-11-12 01:15:19,802 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 01:15:19,994 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 01:15:19,995 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-49.i [2024-11-12 01:15:20,011 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04950c20c/dd7b8f9e49764a71ba63de833964f802/FLAG971a83111 [2024-11-12 01:15:20,036 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04950c20c/dd7b8f9e49764a71ba63de833964f802 [2024-11-12 01:15:20,039 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 01:15:20,043 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 01:15:20,046 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 01:15:20,046 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 01:15:20,052 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 01:15:20,053 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:15:20" (1/1) ... [2024-11-12 01:15:20,054 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78eb153d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:20, skipping insertion in model container [2024-11-12 01:15:20,054 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:15:20" (1/1) ... [2024-11-12 01:15:20,084 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 01:15:20,232 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-49.i[913,926] [2024-11-12 01:15:20,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:15:20,302 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 01:15:20,314 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-49.i[913,926] [2024-11-12 01:15:20,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:15:20,369 INFO L204 MainTranslator]: Completed translation [2024-11-12 01:15:20,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:20 WrapperNode [2024-11-12 01:15:20,370 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 01:15:20,370 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 01:15:20,371 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 01:15:20,371 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 01:15:20,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:20" (1/1) ... [2024-11-12 01:15:20,385 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:20" (1/1) ... [2024-11-12 01:15:20,432 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 191 [2024-11-12 01:15:20,433 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 01:15:20,433 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 01:15:20,433 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 01:15:20,433 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 01:15:20,442 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:20" (1/1) ... [2024-11-12 01:15:20,443 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:20" (1/1) ... [2024-11-12 01:15:20,445 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:20" (1/1) ... [2024-11-12 01:15:20,472 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-12 01:15:20,472 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:20" (1/1) ... [2024-11-12 01:15:20,475 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:20" (1/1) ... [2024-11-12 01:15:20,491 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:20" (1/1) ... [2024-11-12 01:15:20,496 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:20" (1/1) ... [2024-11-12 01:15:20,504 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:20" (1/1) ... [2024-11-12 01:15:20,506 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:20" (1/1) ... [2024-11-12 01:15:20,510 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 01:15:20,514 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 01:15:20,514 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 01:15:20,514 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 01:15:20,515 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:20" (1/1) ... [2024-11-12 01:15:20,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:15:20,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:15:20,557 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-12 01:15:20,565 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-12 01:15:20,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 01:15:20,601 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 01:15:20,602 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 01:15:20,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 01:15:20,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 01:15:20,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 01:15:20,694 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 01:15:20,697 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 01:15:21,027 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-12 01:15:21,028 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 01:15:21,038 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 01:15:21,039 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 01:15:21,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:15:21 BoogieIcfgContainer [2024-11-12 01:15:21,040 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 01:15:21,042 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 01:15:21,042 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 01:15:21,048 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 01:15:21,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:15:20" (1/3) ... [2024-11-12 01:15:21,049 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@371e0a81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:15:21, skipping insertion in model container [2024-11-12 01:15:21,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:20" (2/3) ... [2024-11-12 01:15:21,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@371e0a81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:15:21, skipping insertion in model container [2024-11-12 01:15:21,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:15:21" (3/3) ... [2024-11-12 01:15:21,051 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-49.i [2024-11-12 01:15:21,065 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 01:15:21,065 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 01:15:21,116 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 01:15:21,121 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;@59a2f3ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 01:15:21,121 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 01:15:21,126 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 55 states have internal predecessors, (74), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-12 01:15:21,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-12 01:15:21,137 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:15:21,137 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:15:21,138 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:15:21,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:15:21,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1571840951, now seen corresponding path program 1 times [2024-11-12 01:15:21,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:15:21,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568147062] [2024-11-12 01:15:21,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:15:21,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:15:21,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:21,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:15:21,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:21,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:15:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:21,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:15:21,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:21,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:15:21,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:21,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:15:21,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:21,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:15:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:21,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:15:21,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:21,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:15:21,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:21,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:15:21,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:21,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:15:21,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:21,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:15:21,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:21,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:15:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:21,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:15:21,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:21,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:15:21,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:21,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:15:21,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:21,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:15:21,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:21,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:15:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:21,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 01:15:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:21,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 01:15:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:21,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 01:15:21,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:21,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 01:15:21,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:21,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 01:15:21,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:21,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 01:15:21,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:21,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 01:15:21,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:21,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 01:15:21,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:21,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 01:15:21,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:21,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 01:15:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:21,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 01:15:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:21,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-12 01:15:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:21,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-12 01:15:21,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:21,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-12 01:15:21,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:21,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-12 01:15:21,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:21,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-12 01:15:21,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:21,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-12 01:15:21,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:15:21,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568147062] [2024-11-12 01:15:21,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568147062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:15:21,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:15:21,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 01:15:21,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49933126] [2024-11-12 01:15:21,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:15:21,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 01:15:21,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:15:21,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 01:15:21,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:15:21,691 INFO L87 Difference]: Start difference. First operand has 90 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 55 states have internal predecessors, (74), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-12 01:15:21,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:15:21,754 INFO L93 Difference]: Finished difference Result 172 states and 305 transitions. [2024-11-12 01:15:21,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 01:15:21,758 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 201 [2024-11-12 01:15:21,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:15:21,768 INFO L225 Difference]: With dead ends: 172 [2024-11-12 01:15:21,769 INFO L226 Difference]: Without dead ends: 85 [2024-11-12 01:15:21,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 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-12 01:15:21,810 INFO L435 NwaCegarLoop]: 130 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, 130 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-12 01:15:21,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 01:15:21,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-12 01:15:21,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-12 01:15:21,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 50 states have (on average 1.28) internal successors, (64), 50 states have internal predecessors, (64), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-12 01:15:21,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 130 transitions. [2024-11-12 01:15:21,901 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 130 transitions. Word has length 201 [2024-11-12 01:15:21,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:15:21,901 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 130 transitions. [2024-11-12 01:15:21,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-12 01:15:21,902 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 130 transitions. [2024-11-12 01:15:21,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-12 01:15:21,904 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:15:21,905 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:15:21,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 01:15:21,905 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:15:21,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:15:21,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1752424173, now seen corresponding path program 1 times [2024-11-12 01:15:21,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:15:21,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944562450] [2024-11-12 01:15:21,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:15:21,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:15:22,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:22,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:15:22,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:22,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:15:22,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:22,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:15:22,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:22,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:15:22,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:22,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:15:22,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:22,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:15:22,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:22,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:15:22,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:22,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:15:22,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:22,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:15:22,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:22,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:15:22,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:22,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:15:22,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:22,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:15:22,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:22,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:15:22,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:22,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:15:22,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:22,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:15:22,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:22,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:15:22,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:22,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:15:22,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:22,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 01:15:22,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:22,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 01:15:22,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:22,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 01:15:22,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:22,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 01:15:22,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:22,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 01:15:22,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:22,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 01:15:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:22,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 01:15:22,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:22,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 01:15:22,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:22,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 01:15:22,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:22,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 01:15:22,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:22,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 01:15:22,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:22,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-12 01:15:22,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:22,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-12 01:15:22,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:22,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-12 01:15:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:22,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-12 01:15:22,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:22,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-12 01:15:22,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:22,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-12 01:15:22,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:15:22,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944562450] [2024-11-12 01:15:22,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944562450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:15:22,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:15:22,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 01:15:22,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216660030] [2024-11-12 01:15:22,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:15:22,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 01:15:22,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:15:22,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 01:15:22,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 01:15:22,361 INFO L87 Difference]: Start difference. First operand 85 states and 130 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-12 01:15:22,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:15:22,405 INFO L93 Difference]: Finished difference Result 168 states and 259 transitions. [2024-11-12 01:15:22,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 01:15:22,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 201 [2024-11-12 01:15:22,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:15:22,409 INFO L225 Difference]: With dead ends: 168 [2024-11-12 01:15:22,409 INFO L226 Difference]: Without dead ends: 86 [2024-11-12 01:15:22,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 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-12 01:15:22,414 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 01:15:22,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 252 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 01:15:22,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-12 01:15:22,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-12 01:15:22,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 51 states have internal predecessors, (65), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-12 01:15:22,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 131 transitions. [2024-11-12 01:15:22,433 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 131 transitions. Word has length 201 [2024-11-12 01:15:22,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:15:22,435 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 131 transitions. [2024-11-12 01:15:22,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-12 01:15:22,436 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 131 transitions. [2024-11-12 01:15:22,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-12 01:15:22,441 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:15:22,441 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:15:22,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 01:15:22,442 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:15:22,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:15:22,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1629288251, now seen corresponding path program 1 times [2024-11-12 01:15:22,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:15:22,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821288318] [2024-11-12 01:15:22,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:15:22,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:15:22,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:22,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:15:22,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:22,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:15:22,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:22,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:15:22,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:22,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:15:22,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:22,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:15:22,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:22,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:15:22,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:22,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:15:23,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:23,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:15:23,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:23,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:15:23,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:23,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:15:23,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:23,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:15:23,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:23,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:15:23,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:23,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:15:23,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:23,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:15:23,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:23,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:15:23,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:23,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:15:23,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:23,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:15:23,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:23,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 01:15:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:23,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 01:15:23,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:23,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 01:15:23,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:23,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 01:15:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:23,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 01:15:23,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:23,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 01:15:23,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:23,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 01:15:23,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:23,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 01:15:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:23,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 01:15:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:23,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 01:15:23,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:23,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 01:15:23,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:23,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-12 01:15:23,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:23,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-12 01:15:23,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:23,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-12 01:15:23,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:23,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-12 01:15:23,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:23,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-12 01:15:23,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:23,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 54 proven. 42 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-12 01:15:23,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:15:23,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821288318] [2024-11-12 01:15:23,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821288318] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 01:15:23,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208870792] [2024-11-12 01:15:23,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:15:23,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 01:15:23,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:15:23,119 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-12 01:15:23,120 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-12 01:15:23,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:23,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 01:15:23,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:15:23,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1076 proven. 42 refuted. 0 times theorem prover too weak. 994 trivial. 0 not checked. [2024-11-12 01:15:23,495 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 01:15:23,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 54 proven. 42 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-12 01:15:23,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208870792] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 01:15:23,756 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 01:15:23,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2024-11-12 01:15:23,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951965409] [2024-11-12 01:15:23,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 01:15:23,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 01:15:23,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:15:23,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 01:15:23,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-12 01:15:23,761 INFO L87 Difference]: Start difference. First operand 86 states and 131 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2024-11-12 01:15:24,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:15:24,174 INFO L93 Difference]: Finished difference Result 200 states and 299 transitions. [2024-11-12 01:15:24,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 01:15:24,175 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) Word has length 202 [2024-11-12 01:15:24,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:15:24,181 INFO L225 Difference]: With dead ends: 200 [2024-11-12 01:15:24,181 INFO L226 Difference]: Without dead ends: 117 [2024-11-12 01:15:24,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 465 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2024-11-12 01:15:24,187 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 170 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 01:15:24,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 243 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 01:15:24,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-12 01:15:24,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 94. [2024-11-12 01:15:24,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 58 states have internal predecessors, (73), 33 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-12 01:15:24,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 139 transitions. [2024-11-12 01:15:24,222 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 139 transitions. Word has length 202 [2024-11-12 01:15:24,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:15:24,223 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 139 transitions. [2024-11-12 01:15:24,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2024-11-12 01:15:24,228 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 139 transitions. [2024-11-12 01:15:24,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-12 01:15:24,231 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:15:24,231 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:15:24,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 01:15:24,436 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-12 01:15:24,437 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:15:24,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:15:24,441 INFO L85 PathProgramCache]: Analyzing trace with hash -2075481313, now seen corresponding path program 1 times [2024-11-12 01:15:24,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:15:24,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632959250] [2024-11-12 01:15:24,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:15:24,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:15:24,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 01:15:24,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [572301096] [2024-11-12 01:15:24,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:15:24,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 01:15:24,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:15:24,614 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-12 01:15:24,615 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-12 01:15:24,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 01:15:24,804 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 01:15:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 01:15:25,042 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 01:15:25,042 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 01:15:25,043 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 01:15:25,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-12 01:15:25,249 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-12 01:15:25,257 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-12 01:15:25,375 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 01:15:25,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 01:15:25 BoogieIcfgContainer [2024-11-12 01:15:25,382 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 01:15:25,383 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 01:15:25,383 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 01:15:25,383 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 01:15:25,383 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:15:21" (3/4) ... [2024-11-12 01:15:25,386 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 01:15:25,387 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 01:15:25,390 INFO L158 Benchmark]: Toolchain (without parser) took 5344.46ms. Allocated memory was 165.7MB in the beginning and 383.8MB in the end (delta: 218.1MB). Free memory was 93.1MB in the beginning and 257.5MB in the end (delta: -164.5MB). Peak memory consumption was 55.7MB. Max. memory is 16.1GB. [2024-11-12 01:15:25,391 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 165.7MB. Free memory is still 133.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 01:15:25,391 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.87ms. Allocated memory was 165.7MB in the beginning and 295.7MB in the end (delta: 130.0MB). Free memory was 92.9MB in the beginning and 259.0MB in the end (delta: -166.1MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2024-11-12 01:15:25,391 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.22ms. Allocated memory is still 295.7MB. Free memory was 259.0MB in the beginning and 261.9MB in the end (delta: -3.0MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2024-11-12 01:15:25,395 INFO L158 Benchmark]: Boogie Preprocessor took 79.72ms. Allocated memory is still 295.7MB. Free memory was 261.9MB in the beginning and 255.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 01:15:25,395 INFO L158 Benchmark]: RCFGBuilder took 526.38ms. Allocated memory is still 295.7MB. Free memory was 255.7MB in the beginning and 230.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-12 01:15:25,396 INFO L158 Benchmark]: TraceAbstraction took 4340.30ms. Allocated memory was 295.7MB in the beginning and 383.8MB in the end (delta: 88.1MB). Free memory was 229.4MB in the beginning and 257.5MB in the end (delta: -28.1MB). Peak memory consumption was 60.9MB. Max. memory is 16.1GB. [2024-11-12 01:15:25,396 INFO L158 Benchmark]: Witness Printer took 4.16ms. Allocated memory is still 383.8MB. Free memory is still 257.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 01:15:25,397 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.18ms. Allocated memory is still 165.7MB. Free memory is still 133.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 323.87ms. Allocated memory was 165.7MB in the beginning and 295.7MB in the end (delta: 130.0MB). Free memory was 92.9MB in the beginning and 259.0MB in the end (delta: -166.1MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.22ms. Allocated memory is still 295.7MB. Free memory was 259.0MB in the beginning and 261.9MB in the end (delta: -3.0MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.72ms. Allocated memory is still 295.7MB. Free memory was 261.9MB in the beginning and 255.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 526.38ms. Allocated memory is still 295.7MB. Free memory was 255.7MB in the beginning and 230.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4340.30ms. Allocated memory was 295.7MB in the beginning and 383.8MB in the end (delta: 88.1MB). Free memory was 229.4MB in the beginning and 257.5MB in the end (delta: -28.1MB). Peak memory consumption was 60.9MB. Max. memory is 16.1GB. * Witness Printer took 4.16ms. Allocated memory is still 383.8MB. Free memory is still 257.5MB. 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 someBinaryFLOATComparisonOperation at line 144, overapproximation of someBinaryDOUBLEComparisonOperation at line 144. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 10; [L23] unsigned char var_1_2 = 0; [L24] unsigned long int var_1_3 = 3171453299; [L25] unsigned long int var_1_4 = 2038274679; [L26] unsigned long int var_1_5 = 1375699353; [L27] unsigned long int var_1_6 = 10; [L28] unsigned long int var_1_7 = 16; [L29] unsigned short int var_1_8 = 16; [L30] unsigned short int var_1_9 = 128; [L31] unsigned short int var_1_10 = 1; [L32] unsigned short int var_1_11 = 100; [L33] unsigned char var_1_12 = 1; [L34] unsigned char var_1_13 = 1; [L35] double var_1_14 = 64.45; [L36] float var_1_15 = 31.15; [L37] float var_1_16 = 16.4; [L38] double var_1_17 = 100.625; [L39] double var_1_18 = 128.1; [L40] unsigned char var_1_19 = 1; [L41] unsigned char var_1_20 = 8; [L42] unsigned char var_1_21 = 100; [L43] unsigned char var_1_22 = 0; [L44] signed char var_1_23 = 2; [L45] unsigned char var_1_24 = 0; VAL [isInitial=0, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=0, var_1_3=3171453299, var_1_4=2038274679, var_1_5=1375699353, var_1_6=10, var_1_7=16, var_1_8=16, var_1_9=128] [L148] isInitial = 1 [L149] FCALL initially() [L150] COND TRUE 1 [L151] FCALL updateLastVariables() [L152] CALL updateVariables() [L89] var_1_2 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=3171453299, var_1_4=2038274679, var_1_5=1375699353, var_1_6=10, var_1_7=16, var_1_8=16, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=3171453299, var_1_4=2038274679, var_1_5=1375699353, var_1_6=10, var_1_7=16, var_1_8=16, var_1_9=128] [L90] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_3=3171453299, var_1_4=2038274679, var_1_5=1375699353, var_1_6=10, var_1_7=16, var_1_8=16, var_1_9=128] [L91] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=3171453299, var_1_4=2038274679, var_1_5=1375699353, var_1_6=10, var_1_7=16, var_1_8=16, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=3171453299, var_1_4=2038274679, var_1_5=1375699353, var_1_6=10, var_1_7=16, var_1_8=16, var_1_9=128] [L91] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=3171453299, var_1_4=2038274679, var_1_5=1375699353, var_1_6=10, var_1_7=16, var_1_8=16, var_1_9=128] [L92] var_1_3 = __VERIFIER_nondet_ulong() [L93] CALL assume_abort_if_not(var_1_3 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=2038274679, var_1_5=1375699353, var_1_6=10, var_1_7=16, var_1_8=16, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=2038274679, var_1_5=1375699353, var_1_6=10, var_1_7=16, var_1_8=16, var_1_9=128] [L93] RET assume_abort_if_not(var_1_3 >= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=2038274679, var_1_5=1375699353, var_1_6=10, var_1_7=16, var_1_8=16, var_1_9=128] [L94] CALL assume_abort_if_not(var_1_3 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=2038274679, var_1_5=1375699353, var_1_6=10, var_1_7=16, var_1_8=16, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=2038274679, var_1_5=1375699353, var_1_6=10, var_1_7=16, var_1_8=16, var_1_9=128] [L94] RET assume_abort_if_not(var_1_3 <= 4294967294) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=2038274679, var_1_5=1375699353, var_1_6=10, var_1_7=16, var_1_8=16, var_1_9=128] [L95] var_1_4 = __VERIFIER_nondet_ulong() [L96] CALL assume_abort_if_not(var_1_4 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=1375699353, var_1_6=10, var_1_7=16, var_1_8=16, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=1375699353, var_1_6=10, var_1_7=16, var_1_8=16, var_1_9=128] [L96] RET assume_abort_if_not(var_1_4 >= 1073741823) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=1375699353, var_1_6=10, var_1_7=16, var_1_8=16, var_1_9=128] [L97] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=1375699353, var_1_6=10, var_1_7=16, var_1_8=16, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=1375699353, var_1_6=10, var_1_7=16, var_1_8=16, var_1_9=128] [L97] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=1375699353, var_1_6=10, var_1_7=16, var_1_8=16, var_1_9=128] [L98] var_1_5 = __VERIFIER_nondet_ulong() [L99] CALL assume_abort_if_not(var_1_5 >= 1073741824) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=10, var_1_7=16, var_1_8=16, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=10, var_1_7=16, var_1_8=16, var_1_9=128] [L99] RET assume_abort_if_not(var_1_5 >= 1073741824) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=10, var_1_7=16, var_1_8=16, var_1_9=128] [L100] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=10, var_1_7=16, var_1_8=16, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=10, var_1_7=16, var_1_8=16, var_1_9=128] [L100] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=10, var_1_7=16, var_1_8=16, var_1_9=128] [L101] var_1_6 = __VERIFIER_nondet_ulong() [L102] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_7=16, var_1_8=16, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_7=16, var_1_8=16, var_1_9=128] [L102] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_7=16, var_1_8=16, var_1_9=128] [L103] CALL assume_abort_if_not(var_1_6 <= 1073741824) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=16, var_1_8=16, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=16, var_1_8=16, var_1_9=128] [L103] RET assume_abort_if_not(var_1_6 <= 1073741824) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=16, var_1_8=16, var_1_9=128] [L104] var_1_7 = __VERIFIER_nondet_ulong() [L105] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_8=16, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_8=16, var_1_9=128] [L105] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_8=16, var_1_9=128] [L106] CALL assume_abort_if_not(var_1_7 <= 1073741824) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=128] [L106] RET assume_abort_if_not(var_1_7 <= 1073741824) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=128] [L107] var_1_9 = __VERIFIER_nondet_ushort() [L108] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16] [L108] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16] [L109] CALL assume_abort_if_not(var_1_9 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L109] RET assume_abort_if_not(var_1_9 <= 32767) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L110] var_1_10 = __VERIFIER_nondet_ushort() [L111] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L111] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L112] CALL assume_abort_if_not(var_1_10 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-65536, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-65536, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L112] RET assume_abort_if_not(var_1_10 <= 32767) VAL [isInitial=1, var_1_10=-65536, var_1_11=100, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L113] var_1_11 = __VERIFIER_nondet_ushort() [L114] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-65536, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-65536, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L114] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=-65536, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L115] CALL assume_abort_if_not(var_1_11 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L115] RET assume_abort_if_not(var_1_11 <= 16383) VAL [isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L116] var_1_13 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L117] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L118] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L118] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_15=623/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L119] var_1_15 = __VERIFIER_nondet_float() [L120] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L120] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_16=82/5, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L121] var_1_16 = __VERIFIER_nondet_float() [L122] CALL assume_abort_if_not((var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L122] RET assume_abort_if_not((var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_17=805/8, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L123] var_1_17 = __VERIFIER_nondet_double() [L124] 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=-65536, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L124] 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=-65536, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_18=1281/10, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L125] var_1_18 = __VERIFIER_nondet_double() [L126] 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=-65536, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L126] 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=-65536, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=8, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L127] var_1_20 = __VERIFIER_nondet_uchar() [L128] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L128] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L129] CALL assume_abort_if_not(var_1_20 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=-256, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=-256, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L129] RET assume_abort_if_not(var_1_20 <= 254) VAL [isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=-256, var_1_21=100, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L130] var_1_21 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=-256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=-256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L131] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=-256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L132] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=-256, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=-256, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L132] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=-256, var_1_21=256, var_1_22=0, var_1_23=2, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L133] var_1_23 = __VERIFIER_nondet_char() [L134] CALL assume_abort_if_not(var_1_23 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=-256, var_1_21=256, var_1_22=0, var_1_23=1, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=-256, var_1_21=256, var_1_22=0, var_1_23=1, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L134] RET assume_abort_if_not(var_1_23 >= -128) VAL [isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=-256, var_1_21=256, var_1_22=0, var_1_23=1, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L135] CALL assume_abort_if_not(var_1_23 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=-256, var_1_21=256, var_1_22=0, var_1_23=1, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=-256, var_1_21=256, var_1_22=0, var_1_23=1, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L135] RET assume_abort_if_not(var_1_23 <= 127) VAL [isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=-256, var_1_21=256, var_1_22=0, var_1_23=1, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L136] CALL assume_abort_if_not(var_1_23 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=-256, var_1_21=256, var_1_22=0, var_1_23=1, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=-256, var_1_21=256, var_1_22=0, var_1_23=1, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L136] RET assume_abort_if_not(var_1_23 != 0) VAL [isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=-256, var_1_21=256, var_1_22=0, var_1_23=1, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L137] var_1_24 = __VERIFIER_nondet_uchar() [L138] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=-256, var_1_21=256, var_1_22=0, var_1_23=1, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=-256, var_1_21=256, var_1_22=0, var_1_23=1, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L138] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=-256, var_1_21=256, var_1_22=0, var_1_23=1, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L139] CALL assume_abort_if_not(var_1_24 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=-256, var_1_21=256, var_1_22=0, var_1_23=1, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=-256, var_1_21=256, var_1_22=0, var_1_23=1, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L139] RET assume_abort_if_not(var_1_24 <= 0) VAL [isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=10, var_1_20=-256, var_1_21=256, var_1_22=0, var_1_23=1, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L152] RET updateVariables() [L153] CALL step() [L49] COND TRUE \read(var_1_2) [L50] var_1_1 = (((((var_1_3) > ((var_1_4 + var_1_5))) ? (var_1_3) : ((var_1_4 + var_1_5)))) - (((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7))) + 256u)) VAL [isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=2147483391, var_1_20=-256, var_1_21=256, var_1_22=0, var_1_23=1, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=65536] [L52] var_1_8 = ((((25) > ((((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) + (100 + var_1_11)))) ? (25) : ((((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) + (100 + var_1_11))))) VAL [isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=1, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=2147483391, var_1_20=-256, var_1_21=256, var_1_22=0, var_1_23=1, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=100, var_1_9=65536] [L53] COND FALSE !(! var_1_2) [L58] var_1_12 = 0 VAL [isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1289/20, var_1_19=1, var_1_1=2147483391, var_1_20=-256, var_1_21=256, var_1_22=0, var_1_23=1, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=100, var_1_9=65536] [L60] COND TRUE (((((- 9.5f)) > ((- var_1_15))) ? ((- 9.5f)) : ((- var_1_15)))) < var_1_16 [L61] var_1_14 = ((((var_1_17) < (var_1_18)) ? (var_1_17) : (var_1_18))) VAL [isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=2, var_1_17=2, var_1_18=0, var_1_19=1, var_1_1=2147483391, var_1_20=-256, var_1_21=256, var_1_22=0, var_1_23=1, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=100, var_1_9=65536] [L63] COND TRUE var_1_13 && var_1_2 VAL [isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=2, var_1_17=2, var_1_18=0, var_1_19=1, var_1_1=2147483391, var_1_20=-256, var_1_21=256, var_1_22=0, var_1_23=1, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=100, var_1_9=65536] [L64] COND TRUE var_1_4 > (256u * var_1_8) [L65] var_1_19 = ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21))) VAL [isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=2, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=2147483391, var_1_20=-256, var_1_21=256, var_1_22=0, var_1_23=1, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=100, var_1_9=65536] [L70] EXPR var_1_11 & var_1_4 VAL [isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=2, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=2147483391, var_1_20=-256, var_1_21=256, var_1_22=0, var_1_23=1, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=100, var_1_9=65536] [L70] COND TRUE (-2 / var_1_23) >= (var_1_11 & var_1_4) [L71] COND FALSE !(var_1_21 >= (var_1_19 + var_1_5)) [L82] var_1_22 = var_1_13 VAL [isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=2, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=2147483391, var_1_20=-256, var_1_21=256, var_1_22=1, var_1_23=1, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=100, var_1_9=65536] [L153] RET step() [L154] CALL, EXPR property() [L144] EXPR (((((var_1_2 ? (var_1_1 == ((unsigned long int) (((((var_1_3) > ((var_1_4 + var_1_5))) ? (var_1_3) : ((var_1_4 + var_1_5)))) - (((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7))) + 256u)))) : 1) && (var_1_8 == ((unsigned short int) ((((25) > ((((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) + (100 + var_1_11)))) ? (25) : ((((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) + (100 + var_1_11)))))))) && ((! var_1_2) ? (((var_1_1 * ((((var_1_8) < (var_1_5)) ? (var_1_8) : (var_1_5)))) >= var_1_6) ? (var_1_12 == ((unsigned char) var_1_13)) : 1) : (var_1_12 == ((unsigned char) 0)))) && (((((((- 9.5f)) > ((- var_1_15))) ? ((- 9.5f)) : ((- var_1_15)))) < var_1_16) ? (var_1_14 == ((double) ((((var_1_17) < (var_1_18)) ? (var_1_17) : (var_1_18))))) : 1)) && ((var_1_13 && var_1_2) ? ((var_1_4 > (256u * var_1_8)) ? (var_1_19 == ((unsigned char) ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21))))) : (var_1_19 == ((unsigned char) var_1_20))) : 1)) && (((-2 / var_1_23) >= (var_1_11 & var_1_4)) ? ((var_1_21 >= (var_1_19 + var_1_5)) ? (((~ var_1_10) > var_1_20) ? (var_1_12 ? (var_1_22 == ((unsigned char) var_1_24)) : (var_1_22 == ((unsigned char) var_1_13))) : (var_1_22 == ((unsigned char) var_1_13))) : (var_1_22 == ((unsigned char) var_1_13))) : (var_1_22 == ((unsigned char) var_1_13))) VAL [isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=2, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=2147483391, var_1_20=-256, var_1_21=256, var_1_22=1, var_1_23=1, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=100, var_1_9=65536] [L144-L145] return (((((var_1_2 ? (var_1_1 == ((unsigned long int) (((((var_1_3) > ((var_1_4 + var_1_5))) ? (var_1_3) : ((var_1_4 + var_1_5)))) - (((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7))) + 256u)))) : 1) && (var_1_8 == ((unsigned short int) ((((25) > ((((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) + (100 + var_1_11)))) ? (25) : ((((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) + (100 + var_1_11)))))))) && ((! var_1_2) ? (((var_1_1 * ((((var_1_8) < (var_1_5)) ? (var_1_8) : (var_1_5)))) >= var_1_6) ? (var_1_12 == ((unsigned char) var_1_13)) : 1) : (var_1_12 == ((unsigned char) 0)))) && (((((((- 9.5f)) > ((- var_1_15))) ? ((- 9.5f)) : ((- var_1_15)))) < var_1_16) ? (var_1_14 == ((double) ((((var_1_17) < (var_1_18)) ? (var_1_17) : (var_1_18))))) : 1)) && ((var_1_13 && var_1_2) ? ((var_1_4 > (256u * var_1_8)) ? (var_1_19 == ((unsigned char) ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21))))) : (var_1_19 == ((unsigned char) var_1_20))) : 1)) && (((-2 / var_1_23) >= (var_1_11 & var_1_4)) ? ((var_1_21 >= (var_1_19 + var_1_5)) ? (((~ var_1_10) > var_1_20) ? (var_1_12 ? (var_1_22 == ((unsigned char) var_1_24)) : (var_1_22 == ((unsigned char) var_1_13))) : (var_1_22 == ((unsigned char) var_1_13))) : (var_1_22 == ((unsigned char) var_1_13))) : (var_1_22 == ((unsigned char) var_1_13))) ; [L154] RET, EXPR property() [L154] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=2, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=2147483391, var_1_20=-256, var_1_21=256, var_1_22=1, var_1_23=1, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=100, var_1_9=65536] [L19] reach_error() VAL [isInitial=1, var_1_10=-65536, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=2, var_1_17=2, var_1_18=0, var_1_19=0, var_1_1=2147483391, var_1_20=-256, var_1_21=256, var_1_22=1, var_1_23=1, var_1_24=0, var_1_2=1, var_1_3=2147483647, var_1_4=-3221225473, var_1_5=5368709120, var_1_6=0, var_1_7=0, var_1_8=100, var_1_9=65536] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.2s, OverallIterations: 4, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 188 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 170 mSDsluCounter, 625 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 278 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 279 IncrementalHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 347 mSDtfsCounter, 279 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 646 GetRequests, 634 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=3, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 23 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1212 NumberOfCodeBlocks, 1212 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 1003 ConstructedInterpolants, 0 QuantifiedInterpolants, 1695 SizeOfPredicates, 1 NumberOfNonLiveVariables, 426 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 10434/10560 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-12 01:15:25,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_codestructure_normal_file-49.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 02fd9ca01e9b4cf3bb802fdecc600f36b127dae39ec959fa79aabe6d1e914ff2 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 01:15:27,920 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 01:15:27,981 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 01:15:27,985 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 01:15:27,985 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 01:15:28,003 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 01:15:28,003 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 01:15:28,004 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 01:15:28,004 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 01:15:28,004 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 01:15:28,004 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 01:15:28,005 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 01:15:28,005 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 01:15:28,008 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 01:15:28,008 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 01:15:28,008 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 01:15:28,009 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 01:15:28,009 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 01:15:28,009 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 01:15:28,009 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 01:15:28,009 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 01:15:28,010 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 01:15:28,011 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 01:15:28,011 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 01:15:28,011 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 01:15:28,011 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 01:15:28,011 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 01:15:28,011 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 01:15:28,012 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 01:15:28,012 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 01:15:28,012 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 01:15:28,013 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 01:15:28,014 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 01:15:28,014 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 01:15:28,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:15:28,023 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 01:15:28,024 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 01:15:28,024 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 01:15:28,024 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 01:15:28,024 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 01:15:28,024 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 01:15:28,025 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 01:15:28,025 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 01:15:28,025 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 01:15:28,025 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 -> 02fd9ca01e9b4cf3bb802fdecc600f36b127dae39ec959fa79aabe6d1e914ff2 [2024-11-12 01:15:28,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 01:15:28,308 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 01:15:28,310 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 01:15:28,314 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 01:15:28,314 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 01:15:28,316 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-49.i [2024-11-12 01:15:29,849 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 01:15:30,109 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 01:15:30,113 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-49.i [2024-11-12 01:15:30,122 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7069b6960/965e480cf6c248fda74456ec341f6e08/FLAG5ec8219b5 [2024-11-12 01:15:30,134 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7069b6960/965e480cf6c248fda74456ec341f6e08 [2024-11-12 01:15:30,136 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 01:15:30,138 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 01:15:30,144 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 01:15:30,144 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 01:15:30,151 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 01:15:30,152 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:15:30" (1/1) ... [2024-11-12 01:15:30,153 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30f947f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:30, skipping insertion in model container [2024-11-12 01:15:30,156 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:15:30" (1/1) ... [2024-11-12 01:15:30,187 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 01:15:30,423 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-49.i[913,926] [2024-11-12 01:15:30,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:15:30,529 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 01:15:30,544 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-49.i[913,926] [2024-11-12 01:15:30,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:15:30,622 INFO L204 MainTranslator]: Completed translation [2024-11-12 01:15:30,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:30 WrapperNode [2024-11-12 01:15:30,623 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 01:15:30,624 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 01:15:30,624 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 01:15:30,624 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 01:15:30,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:30" (1/1) ... [2024-11-12 01:15:30,638 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:30" (1/1) ... [2024-11-12 01:15:30,666 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 167 [2024-11-12 01:15:30,666 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 01:15:30,666 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 01:15:30,667 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 01:15:30,667 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 01:15:30,677 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:30" (1/1) ... [2024-11-12 01:15:30,677 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:30" (1/1) ... [2024-11-12 01:15:30,682 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:30" (1/1) ... [2024-11-12 01:15:30,698 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-12 01:15:30,699 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:30" (1/1) ... [2024-11-12 01:15:30,699 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:30" (1/1) ... [2024-11-12 01:15:30,712 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:30" (1/1) ... [2024-11-12 01:15:30,718 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:30" (1/1) ... [2024-11-12 01:15:30,720 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:30" (1/1) ... [2024-11-12 01:15:30,721 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:30" (1/1) ... [2024-11-12 01:15:30,723 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 01:15:30,724 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 01:15:30,724 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 01:15:30,724 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 01:15:30,725 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:30" (1/1) ... [2024-11-12 01:15:30,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:15:30,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:15:30,754 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-12 01:15:30,755 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-12 01:15:30,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 01:15:30,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 01:15:30,785 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 01:15:30,785 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 01:15:30,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 01:15:30,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 01:15:30,848 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 01:15:30,849 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 01:15:31,213 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-12 01:15:31,213 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 01:15:31,232 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 01:15:31,232 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 01:15:31,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:15:31 BoogieIcfgContainer [2024-11-12 01:15:31,233 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 01:15:31,234 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 01:15:31,234 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 01:15:31,237 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 01:15:31,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:15:30" (1/3) ... [2024-11-12 01:15:31,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31bd6fdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:15:31, skipping insertion in model container [2024-11-12 01:15:31,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:15:30" (2/3) ... [2024-11-12 01:15:31,240 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31bd6fdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:15:31, skipping insertion in model container [2024-11-12 01:15:31,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:15:31" (3/3) ... [2024-11-12 01:15:31,242 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-49.i [2024-11-12 01:15:31,254 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 01:15:31,254 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 01:15:31,360 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 01:15:31,375 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;@5183edea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 01:15:31,375 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 01:15:31,384 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 46 states have internal predecessors, (60), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-12 01:15:31,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-12 01:15:31,409 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:15:31,410 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:15:31,411 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:15:31,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:15:31,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1197463362, now seen corresponding path program 1 times [2024-11-12 01:15:31,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:15:31,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [40726715] [2024-11-12 01:15:31,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:15:31,447 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-12 01:15:31,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:15:31,449 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-12 01:15:31,450 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-12 01:15:31,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:31,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 01:15:31,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:15:31,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 764 proven. 0 refuted. 0 times theorem prover too weak. 1348 trivial. 0 not checked. [2024-11-12 01:15:31,793 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 01:15:31,793 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 01:15:31,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [40726715] [2024-11-12 01:15:31,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [40726715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:15:31,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:15:31,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 01:15:31,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727481619] [2024-11-12 01:15:31,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:15:31,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 01:15:31,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 01:15:31,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 01:15:31,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:15:31,821 INFO L87 Difference]: Start difference. First operand has 81 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 46 states have internal predecessors, (60), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-12 01:15:31,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:15:31,842 INFO L93 Difference]: Finished difference Result 154 states and 277 transitions. [2024-11-12 01:15:31,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 01:15:31,845 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 198 [2024-11-12 01:15:31,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:15:31,850 INFO L225 Difference]: With dead ends: 154 [2024-11-12 01:15:31,851 INFO L226 Difference]: Without dead ends: 76 [2024-11-12 01:15:31,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 197 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-12 01:15:31,856 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 01:15:31,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 01:15:31,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-12 01:15:31,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-12 01:15:31,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 41 states have internal predecessors, (50), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-12 01:15:31,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 116 transitions. [2024-11-12 01:15:31,894 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 116 transitions. Word has length 198 [2024-11-12 01:15:31,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:15:31,895 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 116 transitions. [2024-11-12 01:15:31,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-12 01:15:31,895 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 116 transitions. [2024-11-12 01:15:31,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-12 01:15:31,898 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:15:31,899 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:15:31,914 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-12 01:15:32,100 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-12 01:15:32,101 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:15:32,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:15:32,102 INFO L85 PathProgramCache]: Analyzing trace with hash 420681676, now seen corresponding path program 1 times [2024-11-12 01:15:32,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:15:32,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1021804732] [2024-11-12 01:15:32,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:15:32,103 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-12 01:15:32,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:15:32,107 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-12 01:15:32,108 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-12 01:15:32,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:32,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 01:15:32,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:15:32,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1076 proven. 42 refuted. 0 times theorem prover too weak. 994 trivial. 0 not checked. [2024-11-12 01:15:32,703 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 01:15:33,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 54 proven. 42 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-11-12 01:15:33,024 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 01:15:33,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1021804732] [2024-11-12 01:15:33,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1021804732] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 01:15:33,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 01:15:33,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-12 01:15:33,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855099287] [2024-11-12 01:15:33,024 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 01:15:33,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 01:15:33,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 01:15:33,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 01:15:33,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-12 01:15:33,027 INFO L87 Difference]: Start difference. First operand 76 states and 116 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2024-11-12 01:15:33,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:15:33,763 INFO L93 Difference]: Finished difference Result 170 states and 254 transitions. [2024-11-12 01:15:33,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 01:15:33,763 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) Word has length 198 [2024-11-12 01:15:33,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:15:33,766 INFO L225 Difference]: With dead ends: 170 [2024-11-12 01:15:33,766 INFO L226 Difference]: Without dead ends: 97 [2024-11-12 01:15:33,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 387 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2024-11-12 01:15:33,778 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 179 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 01:15:33,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 190 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 01:15:33,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-12 01:15:33,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 84. [2024-11-12 01:15:33,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 48 states have internal predecessors, (58), 33 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-12 01:15:33,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 124 transitions. [2024-11-12 01:15:33,811 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 124 transitions. Word has length 198 [2024-11-12 01:15:33,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:15:33,812 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 124 transitions. [2024-11-12 01:15:33,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2024-11-12 01:15:33,813 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 124 transitions. [2024-11-12 01:15:33,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-12 01:15:33,821 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:15:33,821 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:15:33,859 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-12 01:15:34,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 01:15:34,022 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:15:34,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:15:34,026 INFO L85 PathProgramCache]: Analyzing trace with hash 813980400, now seen corresponding path program 1 times [2024-11-12 01:15:34,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:15:34,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [310907056] [2024-11-12 01:15:34,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:15:34,027 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-12 01:15:34,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:15:34,030 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 01:15:34,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 01:15:34,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:15:34,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-12 01:15:34,241 INFO L279 TraceCheckSpWp]: Computing forward predicates...