./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-35.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-35.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 8f396e758b8a155477a6287a4e84cc28d26a53a2a5a132d030171d91e6da2d2b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:09:49,024 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:09:49,144 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 12:09:49,150 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:09:49,151 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:09:49,175 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:09:49,176 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:09:49,176 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:09:49,177 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:09:49,177 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:09:49,178 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:09:49,178 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:09:49,179 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:09:49,180 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:09:49,180 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:09:49,180 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:09:49,183 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:09:49,183 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:09:49,183 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 12:09:49,184 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:09:49,184 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:09:49,188 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:09:49,189 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:09:49,189 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:09:49,189 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:09:49,190 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:09:49,190 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:09:49,190 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:09:49,190 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:09:49,191 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:09:49,191 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:09:49,195 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:09:49,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:09:49,195 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:09:49,196 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:09:49,196 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:09:49,196 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 12:09:49,196 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 12:09:49,197 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:09:49,197 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:09:49,197 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:09:49,199 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:09:49,199 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-clean/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-clean/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 -> 8f396e758b8a155477a6287a4e84cc28d26a53a2a5a132d030171d91e6da2d2b [2024-10-11 12:09:49,483 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:09:49,519 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:09:49,523 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:09:49,525 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:09:49,526 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:09:49,527 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-35.i [2024-10-11 12:09:51,142 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:09:51,400 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:09:51,404 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-35.i [2024-10-11 12:09:51,420 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2b5550d84/6a2176eb70d44701978ec0b3925ad335/FLAG2a0aa459d [2024-10-11 12:09:51,438 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2b5550d84/6a2176eb70d44701978ec0b3925ad335 [2024-10-11 12:09:51,440 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:09:51,442 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:09:51,444 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:09:51,444 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:09:51,450 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:09:51,450 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:09:51" (1/1) ... [2024-10-11 12:09:51,451 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f0bd4bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:09:51, skipping insertion in model container [2024-10-11 12:09:51,452 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:09:51" (1/1) ... [2024-10-11 12:09:51,492 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:09:51,683 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-35.i[916,929] [2024-10-11 12:09:51,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:09:51,793 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:09:51,805 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-35.i[916,929] [2024-10-11 12:09:51,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:09:51,890 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:09:51,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:09:51 WrapperNode [2024-10-11 12:09:51,892 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:09:51,894 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:09:51,894 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:09:51,894 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:09:51,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:09:51" (1/1) ... [2024-10-11 12:09:51,917 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:09:51" (1/1) ... [2024-10-11 12:09:51,968 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 248 [2024-10-11 12:09:51,968 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:09:51,969 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:09:51,969 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:09:51,969 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:09:51,990 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:09:51" (1/1) ... [2024-10-11 12:09:51,990 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:09:51" (1/1) ... [2024-10-11 12:09:52,001 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:09:51" (1/1) ... [2024-10-11 12:09:52,043 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 12:09:52,044 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:09:51" (1/1) ... [2024-10-11 12:09:52,044 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:09:51" (1/1) ... [2024-10-11 12:09:52,074 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:09:51" (1/1) ... [2024-10-11 12:09:52,079 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:09:51" (1/1) ... [2024-10-11 12:09:52,095 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:09:51" (1/1) ... [2024-10-11 12:09:52,101 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:09:51" (1/1) ... [2024-10-11 12:09:52,111 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:09:52,113 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:09:52,113 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:09:52,113 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:09:52,115 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:09:51" (1/1) ... [2024-10-11 12:09:52,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:09:52,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:09:52,160 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:09:52,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:09:52,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:09:52,223 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:09:52,225 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:09:52,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 12:09:52,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:09:52,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:09:52,333 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:09:52,336 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:09:53,069 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-10-11 12:09:53,069 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:09:53,135 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:09:53,136 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:09:53,136 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:09:53 BoogieIcfgContainer [2024-10-11 12:09:53,137 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:09:53,140 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:09:53,141 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:09:53,145 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:09:53,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:09:51" (1/3) ... [2024-10-11 12:09:53,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65196cda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:09:53, skipping insertion in model container [2024-10-11 12:09:53,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:09:51" (2/3) ... [2024-10-11 12:09:53,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65196cda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:09:53, skipping insertion in model container [2024-10-11 12:09:53,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:09:53" (3/3) ... [2024-10-11 12:09:53,151 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-35.i [2024-10-11 12:09:53,175 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:09:53,175 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:09:53,248 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:09:53,256 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;@3af949fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:09:53,256 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:09:53,262 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 70 states have (on average 1.5142857142857142) internal successors, (106), 71 states have internal predecessors, (106), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 12:09:53,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-11 12:09:53,281 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:09:53,282 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:09:53,283 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:09:53,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:09:53,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1495877949, now seen corresponding path program 1 times [2024-10-11 12:09:53,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:09:53,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673511502] [2024-10-11 12:09:53,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:09:53,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:09:53,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:09:53,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:09:53,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:09:53,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:09:53,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:09:53,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:09:53,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:09:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:09:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:09:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:09:53,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 12:09:53,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:09:53,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:09:53,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:09:53,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:09:53,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:09:53,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 12:09:53,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:09:53,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 12:09:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 12:09:53,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 12:09:53,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 12:09:53,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 12:09:53,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 12:09:53,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 12:09:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 12:09:53,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:53,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 12:09:53,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:09:53,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673511502] [2024-10-11 12:09:53,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673511502] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:09:53,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:09:53,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:09:53,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955422015] [2024-10-11 12:09:53,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:09:53,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:09:53,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:09:53,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:09:53,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:09:54,001 INFO L87 Difference]: Start difference. First operand has 99 states, 70 states have (on average 1.5142857142857142) internal successors, (106), 71 states have internal predecessors, (106), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 12:09:54,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:09:54,063 INFO L93 Difference]: Finished difference Result 195 states and 340 transitions. [2024-10-11 12:09:54,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:09:54,074 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 169 [2024-10-11 12:09:54,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:09:54,085 INFO L225 Difference]: With dead ends: 195 [2024-10-11 12:09:54,085 INFO L226 Difference]: Without dead ends: 97 [2024-10-11 12:09:54,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:09:54,096 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:09:54,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:09:54,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-11 12:09:54,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-10-11 12:09:54,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.4492753623188406) internal successors, (100), 69 states have internal predecessors, (100), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 12:09:54,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 152 transitions. [2024-10-11 12:09:54,150 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 152 transitions. Word has length 169 [2024-10-11 12:09:54,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:09:54,151 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 152 transitions. [2024-10-11 12:09:54,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 12:09:54,152 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 152 transitions. [2024-10-11 12:09:54,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-11 12:09:54,156 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:09:54,157 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:09:54,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 12:09:54,157 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:09:54,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:09:54,158 INFO L85 PathProgramCache]: Analyzing trace with hash 75444605, now seen corresponding path program 1 times [2024-10-11 12:09:54,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:09:54,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532832481] [2024-10-11 12:09:54,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:09:54,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:09:54,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:54,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:09:54,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:54,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:09:54,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:54,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:09:54,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:54,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:09:54,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:54,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:09:54,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:54,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:09:54,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:54,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:09:54,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:54,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:09:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:54,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:09:54,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:54,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:09:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:54,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 12:09:54,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:54,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:09:54,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:54,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:09:54,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:54,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:09:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:54,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:09:54,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:54,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:09:54,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:54,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 12:09:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:54,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:09:54,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:54,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 12:09:54,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:54,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 12:09:54,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:54,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 12:09:54,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:54,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 12:09:54,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:54,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 12:09:54,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:54,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 12:09:54,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:54,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 12:09:54,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:54,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 12:09:54,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:54,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 12:09:54,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:09:54,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532832481] [2024-10-11 12:09:54,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532832481] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:09:54,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:09:54,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 12:09:54,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015473620] [2024-10-11 12:09:54,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:09:54,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 12:09:54,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:09:54,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 12:09:54,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 12:09:54,625 INFO L87 Difference]: Start difference. First operand 97 states and 152 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 12:09:54,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:09:54,767 INFO L93 Difference]: Finished difference Result 241 states and 374 transitions. [2024-10-11 12:09:54,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 12:09:54,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 169 [2024-10-11 12:09:54,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:09:54,775 INFO L225 Difference]: With dead ends: 241 [2024-10-11 12:09:54,775 INFO L226 Difference]: Without dead ends: 145 [2024-10-11 12:09:54,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 12:09:54,781 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 64 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 12:09:54,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 266 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 12:09:54,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-10-11 12:09:54,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 142. [2024-10-11 12:09:54,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 111 states have (on average 1.4504504504504505) internal successors, (161), 112 states have internal predecessors, (161), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 12:09:54,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 217 transitions. [2024-10-11 12:09:54,806 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 217 transitions. Word has length 169 [2024-10-11 12:09:54,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:09:54,807 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 217 transitions. [2024-10-11 12:09:54,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 12:09:54,807 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 217 transitions. [2024-10-11 12:09:54,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-11 12:09:54,813 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:09:54,813 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:09:54,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 12:09:54,814 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:09:54,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:09:54,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1484017534, now seen corresponding path program 1 times [2024-10-11 12:09:54,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:09:54,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367020248] [2024-10-11 12:09:54,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:09:54,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:09:54,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:55,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:09:55,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:55,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:09:55,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:55,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:09:55,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:55,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:09:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:55,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:09:55,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:55,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:09:55,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:55,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:09:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:55,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:09:55,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:55,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:09:55,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:55,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:09:55,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:55,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 12:09:55,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:55,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:09:55,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:55,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:09:55,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:55,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:09:55,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:55,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:09:55,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:55,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:09:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:55,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 12:09:55,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:55,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:09:55,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:55,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 12:09:55,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:55,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 12:09:55,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:55,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 12:09:55,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:55,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 12:09:55,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:55,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 12:09:55,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:55,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 12:09:55,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:55,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 12:09:55,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:56,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 12:09:56,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:56,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 12:09:56,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:09:56,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367020248] [2024-10-11 12:09:56,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367020248] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:09:56,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:09:56,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 12:09:56,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781563373] [2024-10-11 12:09:56,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:09:56,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 12:09:56,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:09:56,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 12:09:56,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 12:09:56,015 INFO L87 Difference]: Start difference. First operand 142 states and 217 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 12:09:56,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:09:56,377 INFO L93 Difference]: Finished difference Result 423 states and 646 transitions. [2024-10-11 12:09:56,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 12:09:56,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 170 [2024-10-11 12:09:56,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:09:56,389 INFO L225 Difference]: With dead ends: 423 [2024-10-11 12:09:56,390 INFO L226 Difference]: Without dead ends: 282 [2024-10-11 12:09:56,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 12:09:56,396 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 127 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 12:09:56,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 564 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 12:09:56,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-10-11 12:09:56,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 246. [2024-10-11 12:09:56,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 187 states have (on average 1.4438502673796791) internal successors, (270), 188 states have internal predecessors, (270), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-11 12:09:56,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 378 transitions. [2024-10-11 12:09:56,462 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 378 transitions. Word has length 170 [2024-10-11 12:09:56,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:09:56,465 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 378 transitions. [2024-10-11 12:09:56,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 12:09:56,466 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 378 transitions. [2024-10-11 12:09:56,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-11 12:09:56,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:09:56,472 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:09:56,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 12:09:56,473 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:09:56,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:09:56,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1449698715, now seen corresponding path program 1 times [2024-10-11 12:09:56,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:09:56,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832927449] [2024-10-11 12:09:56,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:09:56,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:09:56,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:57,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:09:57,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:57,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:09:57,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:57,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:09:57,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:57,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:09:57,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:57,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:09:57,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:57,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:09:57,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:57,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:09:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:57,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:09:57,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:57,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:09:57,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:57,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:09:57,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:57,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 12:09:57,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:57,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:09:57,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:57,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:09:57,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:57,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:09:57,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:57,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:09:57,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:57,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:09:57,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:57,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 12:09:57,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:57,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:09:57,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:57,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 12:09:57,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:57,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 12:09:57,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:57,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 12:09:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:57,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 12:09:57,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:57,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 12:09:57,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:57,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 12:09:57,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:57,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 12:09:57,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:57,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 12:09:57,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:57,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 12:09:57,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:09:57,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832927449] [2024-10-11 12:09:57,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832927449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:09:57,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:09:57,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 12:09:57,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214434138] [2024-10-11 12:09:57,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:09:57,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 12:09:57,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:09:57,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 12:09:57,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:09:57,223 INFO L87 Difference]: Start difference. First operand 246 states and 378 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 12:09:57,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:09:57,522 INFO L93 Difference]: Finished difference Result 583 states and 893 transitions. [2024-10-11 12:09:57,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 12:09:57,523 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 170 [2024-10-11 12:09:57,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:09:57,528 INFO L225 Difference]: With dead ends: 583 [2024-10-11 12:09:57,529 INFO L226 Difference]: Without dead ends: 401 [2024-10-11 12:09:57,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 12:09:57,535 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 171 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 12:09:57,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 467 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 12:09:57,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-10-11 12:09:57,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 354. [2024-10-11 12:09:57,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 267 states have (on average 1.4194756554307115) internal successors, (379), 268 states have internal predecessors, (379), 80 states have call successors, (80), 6 states have call predecessors, (80), 6 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-11 12:09:57,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 539 transitions. [2024-10-11 12:09:57,644 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 539 transitions. Word has length 170 [2024-10-11 12:09:57,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:09:57,646 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 539 transitions. [2024-10-11 12:09:57,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 12:09:57,647 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 539 transitions. [2024-10-11 12:09:57,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-11 12:09:57,653 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:09:57,654 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:09:57,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 12:09:57,654 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:09:57,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:09:57,655 INFO L85 PathProgramCache]: Analyzing trace with hash -138649187, now seen corresponding path program 1 times [2024-10-11 12:09:57,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:09:57,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585773313] [2024-10-11 12:09:57,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:09:57,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:09:57,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:58,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:09:58,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:58,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:09:58,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:58,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:09:58,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:58,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:09:58,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:58,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:09:58,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:58,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:09:58,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:58,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:09:58,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:58,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:09:58,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:58,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:09:58,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:58,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:09:58,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:58,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 12:09:58,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:58,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 12:09:58,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:58,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 12:09:58,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:58,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 12:09:58,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:58,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 12:09:58,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:58,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 12:09:58,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:58,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 12:09:58,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:58,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 12:09:58,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:58,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 12:09:58,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:58,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 12:09:58,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:58,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 12:09:58,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:58,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 12:09:58,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:58,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 12:09:58,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:58,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 12:09:58,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:58,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 12:09:58,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:58,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 12:09:58,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:09:58,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 12:09:58,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:09:58,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585773313] [2024-10-11 12:09:58,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585773313] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:09:58,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:09:58,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 12:09:58,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981224338] [2024-10-11 12:09:58,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:09:58,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 12:09:58,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:09:58,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 12:09:58,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 12:09:58,561 INFO L87 Difference]: Start difference. First operand 354 states and 539 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 12:09:59,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:09:59,088 INFO L93 Difference]: Finished difference Result 699 states and 1061 transitions. [2024-10-11 12:09:59,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 12:09:59,089 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 170 [2024-10-11 12:09:59,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:09:59,095 INFO L225 Difference]: With dead ends: 699 [2024-10-11 12:09:59,096 INFO L226 Difference]: Without dead ends: 409 [2024-10-11 12:09:59,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 12:09:59,099 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 131 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 12:09:59,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 589 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 12:09:59,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2024-10-11 12:09:59,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 357. [2024-10-11 12:09:59,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 270 states have (on average 1.4148148148148147) internal successors, (382), 271 states have internal predecessors, (382), 80 states have call successors, (80), 6 states have call predecessors, (80), 6 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-11 12:09:59,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 542 transitions. [2024-10-11 12:09:59,167 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 542 transitions. Word has length 170 [2024-10-11 12:09:59,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:09:59,170 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 542 transitions. [2024-10-11 12:09:59,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 12:09:59,173 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 542 transitions. [2024-10-11 12:09:59,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 12:09:59,174 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:09:59,175 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:09:59,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 12:09:59,175 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:09:59,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:09:59,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1469185430, now seen corresponding path program 1 times [2024-10-11 12:09:59,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:09:59,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776947680] [2024-10-11 12:09:59,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:09:59,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:09:59,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 12:09:59,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1223157471] [2024-10-11 12:09:59,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:09:59,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:09:59,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:09:59,349 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 12:09:59,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 12:09:59,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:09:59,714 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 12:09:59,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:09:59,916 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 12:09:59,917 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 12:09:59,921 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 12:09:59,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 12:10:00,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:10:00,129 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-11 12:10:00,296 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 12:10:00,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:10:00 BoogieIcfgContainer [2024-10-11 12:10:00,303 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 12:10:00,305 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 12:10:00,305 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 12:10:00,305 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 12:10:00,306 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:09:53" (3/4) ... [2024-10-11 12:10:00,308 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 12:10:00,312 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 12:10:00,313 INFO L158 Benchmark]: Toolchain (without parser) took 8871.66ms. Allocated memory was 159.4MB in the beginning and 299.9MB in the end (delta: 140.5MB). Free memory was 105.1MB in the beginning and 207.0MB in the end (delta: -101.9MB). Peak memory consumption was 41.7MB. Max. memory is 16.1GB. [2024-10-11 12:10:00,314 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:10:00,314 INFO L158 Benchmark]: CACSL2BoogieTranslator took 449.34ms. Allocated memory is still 159.4MB. Free memory was 104.6MB in the beginning and 86.9MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 12:10:00,314 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.68ms. Allocated memory is still 159.4MB. Free memory was 86.9MB in the beginning and 80.3MB in the end (delta: 6.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 12:10:00,314 INFO L158 Benchmark]: Boogie Preprocessor took 142.54ms. Allocated memory is still 159.4MB. Free memory was 80.3MB in the beginning and 71.5MB in the end (delta: 8.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 12:10:00,315 INFO L158 Benchmark]: RCFGBuilder took 1024.30ms. Allocated memory was 159.4MB in the beginning and 247.5MB in the end (delta: 88.1MB). Free memory was 71.1MB in the beginning and 183.4MB in the end (delta: -112.3MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. [2024-10-11 12:10:00,315 INFO L158 Benchmark]: TraceAbstraction took 7163.28ms. Allocated memory was 247.5MB in the beginning and 299.9MB in the end (delta: 52.4MB). Free memory was 182.4MB in the beginning and 208.1MB in the end (delta: -25.7MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. [2024-10-11 12:10:00,315 INFO L158 Benchmark]: Witness Printer took 8.05ms. Allocated memory is still 299.9MB. Free memory was 208.1MB in the beginning and 207.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 12:10:00,316 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.19ms. Allocated memory is still 159.4MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 449.34ms. Allocated memory is still 159.4MB. Free memory was 104.6MB in the beginning and 86.9MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.68ms. Allocated memory is still 159.4MB. Free memory was 86.9MB in the beginning and 80.3MB in the end (delta: 6.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 142.54ms. Allocated memory is still 159.4MB. Free memory was 80.3MB in the beginning and 71.5MB in the end (delta: 8.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1024.30ms. Allocated memory was 159.4MB in the beginning and 247.5MB in the end (delta: 88.1MB). Free memory was 71.1MB in the beginning and 183.4MB in the end (delta: -112.3MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. * TraceAbstraction took 7163.28ms. Allocated memory was 247.5MB in the beginning and 299.9MB in the end (delta: 52.4MB). Free memory was 182.4MB in the beginning and 208.1MB in the end (delta: -25.7MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. * Witness Printer took 8.05ms. Allocated memory is still 299.9MB. Free memory was 208.1MB in the beginning and 207.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 191, overapproximation of someBinaryDOUBLEComparisonOperation at line 191, overapproximation of someBinaryArithmeticFLOAToperation at line 97. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 32; [L23] signed char var_1_6 = -4; [L24] unsigned short int var_1_7 = 50; [L25] signed short int var_1_9 = 128; [L26] unsigned char var_1_12 = 0; [L27] unsigned char var_1_13 = 0; [L28] unsigned short int var_1_14 = 2; [L29] unsigned short int var_1_15 = 1; [L30] signed long int var_1_17 = 128; [L31] float var_1_18 = 25.75; [L32] unsigned char var_1_20 = 25; [L33] float var_1_21 = 15.125; [L34] unsigned char var_1_22 = 4; [L35] unsigned long int var_1_23 = 2; [L36] unsigned long int var_1_24 = 50; [L37] unsigned long int var_1_25 = 5; [L38] unsigned char var_1_26 = 64; [L39] unsigned char var_1_27 = 128; [L40] float var_1_28 = 10.85; [L41] float var_1_29 = 99999.35; [L42] float var_1_30 = 100.5; [L43] unsigned char var_1_31 = 1; [L44] unsigned char var_1_32 = 0; [L45] unsigned short int var_1_33 = 16; [L46] unsigned short int var_1_34 = 18230; [L47] double var_1_35 = 10.625; [L48] unsigned short int last_1_var_1_7 = 50; [L49] signed short int last_1_var_1_9 = 128; [L50] signed long int last_1_var_1_17 = 128; [L51] unsigned char last_1_var_1_22 = 4; [L52] unsigned long int last_1_var_1_25 = 5; [L53] unsigned char last_1_var_1_26 = 64; [L54] float last_1_var_1_28 = 10.85; [L55] unsigned short int last_1_var_1_33 = 16; [L56] double last_1_var_1_35 = 10.625; [L195] isInitial = 1 [L196] FCALL initially() [L197] COND TRUE 1 [L198] CALL updateLastVariables() [L180] last_1_var_1_7 = var_1_7 [L181] last_1_var_1_9 = var_1_9 [L182] last_1_var_1_17 = var_1_17 [L183] last_1_var_1_22 = var_1_22 [L184] last_1_var_1_25 = var_1_25 [L185] last_1_var_1_26 = var_1_26 [L186] last_1_var_1_28 = var_1_28 [L187] last_1_var_1_33 = var_1_33 [L188] last_1_var_1_35 = var_1_35 [L198] RET updateLastVariables() [L199] CALL updateVariables() [L138] var_1_6 = __VERIFIER_nondet_char() [L139] CALL assume_abort_if_not(var_1_6 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=1, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=25, var_1_21=121/8, var_1_22=4, var_1_23=2, var_1_24=50, var_1_25=5, var_1_26=64, var_1_27=128, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=1, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=25, var_1_21=121/8, var_1_22=4, var_1_23=2, var_1_24=50, var_1_25=5, var_1_26=64, var_1_27=128, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L139] RET assume_abort_if_not(var_1_6 >= -127) VAL [isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=1, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=25, var_1_21=121/8, var_1_22=4, var_1_23=2, var_1_24=50, var_1_25=5, var_1_26=64, var_1_27=128, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L140] CALL assume_abort_if_not(var_1_6 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=1, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=25, var_1_21=121/8, var_1_22=4, var_1_23=2, var_1_24=50, var_1_25=5, var_1_26=64, var_1_27=128, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=1, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=25, var_1_21=121/8, var_1_22=4, var_1_23=2, var_1_24=50, var_1_25=5, var_1_26=64, var_1_27=128, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L140] RET assume_abort_if_not(var_1_6 <= 126) VAL [isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=0, var_1_14=2, var_1_15=1, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=25, var_1_21=121/8, var_1_22=4, var_1_23=2, var_1_24=50, var_1_25=5, var_1_26=64, var_1_27=128, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L141] var_1_13 = __VERIFIER_nondet_uchar() [L142] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_14=2, var_1_15=1, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=25, var_1_21=121/8, var_1_22=4, var_1_23=2, var_1_24=50, var_1_25=5, var_1_26=64, var_1_27=128, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_14=2, var_1_15=1, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=25, var_1_21=121/8, var_1_22=4, var_1_23=2, var_1_24=50, var_1_25=5, var_1_26=64, var_1_27=128, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L142] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_14=2, var_1_15=1, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=25, var_1_21=121/8, var_1_22=4, var_1_23=2, var_1_24=50, var_1_25=5, var_1_26=64, var_1_27=128, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L143] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=2, var_1_15=1, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=25, var_1_21=121/8, var_1_22=4, var_1_23=2, var_1_24=50, var_1_25=5, var_1_26=64, var_1_27=128, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=2, var_1_15=1, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=25, var_1_21=121/8, var_1_22=4, var_1_23=2, var_1_24=50, var_1_25=5, var_1_26=64, var_1_27=128, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L143] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=2, var_1_15=1, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=25, var_1_21=121/8, var_1_22=4, var_1_23=2, var_1_24=50, var_1_25=5, var_1_26=64, var_1_27=128, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L144] var_1_14 = __VERIFIER_nondet_ushort() [L145] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_15=1, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=25, var_1_21=121/8, var_1_22=4, var_1_23=2, var_1_24=50, var_1_25=5, var_1_26=64, var_1_27=128, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_15=1, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=25, var_1_21=121/8, var_1_22=4, var_1_23=2, var_1_24=50, var_1_25=5, var_1_26=64, var_1_27=128, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L145] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_15=1, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=25, var_1_21=121/8, var_1_22=4, var_1_23=2, var_1_24=50, var_1_25=5, var_1_26=64, var_1_27=128, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L146] CALL assume_abort_if_not(var_1_14 <= 9) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=1, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=25, var_1_21=121/8, var_1_22=4, var_1_23=2, var_1_24=50, var_1_25=5, var_1_26=64, var_1_27=128, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=1, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=25, var_1_21=121/8, var_1_22=4, var_1_23=2, var_1_24=50, var_1_25=5, var_1_26=64, var_1_27=128, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L146] RET assume_abort_if_not(var_1_14 <= 9) VAL [isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=1, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=25, var_1_21=121/8, var_1_22=4, var_1_23=2, var_1_24=50, var_1_25=5, var_1_26=64, var_1_27=128, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L147] var_1_15 = __VERIFIER_nondet_ushort() [L148] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=25, var_1_21=121/8, var_1_22=4, var_1_23=2, var_1_24=50, var_1_25=5, var_1_26=64, var_1_27=128, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=25, var_1_21=121/8, var_1_22=4, var_1_23=2, var_1_24=50, var_1_25=5, var_1_26=64, var_1_27=128, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L148] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=25, var_1_21=121/8, var_1_22=4, var_1_23=2, var_1_24=50, var_1_25=5, var_1_26=64, var_1_27=128, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L149] CALL assume_abort_if_not(var_1_15 <= 8) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=25, var_1_21=121/8, var_1_22=4, var_1_23=2, var_1_24=50, var_1_25=5, var_1_26=64, var_1_27=128, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=25, var_1_21=121/8, var_1_22=4, var_1_23=2, var_1_24=50, var_1_25=5, var_1_26=64, var_1_27=128, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L149] RET assume_abort_if_not(var_1_15 <= 8) VAL [isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=25, var_1_21=121/8, var_1_22=4, var_1_23=2, var_1_24=50, var_1_25=5, var_1_26=64, var_1_27=128, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L150] var_1_20 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_21=121/8, var_1_22=4, var_1_23=2, var_1_24=50, var_1_25=5, var_1_26=64, var_1_27=128, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_21=121/8, var_1_22=4, var_1_23=2, var_1_24=50, var_1_25=5, var_1_26=64, var_1_27=128, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L151] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_21=121/8, var_1_22=4, var_1_23=2, var_1_24=50, var_1_25=5, var_1_26=64, var_1_27=128, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L152] CALL assume_abort_if_not(var_1_20 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_21=121/8, var_1_22=4, var_1_23=2, var_1_24=50, var_1_25=5, var_1_26=64, var_1_27=128, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_21=121/8, var_1_22=4, var_1_23=2, var_1_24=50, var_1_25=5, var_1_26=64, var_1_27=128, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L152] RET assume_abort_if_not(var_1_20 <= 255) VAL [isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_21=121/8, var_1_22=4, var_1_23=2, var_1_24=50, var_1_25=5, var_1_26=64, var_1_27=128, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L153] CALL assume_abort_if_not(var_1_20 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=255, var_1_21=121/8, var_1_22=4, var_1_23=2, var_1_24=50, var_1_25=5, var_1_26=64, var_1_27=128, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=255, var_1_21=121/8, var_1_22=4, var_1_23=2, var_1_24=50, var_1_25=5, var_1_26=64, var_1_27=128, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L153] RET assume_abort_if_not(var_1_20 != 0) VAL [isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=255, var_1_21=121/8, var_1_22=4, var_1_23=2, var_1_24=50, var_1_25=5, var_1_26=64, var_1_27=128, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L154] var_1_21 = __VERIFIER_nondet_float() [L155] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=255, var_1_22=4, var_1_23=2, var_1_24=50, var_1_25=5, var_1_26=64, var_1_27=128, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=255, var_1_22=4, var_1_23=2, var_1_24=50, var_1_25=5, var_1_26=64, var_1_27=128, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L155] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=255, var_1_22=4, var_1_23=2, var_1_24=50, var_1_25=5, var_1_26=64, var_1_27=128, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L156] var_1_23 = __VERIFIER_nondet_ulong() [L157] CALL assume_abort_if_not(var_1_23 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=255, var_1_22=4, var_1_23=-4294967041, var_1_24=50, var_1_25=5, var_1_26=64, var_1_27=128, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=255, var_1_22=4, var_1_23=-4294967041, var_1_24=50, var_1_25=5, var_1_26=64, var_1_27=128, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L157] RET assume_abort_if_not(var_1_23 >= 1) VAL [isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=255, var_1_22=4, var_1_23=-4294967041, var_1_24=50, var_1_25=5, var_1_26=64, var_1_27=128, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L158] CALL assume_abort_if_not(var_1_23 <= 2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=255, var_1_22=4, var_1_23=-4294967041, var_1_24=50, var_1_25=5, var_1_26=64, var_1_27=128, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=255, var_1_22=4, var_1_23=-4294967041, var_1_24=50, var_1_25=5, var_1_26=64, var_1_27=128, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L158] RET assume_abort_if_not(var_1_23 <= 2147483648) VAL [isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=255, var_1_22=4, var_1_23=-4294967041, var_1_24=50, var_1_25=5, var_1_26=64, var_1_27=128, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L159] var_1_24 = __VERIFIER_nondet_ulong() [L160] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=255, var_1_22=4, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=64, var_1_27=128, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=255, var_1_22=4, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=64, var_1_27=128, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L160] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=255, var_1_22=4, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=64, var_1_27=128, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L161] CALL assume_abort_if_not(var_1_24 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=255, var_1_22=4, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=64, var_1_27=128, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=255, var_1_22=4, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=64, var_1_27=128, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L161] RET assume_abort_if_not(var_1_24 <= 2147483647) VAL [isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=255, var_1_22=4, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=64, var_1_27=128, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L162] var_1_27 = __VERIFIER_nondet_uchar() [L163] CALL assume_abort_if_not(var_1_27 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=255, var_1_22=4, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=64, var_1_27=127, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=255, var_1_22=4, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=64, var_1_27=127, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L163] RET assume_abort_if_not(var_1_27 >= 127) VAL [isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=255, var_1_22=4, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=64, var_1_27=127, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L164] CALL assume_abort_if_not(var_1_27 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=255, var_1_22=4, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=64, var_1_27=127, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=255, var_1_22=4, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=64, var_1_27=127, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L164] RET assume_abort_if_not(var_1_27 <= 254) VAL [isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=255, var_1_22=4, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=64, var_1_27=127, var_1_28=217/20, var_1_29=1999987/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L165] var_1_29 = __VERIFIER_nondet_float() [L166] CALL assume_abort_if_not((var_1_29 >= -461168.6018427382800e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 4611686.018427382800e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=255, var_1_22=4, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=64, var_1_27=127, var_1_28=217/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=255, var_1_22=4, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=64, var_1_27=127, var_1_28=217/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L166] RET assume_abort_if_not((var_1_29 >= -461168.6018427382800e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 4611686.018427382800e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=255, var_1_22=4, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=64, var_1_27=127, var_1_28=217/20, var_1_30=201/2, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L167] var_1_30 = __VERIFIER_nondet_float() [L168] CALL assume_abort_if_not((var_1_30 >= -461168.6018427382800e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 4611686.018427382800e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=255, var_1_22=4, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=64, var_1_27=127, var_1_28=217/20, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=255, var_1_22=4, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=64, var_1_27=127, var_1_28=217/20, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L168] RET assume_abort_if_not((var_1_30 >= -461168.6018427382800e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 4611686.018427382800e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=255, var_1_22=4, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=64, var_1_27=127, var_1_28=217/20, var_1_31=1, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L169] var_1_31 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=255, var_1_22=4, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=64, var_1_27=127, var_1_28=217/20, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=255, var_1_22=4, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=64, var_1_27=127, var_1_28=217/20, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L170] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=255, var_1_22=4, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=64, var_1_27=127, var_1_28=217/20, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L171] CALL assume_abort_if_not(var_1_31 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=255, var_1_22=4, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=64, var_1_27=127, var_1_28=217/20, var_1_31=-255, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=255, var_1_22=4, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=64, var_1_27=127, var_1_28=217/20, var_1_31=-255, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L171] RET assume_abort_if_not(var_1_31 <= 1) VAL [isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=255, var_1_22=4, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=64, var_1_27=127, var_1_28=217/20, var_1_31=-255, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L172] var_1_32 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=255, var_1_22=4, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=64, var_1_27=127, var_1_28=217/20, var_1_31=-255, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=255, var_1_22=4, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=64, var_1_27=127, var_1_28=217/20, var_1_31=-255, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L173] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=255, var_1_22=4, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=64, var_1_27=127, var_1_28=217/20, var_1_31=-255, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L174] CALL assume_abort_if_not(var_1_32 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=255, var_1_22=4, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=64, var_1_27=127, var_1_28=217/20, var_1_31=-255, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=255, var_1_22=4, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=64, var_1_27=127, var_1_28=217/20, var_1_31=-255, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L174] RET assume_abort_if_not(var_1_32 <= 1) VAL [isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=255, var_1_22=4, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=64, var_1_27=127, var_1_28=217/20, var_1_31=-255, var_1_32=0, var_1_33=16, var_1_34=18230, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L175] var_1_34 = __VERIFIER_nondet_ushort() [L176] CALL assume_abort_if_not(var_1_34 >= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=255, var_1_22=4, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=64, var_1_27=127, var_1_28=217/20, var_1_31=-255, var_1_32=0, var_1_33=16, var_1_34=28847, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=255, var_1_22=4, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=64, var_1_27=127, var_1_28=217/20, var_1_31=-255, var_1_32=0, var_1_33=16, var_1_34=28847, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L176] RET assume_abort_if_not(var_1_34 >= 16384) VAL [isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=255, var_1_22=4, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=64, var_1_27=127, var_1_28=217/20, var_1_31=-255, var_1_32=0, var_1_33=16, var_1_34=28847, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L177] CALL assume_abort_if_not(var_1_34 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=255, var_1_22=4, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=64, var_1_27=127, var_1_28=217/20, var_1_31=-255, var_1_32=0, var_1_33=16, var_1_34=28847, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=255, var_1_22=4, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=64, var_1_27=127, var_1_28=217/20, var_1_31=-255, var_1_32=0, var_1_33=16, var_1_34=28847, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L177] RET assume_abort_if_not(var_1_34 <= 32767) VAL [isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=32, var_1_20=255, var_1_22=4, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=64, var_1_27=127, var_1_28=217/20, var_1_31=-255, var_1_32=0, var_1_33=16, var_1_34=28847, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L199] RET updateVariables() [L200] CALL step() [L60] COND FALSE !(last_1_var_1_35 < last_1_var_1_28) [L67] var_1_1 = var_1_6 VAL [isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=-100, var_1_20=255, var_1_22=4, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=64, var_1_27=127, var_1_28=217/20, var_1_31=-255, var_1_32=0, var_1_33=16, var_1_34=28847, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L69] EXPR last_1_var_1_7 >> (var_1_14 + var_1_15) VAL [isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=-100, var_1_20=255, var_1_22=4, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=64, var_1_27=127, var_1_28=217/20, var_1_31=-255, var_1_32=0, var_1_33=16, var_1_34=28847, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L69] signed long int stepLocal_1 = last_1_var_1_7 >> (var_1_14 + var_1_15); [L70] unsigned char stepLocal_0 = ((((last_1_var_1_33) > (last_1_var_1_33)) ? (last_1_var_1_33) : (last_1_var_1_33))) != last_1_var_1_9; VAL [isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, stepLocal_0=1, stepLocal_1=50, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=-100, var_1_20=255, var_1_22=4, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=64, var_1_27=127, var_1_28=217/20, var_1_31=-255, var_1_32=0, var_1_33=16, var_1_34=28847, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L71] COND TRUE var_1_13 || stepLocal_0 VAL [isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, stepLocal_1=50, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=-100, var_1_20=255, var_1_22=4, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=64, var_1_27=127, var_1_28=217/20, var_1_31=-255, var_1_32=0, var_1_33=16, var_1_34=28847, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L72] COND TRUE stepLocal_1 >= (last_1_var_1_22 + last_1_var_1_33) VAL [isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=-100, var_1_20=255, var_1_22=4, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=64, var_1_27=127, var_1_28=217/20, var_1_31=-255, var_1_32=0, var_1_33=16, var_1_34=28847, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L73] COND TRUE \read(var_1_13) [L74] var_1_12 = 2 VAL [isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=2, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=-100, var_1_20=255, var_1_22=4, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=64, var_1_27=127, var_1_28=217/20, var_1_31=-255, var_1_32=0, var_1_33=16, var_1_34=28847, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L78] unsigned long int stepLocal_2 = (last_1_var_1_17 + last_1_var_1_17) / (var_1_23 + var_1_24); VAL [isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, stepLocal_2=0, var_1_12=2, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=-100, var_1_20=255, var_1_22=4, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=64, var_1_27=127, var_1_28=217/20, var_1_31=-255, var_1_32=0, var_1_33=16, var_1_34=28847, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L79] COND TRUE stepLocal_2 >= var_1_14 [L80] var_1_22 = (200 - var_1_15) VAL [isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=2, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=-100, var_1_20=255, var_1_22=200, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=64, var_1_27=127, var_1_28=217/20, var_1_31=-255, var_1_32=0, var_1_33=16, var_1_34=28847, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L82] COND FALSE !(last_1_var_1_25 >= last_1_var_1_17) VAL [isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=2, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=-100, var_1_20=255, var_1_22=200, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=64, var_1_27=127, var_1_28=217/20, var_1_31=-255, var_1_32=0, var_1_33=16, var_1_34=28847, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L85] unsigned char stepLocal_3 = var_1_20; VAL [isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, stepLocal_3=255, var_1_12=2, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=-100, var_1_20=255, var_1_22=200, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=64, var_1_27=127, var_1_28=217/20, var_1_31=-255, var_1_32=0, var_1_33=16, var_1_34=28847, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L86] COND FALSE !(stepLocal_3 != var_1_23) [L93] var_1_26 = 2 VAL [isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=2, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=-100, var_1_20=255, var_1_22=200, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=2, var_1_27=127, var_1_28=217/20, var_1_31=-255, var_1_32=0, var_1_33=16, var_1_34=28847, var_1_35=85/8, var_1_6=-100, var_1_7=50, var_1_9=128] [L95] var_1_35 = var_1_30 VAL [isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=2, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=-100, var_1_20=255, var_1_22=200, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=2, var_1_27=127, var_1_28=217/20, var_1_30=2, var_1_31=-255, var_1_32=0, var_1_33=16, var_1_34=28847, var_1_35=2, var_1_6=-100, var_1_7=50, var_1_9=128] [L96] COND TRUE \read(var_1_13) [L97] var_1_28 = ((((var_1_21) > ((var_1_29 + var_1_30))) ? (var_1_21) : ((var_1_29 + var_1_30)))) VAL [isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=2, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=-100, var_1_20=255, var_1_21=3, var_1_22=200, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=2, var_1_27=127, var_1_28=3, var_1_30=2, var_1_31=-255, var_1_32=0, var_1_33=16, var_1_34=28847, var_1_35=2, var_1_6=-100, var_1_7=50, var_1_9=128] [L109] COND TRUE 128 >= (var_1_26 / var_1_27) [L110] var_1_33 = ((((((18346) < 0 ) ? -(18346) : (18346))) + ((((28846) < (var_1_34)) ? (28846) : (var_1_34)))) - ((((((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7)))) < (var_1_12)) ? (((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7)))) : (var_1_12)))) VAL [isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=2, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=-100, var_1_20=255, var_1_21=3, var_1_22=200, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=2, var_1_27=127, var_1_28=3, var_1_30=2, var_1_31=-255, var_1_32=0, var_1_33=47190, var_1_34=28847, var_1_35=2, var_1_6=-100, var_1_7=50, var_1_9=128] [L114] var_1_9 = ((var_1_7 + var_1_7) + ((((var_1_6) < ((var_1_22 + var_1_1))) ? (var_1_6) : ((var_1_22 + var_1_1))))) VAL [isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=2, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=128, var_1_18=103/4, var_1_1=-100, var_1_20=255, var_1_21=3, var_1_22=200, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=2, var_1_27=127, var_1_28=3, var_1_30=2, var_1_31=-255, var_1_32=0, var_1_33=47190, var_1_34=28847, var_1_35=2, var_1_6=-100, var_1_7=50, var_1_9=0] [L115] COND TRUE \read(var_1_13) [L116] var_1_17 = ((var_1_12 + (var_1_6 + var_1_26)) + (var_1_15 - var_1_7)) VAL [isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=2, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=-146, var_1_18=103/4, var_1_1=-100, var_1_20=255, var_1_21=3, var_1_22=200, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=2, var_1_27=127, var_1_28=3, var_1_30=2, var_1_31=-255, var_1_32=0, var_1_33=47190, var_1_34=28847, var_1_35=2, var_1_6=-100, var_1_7=50, var_1_9=0] [L118] COND FALSE !((var_1_35 * var_1_35) >= var_1_28) [L125] var_1_18 = var_1_21 VAL [isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=2, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=-146, var_1_18=3, var_1_1=-100, var_1_20=255, var_1_21=3, var_1_22=200, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=2, var_1_27=127, var_1_28=3, var_1_30=2, var_1_31=-255, var_1_32=0, var_1_33=47190, var_1_34=28847, var_1_35=2, var_1_6=-100, var_1_7=50, var_1_9=0] [L127] COND FALSE !(var_1_18 > 1.75) VAL [isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=2, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=-146, var_1_18=3, var_1_1=-100, var_1_20=255, var_1_21=3, var_1_22=200, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=2, var_1_27=127, var_1_28=3, var_1_30=2, var_1_31=-255, var_1_32=0, var_1_33=47190, var_1_34=28847, var_1_35=2, var_1_6=-100, var_1_7=50, var_1_9=0] [L200] RET step() [L201] CALL, EXPR property() [L191] EXPR ((((last_1_var_1_35 < last_1_var_1_28) ? (((128 + ((((last_1_var_1_26) > (4)) ? (last_1_var_1_26) : (4)))) <= ((((last_1_var_1_22) < (2)) ? (last_1_var_1_22) : (2)))) ? (var_1_1 == ((signed char) var_1_6)) : (var_1_1 == ((signed char) 10))) : (var_1_1 == ((signed char) var_1_6))) && ((last_1_var_1_25 >= last_1_var_1_17) ? (var_1_7 == ((unsigned short int) ((((last_1_var_1_17) < (last_1_var_1_22)) ? (last_1_var_1_17) : (last_1_var_1_22))))) : 1)) && (var_1_9 == ((signed short int) ((var_1_7 + var_1_7) + ((((var_1_6) < ((var_1_22 + var_1_1))) ? (var_1_6) : ((var_1_22 + var_1_1)))))))) && ((var_1_13 || (((((last_1_var_1_33) > (last_1_var_1_33)) ? (last_1_var_1_33) : (last_1_var_1_33))) != last_1_var_1_9)) ? (((last_1_var_1_7 >> (var_1_14 + var_1_15)) >= (last_1_var_1_22 + last_1_var_1_33)) ? (var_1_13 ? (var_1_12 == ((unsigned char) 2)) : 1) : 1) : 1) VAL [isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=2, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=-146, var_1_18=3, var_1_1=-100, var_1_20=255, var_1_21=3, var_1_22=200, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=2, var_1_27=127, var_1_28=3, var_1_30=2, var_1_31=-255, var_1_32=0, var_1_33=47190, var_1_34=28847, var_1_35=2, var_1_6=-100, var_1_7=50, var_1_9=0] [L191] EXPR ((((((last_1_var_1_35 < last_1_var_1_28) ? (((128 + ((((last_1_var_1_26) > (4)) ? (last_1_var_1_26) : (4)))) <= ((((last_1_var_1_22) < (2)) ? (last_1_var_1_22) : (2)))) ? (var_1_1 == ((signed char) var_1_6)) : (var_1_1 == ((signed char) 10))) : (var_1_1 == ((signed char) var_1_6))) && ((last_1_var_1_25 >= last_1_var_1_17) ? (var_1_7 == ((unsigned short int) ((((last_1_var_1_17) < (last_1_var_1_22)) ? (last_1_var_1_17) : (last_1_var_1_22))))) : 1)) && (var_1_9 == ((signed short int) ((var_1_7 + var_1_7) + ((((var_1_6) < ((var_1_22 + var_1_1))) ? (var_1_6) : ((var_1_22 + var_1_1)))))))) && ((var_1_13 || (((((last_1_var_1_33) > (last_1_var_1_33)) ? (last_1_var_1_33) : (last_1_var_1_33))) != last_1_var_1_9)) ? (((last_1_var_1_7 >> (var_1_14 + var_1_15)) >= (last_1_var_1_22 + last_1_var_1_33)) ? (var_1_13 ? (var_1_12 == ((unsigned char) 2)) : 1) : 1) : 1)) && (var_1_13 ? (var_1_17 == ((signed long int) ((var_1_12 + (var_1_6 + var_1_26)) + (var_1_15 - var_1_7)))) : 1)) && (((var_1_35 * var_1_35) >= var_1_28) ? (((- (16 % var_1_20)) >= (((((var_1_12) > (var_1_7)) ? (var_1_12) : (var_1_7))) ^ var_1_1)) ? (var_1_18 == ((float) var_1_21)) : (var_1_18 == ((float) var_1_21))) : (var_1_18 == ((float) var_1_21))) VAL [isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=2, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=-146, var_1_18=3, var_1_1=-100, var_1_20=255, var_1_21=3, var_1_22=200, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=2, var_1_27=127, var_1_28=3, var_1_30=2, var_1_31=-255, var_1_32=0, var_1_33=47190, var_1_34=28847, var_1_35=2, var_1_6=-100, var_1_7=50, var_1_9=0] [L191-L192] return ((((((((((((last_1_var_1_35 < last_1_var_1_28) ? (((128 + ((((last_1_var_1_26) > (4)) ? (last_1_var_1_26) : (4)))) <= ((((last_1_var_1_22) < (2)) ? (last_1_var_1_22) : (2)))) ? (var_1_1 == ((signed char) var_1_6)) : (var_1_1 == ((signed char) 10))) : (var_1_1 == ((signed char) var_1_6))) && ((last_1_var_1_25 >= last_1_var_1_17) ? (var_1_7 == ((unsigned short int) ((((last_1_var_1_17) < (last_1_var_1_22)) ? (last_1_var_1_17) : (last_1_var_1_22))))) : 1)) && (var_1_9 == ((signed short int) ((var_1_7 + var_1_7) + ((((var_1_6) < ((var_1_22 + var_1_1))) ? (var_1_6) : ((var_1_22 + var_1_1)))))))) && ((var_1_13 || (((((last_1_var_1_33) > (last_1_var_1_33)) ? (last_1_var_1_33) : (last_1_var_1_33))) != last_1_var_1_9)) ? (((last_1_var_1_7 >> (var_1_14 + var_1_15)) >= (last_1_var_1_22 + last_1_var_1_33)) ? (var_1_13 ? (var_1_12 == ((unsigned char) 2)) : 1) : 1) : 1)) && (var_1_13 ? (var_1_17 == ((signed long int) ((var_1_12 + (var_1_6 + var_1_26)) + (var_1_15 - var_1_7)))) : 1)) && (((var_1_35 * var_1_35) >= var_1_28) ? (((- (16 % var_1_20)) >= (((((var_1_12) > (var_1_7)) ? (var_1_12) : (var_1_7))) ^ var_1_1)) ? (var_1_18 == ((float) var_1_21)) : (var_1_18 == ((float) var_1_21))) : (var_1_18 == ((float) var_1_21)))) && ((((last_1_var_1_17 + last_1_var_1_17) / (var_1_23 + var_1_24)) >= var_1_14) ? (var_1_22 == ((unsigned char) (200 - var_1_15))) : 1)) && ((var_1_18 > 1.75) ? (((var_1_1 <= (~ last_1_var_1_25)) && var_1_13) ? ((var_1_13 && (var_1_26 < var_1_33)) ? (var_1_25 == ((unsigned long int) ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))))) : (var_1_25 == ((unsigned long int) var_1_24))) : 1) : 1)) && ((var_1_20 != var_1_23) ? ((! var_1_13) ? (var_1_26 == ((unsigned char) (var_1_27 - var_1_14))) : (var_1_26 == ((unsigned char) var_1_27))) : (var_1_26 == ((unsigned char) 2)))) && (var_1_13 ? (var_1_28 == ((float) ((((var_1_21) > ((var_1_29 + var_1_30))) ? (var_1_21) : ((var_1_29 + var_1_30)))))) : (var_1_31 ? ((! ((var_1_1 > var_1_12) || var_1_32)) ? (var_1_28 == ((float) var_1_30)) : (var_1_28 == ((float) var_1_29))) : (var_1_28 == ((float) 2.25f))))) && ((128 >= (var_1_26 / var_1_27)) ? (var_1_33 == ((unsigned short int) ((((((18346) < 0 ) ? -(18346) : (18346))) + ((((28846) < (var_1_34)) ? (28846) : (var_1_34)))) - ((((((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7)))) < (var_1_12)) ? (((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7)))) : (var_1_12)))))) : (var_1_33 == ((unsigned short int) (16 + last_1_var_1_33))))) && (var_1_35 == ((double) var_1_30)) ; [L201] RET, EXPR property() [L201] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=2, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=-146, var_1_18=3, var_1_1=-100, var_1_20=255, var_1_21=3, var_1_22=200, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=2, var_1_27=127, var_1_28=3, var_1_30=2, var_1_31=-255, var_1_32=0, var_1_33=47190, var_1_34=28847, var_1_35=2, var_1_6=-100, var_1_7=50, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_17=128, last_1_var_1_22=4, last_1_var_1_25=5, last_1_var_1_26=64, last_1_var_1_28=217/20, last_1_var_1_33=16, last_1_var_1_35=85/8, last_1_var_1_7=50, last_1_var_1_9=128, var_1_12=2, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=-146, var_1_18=3, var_1_1=-100, var_1_20=255, var_1_21=3, var_1_22=200, var_1_23=-4294967041, var_1_24=-4294967294, var_1_25=5, var_1_26=2, var_1_27=127, var_1_28=3, var_1_30=2, var_1_31=-255, var_1_32=0, var_1_33=47190, var_1_34=28847, var_1_35=2, var_1_6=-100, var_1_7=50, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 99 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 6, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 493 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 493 mSDsluCounter, 2035 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1273 mSDsCounter, 247 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 317 IncrementalHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 247 mSolverCounterUnsat, 762 mSDtfsCounter, 317 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 316 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=357occurred in iteration=5, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 5 MinimizatonAttempts, 138 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1190 NumberOfCodeBlocks, 1190 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 843 ConstructedInterpolants, 0 QuantifiedInterpolants, 3461 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 6500/6500 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 12:10:00,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-35.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 8f396e758b8a155477a6287a4e84cc28d26a53a2a5a132d030171d91e6da2d2b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:10:02,864 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:10:02,954 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 12:10:02,963 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:10:02,963 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:10:02,997 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:10:02,998 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:10:02,998 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:10:02,999 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:10:02,999 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:10:03,000 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:10:03,000 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:10:03,001 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:10:03,001 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:10:03,001 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:10:03,002 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:10:03,002 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:10:03,002 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:10:03,003 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:10:03,003 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:10:03,003 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:10:03,004 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:10:03,004 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:10:03,004 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 12:10:03,005 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 12:10:03,005 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:10:03,006 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 12:10:03,006 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:10:03,006 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:10:03,007 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:10:03,007 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:10:03,011 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:10:03,012 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:10:03,012 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:10:03,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:10:03,022 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:10:03,022 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:10:03,022 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:10:03,022 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 12:10:03,023 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 12:10:03,023 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:10:03,027 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:10:03,027 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:10:03,028 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:10:03,028 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 12:10:03,028 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-clean/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-clean/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 -> 8f396e758b8a155477a6287a4e84cc28d26a53a2a5a132d030171d91e6da2d2b [2024-10-11 12:10:03,387 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:10:03,416 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:10:03,419 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:10:03,421 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:10:03,421 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:10:03,424 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-35.i [2024-10-11 12:10:05,053 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:10:05,314 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:10:05,315 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-35.i [2024-10-11 12:10:05,330 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/bfa6158a6/acf502b4619f4b8fac7b0f3f38f2a633/FLAGfc39d50a6 [2024-10-11 12:10:05,646 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/bfa6158a6/acf502b4619f4b8fac7b0f3f38f2a633 [2024-10-11 12:10:05,649 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:10:05,650 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:10:05,651 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:10:05,652 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:10:05,658 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:10:05,659 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:10:05" (1/1) ... [2024-10-11 12:10:05,662 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@669729c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:10:05, skipping insertion in model container [2024-10-11 12:10:05,662 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:10:05" (1/1) ... [2024-10-11 12:10:05,703 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:10:05,899 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-35.i[916,929] [2024-10-11 12:10:06,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:10:06,040 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:10:06,054 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-35.i[916,929] [2024-10-11 12:10:06,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:10:06,127 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:10:06,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:10:06 WrapperNode [2024-10-11 12:10:06,128 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:10:06,129 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:10:06,129 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:10:06,130 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:10:06,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:10:06" (1/1) ... [2024-10-11 12:10:06,160 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:10:06" (1/1) ... [2024-10-11 12:10:06,205 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 192 [2024-10-11 12:10:06,205 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:10:06,211 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:10:06,212 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:10:06,212 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:10:06,223 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:10:06" (1/1) ... [2024-10-11 12:10:06,223 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:10:06" (1/1) ... [2024-10-11 12:10:06,236 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:10:06" (1/1) ... [2024-10-11 12:10:06,265 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 12:10:06,265 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:10:06" (1/1) ... [2024-10-11 12:10:06,265 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:10:06" (1/1) ... [2024-10-11 12:10:06,281 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:10:06" (1/1) ... [2024-10-11 12:10:06,288 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:10:06" (1/1) ... [2024-10-11 12:10:06,295 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:10:06" (1/1) ... [2024-10-11 12:10:06,301 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:10:06" (1/1) ... [2024-10-11 12:10:06,309 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:10:06,314 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:10:06,314 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:10:06,314 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:10:06,315 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:10:06" (1/1) ... [2024-10-11 12:10:06,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:10:06,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:10:06,359 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:10:06,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:10:06,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:10:06,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 12:10:06,427 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:10:06,427 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:10:06,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:10:06,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:10:06,542 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:10:06,545 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:10:10,884 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-11 12:10:10,884 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:10:10,983 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:10:10,984 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:10:10,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:10:10 BoogieIcfgContainer [2024-10-11 12:10:10,987 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:10:10,989 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:10:10,990 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:10:10,999 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:10:11,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:10:05" (1/3) ... [2024-10-11 12:10:11,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18c67f42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:10:11, skipping insertion in model container [2024-10-11 12:10:11,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:10:06" (2/3) ... [2024-10-11 12:10:11,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18c67f42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:10:11, skipping insertion in model container [2024-10-11 12:10:11,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:10:10" (3/3) ... [2024-10-11 12:10:11,003 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-35.i [2024-10-11 12:10:11,020 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:10:11,021 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:10:11,105 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:10:11,116 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;@3f706f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:10:11,117 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:10:11,122 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 48 states have (on average 1.5) internal successors, (72), 49 states have internal predecessors, (72), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 12:10:11,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-11 12:10:11,159 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:10:11,161 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:10:11,161 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:10:11,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:10:11,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1087230399, now seen corresponding path program 1 times [2024-10-11 12:10:11,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:10:11,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [560012710] [2024-10-11 12:10:11,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:10:11,188 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:10:11,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:10:11,192 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 12:10:11,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 12:10:11,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:11,747 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 12:10:11,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:10:11,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 674 proven. 0 refuted. 0 times theorem prover too weak. 626 trivial. 0 not checked. [2024-10-11 12:10:11,834 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:10:11,835 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:10:11,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [560012710] [2024-10-11 12:10:11,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [560012710] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:10:11,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:10:11,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:10:11,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341762915] [2024-10-11 12:10:11,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:10:11,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:10:11,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:10:11,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:10:11,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:10:11,878 INFO L87 Difference]: Start difference. First operand has 77 states, 48 states have (on average 1.5) internal successors, (72), 49 states have internal predecessors, (72), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 12:10:12,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:10:12,865 INFO L93 Difference]: Finished difference Result 151 states and 272 transitions. [2024-10-11 12:10:12,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:10:12,894 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 164 [2024-10-11 12:10:12,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:10:12,901 INFO L225 Difference]: With dead ends: 151 [2024-10-11 12:10:12,901 INFO L226 Difference]: Without dead ends: 75 [2024-10-11 12:10:12,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:10:12,908 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 12:10:12,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 12:10:12,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-11 12:10:12,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-10-11 12:10:12,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 47 states have internal predecessors, (66), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 12:10:12,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 118 transitions. [2024-10-11 12:10:12,978 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 118 transitions. Word has length 164 [2024-10-11 12:10:12,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:10:12,979 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 118 transitions. [2024-10-11 12:10:12,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 12:10:12,979 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 118 transitions. [2024-10-11 12:10:12,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-11 12:10:12,983 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:10:12,983 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:10:13,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 12:10:13,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:10:13,185 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:10:13,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:10:13,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1666981377, now seen corresponding path program 1 times [2024-10-11 12:10:13,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:10:13,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1186397620] [2024-10-11 12:10:13,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:10:13,189 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:10:13,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:10:13,193 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 12:10:13,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 12:10:13,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:13,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 12:10:13,738 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:10:18,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 12:10:18,207 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:10:18,207 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:10:18,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1186397620] [2024-10-11 12:10:18,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1186397620] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:10:18,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:10:18,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 12:10:18,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62639408] [2024-10-11 12:10:18,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:10:18,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 12:10:18,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:10:18,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 12:10:18,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:10:18,211 INFO L87 Difference]: Start difference. First operand 75 states and 118 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 12:10:21,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.54s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:10:23,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:10:24,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:10:26,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:10:30,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.68s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:10:32,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:10:32,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:10:32,880 INFO L93 Difference]: Finished difference Result 224 states and 353 transitions. [2024-10-11 12:10:32,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 12:10:32,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 164 [2024-10-11 12:10:32,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:10:32,915 INFO L225 Difference]: With dead ends: 224 [2024-10-11 12:10:32,915 INFO L226 Difference]: Without dead ends: 150 [2024-10-11 12:10:32,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 12:10:32,920 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 83 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.3s IncrementalHoareTripleChecker+Time [2024-10-11 12:10:32,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 308 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 14.3s Time] [2024-10-11 12:10:32,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-11 12:10:32,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 121. [2024-10-11 12:10:32,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 66 states have internal predecessors, (85), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 12:10:32,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 189 transitions. [2024-10-11 12:10:32,970 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 189 transitions. Word has length 164 [2024-10-11 12:10:32,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:10:32,972 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 189 transitions. [2024-10-11 12:10:32,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 12:10:32,972 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 189 transitions. [2024-10-11 12:10:32,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-11 12:10:32,975 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:10:32,975 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:10:32,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 12:10:33,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:10:33,177 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:10:33,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:10:33,177 INFO L85 PathProgramCache]: Analyzing trace with hash 128693509, now seen corresponding path program 1 times [2024-10-11 12:10:33,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:10:33,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1500400998] [2024-10-11 12:10:33,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:10:33,179 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:10:33,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:10:33,181 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 12:10:33,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 12:10:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:33,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 12:10:33,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:10:36,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 12:10:36,897 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:10:36,897 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:10:36,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1500400998] [2024-10-11 12:10:36,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1500400998] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:10:36,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:10:36,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 12:10:36,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261310002] [2024-10-11 12:10:36,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:10:36,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 12:10:36,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:10:36,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 12:10:36,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 12:10:36,900 INFO L87 Difference]: Start difference. First operand 121 states and 189 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 12:10:38,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:10:40,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:10:40,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:10:40,262 INFO L93 Difference]: Finished difference Result 224 states and 352 transitions. [2024-10-11 12:10:40,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 12:10:40,299 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 165 [2024-10-11 12:10:40,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:10:40,305 INFO L225 Difference]: With dead ends: 224 [2024-10-11 12:10:40,305 INFO L226 Difference]: Without dead ends: 150 [2024-10-11 12:10:40,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 12:10:40,307 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 86 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-11 12:10:40,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 439 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-11 12:10:40,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-11 12:10:40,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 124. [2024-10-11 12:10:40,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 69 states have (on average 1.2753623188405796) internal successors, (88), 69 states have internal predecessors, (88), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 12:10:40,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 192 transitions. [2024-10-11 12:10:40,349 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 192 transitions. Word has length 165 [2024-10-11 12:10:40,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:10:40,350 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 192 transitions. [2024-10-11 12:10:40,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 12:10:40,353 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 192 transitions. [2024-10-11 12:10:40,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 12:10:40,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:10:40,356 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:10:40,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Ended with exit code 0 [2024-10-11 12:10:40,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:10:40,561 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:10:40,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:10:40,562 INFO L85 PathProgramCache]: Analyzing trace with hash 2126739338, now seen corresponding path program 1 times [2024-10-11 12:10:40,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:10:40,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1629802357] [2024-10-11 12:10:40,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:10:40,563 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:10:40,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:10:40,566 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 12:10:40,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 12:10:41,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:41,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 12:10:41,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:10:44,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 12:10:44,475 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:10:44,476 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:10:44,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1629802357] [2024-10-11 12:10:44,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1629802357] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:10:44,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:10:44,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 12:10:44,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820088652] [2024-10-11 12:10:44,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:10:44,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 12:10:44,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:10:44,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 12:10:44,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:10:44,478 INFO L87 Difference]: Start difference. First operand 124 states and 192 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 12:10:46,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:10:48,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:10:48,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:10:48,584 INFO L93 Difference]: Finished difference Result 283 states and 442 transitions. [2024-10-11 12:10:48,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 12:10:48,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 166 [2024-10-11 12:10:48,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:10:48,588 INFO L225 Difference]: With dead ends: 283 [2024-10-11 12:10:48,588 INFO L226 Difference]: Without dead ends: 209 [2024-10-11 12:10:48,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 12:10:48,590 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 100 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:10:48,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 345 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-10-11 12:10:48,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-10-11 12:10:48,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 195. [2024-10-11 12:10:48,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 113 states have (on average 1.3185840707964602) internal successors, (149), 113 states have internal predecessors, (149), 78 states have call successors, (78), 3 states have call predecessors, (78), 3 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-11 12:10:48,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 305 transitions. [2024-10-11 12:10:48,638 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 305 transitions. Word has length 166 [2024-10-11 12:10:48,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:10:48,640 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 305 transitions. [2024-10-11 12:10:48,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 12:10:48,640 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 305 transitions. [2024-10-11 12:10:48,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 12:10:48,648 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:10:48,648 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:10:48,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 12:10:48,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:10:48,849 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:10:48,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:10:48,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1539933324, now seen corresponding path program 1 times [2024-10-11 12:10:48,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:10:48,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1244062237] [2024-10-11 12:10:48,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:10:48,851 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:10:48,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:10:48,853 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 12:10:48,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 12:10:49,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:10:49,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-11 12:10:49,454 INFO L278 TraceCheckSpWp]: Computing forward predicates...