./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_fillercode_fillercodestructure_filler-pr-ci_file-18.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-18.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0ddfed299cddd9e32e0c725c50eded2fe88f31aaefb86ca27530d10afeb40c79 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 02:06:43,170 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 02:06:43,236 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 02:06:43,241 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 02:06:43,241 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 02:06:43,272 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 02:06:43,273 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 02:06:43,273 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 02:06:43,274 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 02:06:43,274 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 02:06:43,275 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 02:06:43,275 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 02:06:43,276 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 02:06:43,276 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 02:06:43,276 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 02:06:43,277 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 02:06:43,277 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 02:06:43,278 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 02:06:43,278 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 02:06:43,278 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 02:06:43,280 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 02:06:43,281 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 02:06:43,281 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 02:06:43,281 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 02:06:43,282 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 02:06:43,282 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 02:06:43,282 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 02:06:43,282 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 02:06:43,283 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 02:06:43,283 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 02:06:43,283 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 02:06:43,284 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 02:06:43,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:06:43,285 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 02:06:43,285 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 02:06:43,286 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 02:06:43,286 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 02:06:43,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 02:06:43,286 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 02:06:43,287 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 02:06:43,287 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 02:06:43,288 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 02:06:43,288 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0ddfed299cddd9e32e0c725c50eded2fe88f31aaefb86ca27530d10afeb40c79 [2024-10-13 02:06:43,599 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 02:06:43,631 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 02:06:43,636 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 02:06:43,637 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 02:06:43,638 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 02:06:43,639 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-18.i [2024-10-13 02:06:45,102 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 02:06:45,353 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 02:06:45,353 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-18.i [2024-10-13 02:06:45,370 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f238ec8b7/ddf42e0f590f4531888a6d6dc96d79c8/FLAG6eb1c14f6 [2024-10-13 02:06:45,386 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f238ec8b7/ddf42e0f590f4531888a6d6dc96d79c8 [2024-10-13 02:06:45,391 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 02:06:45,394 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 02:06:45,395 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 02:06:45,395 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 02:06:45,401 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 02:06:45,402 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:06:45" (1/1) ... [2024-10-13 02:06:45,403 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c25c969 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:06:45, skipping insertion in model container [2024-10-13 02:06:45,403 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:06:45" (1/1) ... [2024-10-13 02:06:45,430 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 02:06:45,615 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_fillercode_fillercodestructure_filler-pr-ci_file-18.i[919,932] [2024-10-13 02:06:45,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:06:45,730 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 02:06:45,744 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_fillercode_fillercodestructure_filler-pr-ci_file-18.i[919,932] [2024-10-13 02:06:45,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:06:45,816 INFO L204 MainTranslator]: Completed translation [2024-10-13 02:06:45,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:06:45 WrapperNode [2024-10-13 02:06:45,817 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 02:06:45,818 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 02:06:45,818 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 02:06:45,818 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 02:06:45,825 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:06:45" (1/1) ... [2024-10-13 02:06:45,835 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:06:45" (1/1) ... [2024-10-13 02:06:45,869 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 226 [2024-10-13 02:06:45,870 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 02:06:45,870 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 02:06:45,871 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 02:06:45,871 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 02:06:45,889 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:06:45" (1/1) ... [2024-10-13 02:06:45,889 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:06:45" (1/1) ... [2024-10-13 02:06:45,892 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:06:45" (1/1) ... [2024-10-13 02:06:45,913 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-13 02:06:45,914 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:06:45" (1/1) ... [2024-10-13 02:06:45,914 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:06:45" (1/1) ... [2024-10-13 02:06:45,922 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:06:45" (1/1) ... [2024-10-13 02:06:45,926 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:06:45" (1/1) ... [2024-10-13 02:06:45,930 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:06:45" (1/1) ... [2024-10-13 02:06:45,932 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:06:45" (1/1) ... [2024-10-13 02:06:45,936 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 02:06:45,937 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 02:06:45,937 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 02:06:45,938 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 02:06:45,939 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:06:45" (1/1) ... [2024-10-13 02:06:45,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:06:45,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:06:45,986 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 02:06:45,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 02:06:46,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 02:06:46,041 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 02:06:46,042 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 02:06:46,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 02:06:46,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 02:06:46,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 02:06:46,163 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 02:06:46,165 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 02:06:46,557 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-13 02:06:46,558 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 02:06:46,605 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 02:06:46,605 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 02:06:46,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:06:46 BoogieIcfgContainer [2024-10-13 02:06:46,606 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 02:06:46,610 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 02:06:46,612 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 02:06:46,616 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 02:06:46,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:06:45" (1/3) ... [2024-10-13 02:06:46,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62fa3525 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:06:46, skipping insertion in model container [2024-10-13 02:06:46,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:06:45" (2/3) ... [2024-10-13 02:06:46,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62fa3525 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:06:46, skipping insertion in model container [2024-10-13 02:06:46,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:06:46" (3/3) ... [2024-10-13 02:06:46,620 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-18.i [2024-10-13 02:06:46,639 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 02:06:46,640 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 02:06:46,706 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 02:06:46,713 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;@43609f83, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 02:06:46,713 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 02:06:46,718 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 58 states have (on average 1.5172413793103448) internal successors, (88), 59 states have internal predecessors, (88), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-13 02:06:46,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-13 02:06:46,734 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:06:46,736 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 02:06:46,736 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:06:46,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:06:46,743 INFO L85 PathProgramCache]: Analyzing trace with hash -325050660, now seen corresponding path program 1 times [2024-10-13 02:06:46,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:06:46,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274265577] [2024-10-13 02:06:46,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:06:46,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:06:46,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:47,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:06:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:47,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:06:47,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:47,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:06:47,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:47,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 02:06:47,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:47,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:06:47,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:47,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:06:47,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:47,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:06:47,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:47,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:06:47,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:47,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:06:47,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:47,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:06:47,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:47,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:06:47,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:47,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:06:47,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:47,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:06:47,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:47,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 02:06:47,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:47,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 02:06:47,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:47,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 02:06:47,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:47,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 02:06:47,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:47,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 02:06:47,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:47,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 02:06:47,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:47,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 02:06:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:47,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 02:06:47,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:47,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 02:06:47,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:47,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 02:06:47,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:47,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 02:06:47,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:47,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 02:06:47,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:47,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 02:06:47,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:47,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 02:06:47,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:47,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 02:06:47,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:47,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 02:06:47,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:47,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-13 02:06:47,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:06:47,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274265577] [2024-10-13 02:06:47,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274265577] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:06:47,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:06:47,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:06:47,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549592302] [2024-10-13 02:06:47,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:06:47,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 02:06:47,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:06:47,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 02:06:47,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:06:47,383 INFO L87 Difference]: Start difference. First operand has 90 states, 58 states have (on average 1.5172413793103448) internal successors, (88), 59 states have internal predecessors, (88), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-13 02:06:47,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:06:47,446 INFO L93 Difference]: Finished difference Result 176 states and 317 transitions. [2024-10-13 02:06:47,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 02:06:47,450 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 185 [2024-10-13 02:06:47,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:06:47,460 INFO L225 Difference]: With dead ends: 176 [2024-10-13 02:06:47,461 INFO L226 Difference]: Without dead ends: 87 [2024-10-13 02:06:47,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 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-13 02:06:47,472 INFO L432 NwaCegarLoop]: 135 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, 135 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-13 02:06:47,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:06:47,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-13 02:06:47,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-13 02:06:47,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 56 states have internal predecessors, (80), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-13 02:06:47,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 138 transitions. [2024-10-13 02:06:47,539 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 138 transitions. Word has length 185 [2024-10-13 02:06:47,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:06:47,540 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 138 transitions. [2024-10-13 02:06:47,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-13 02:06:47,540 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 138 transitions. [2024-10-13 02:06:47,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-13 02:06:47,547 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:06:47,547 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 02:06:47,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 02:06:47,548 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:06:47,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:06:47,549 INFO L85 PathProgramCache]: Analyzing trace with hash 951960082, now seen corresponding path program 1 times [2024-10-13 02:06:47,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:06:47,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100224491] [2024-10-13 02:06:47,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:06:47,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:06:47,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:47,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:06:47,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:47,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:06:47,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:47,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:06:47,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:47,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 02:06:47,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:47,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:06:47,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:47,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:06:47,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:47,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:06:47,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:47,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:06:47,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:47,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:06:47,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:48,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:06:48,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:48,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:06:48,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:48,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:06:48,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:48,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:06:48,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:48,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 02:06:48,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:48,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 02:06:48,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:48,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 02:06:48,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:48,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 02:06:48,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:48,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 02:06:48,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:48,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 02:06:48,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:48,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 02:06:48,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:48,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 02:06:48,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:48,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 02:06:48,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:48,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 02:06:48,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:48,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 02:06:48,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:48,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 02:06:48,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:48,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 02:06:48,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:48,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 02:06:48,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:48,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 02:06:48,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:48,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 02:06:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:48,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-13 02:06:48,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:06:48,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100224491] [2024-10-13 02:06:48,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100224491] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:06:48,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:06:48,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:06:48,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296610308] [2024-10-13 02:06:48,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:06:48,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:06:48,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:06:48,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:06:48,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:06:48,160 INFO L87 Difference]: Start difference. First operand 87 states and 138 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 02:06:48,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:06:48,247 INFO L93 Difference]: Finished difference Result 231 states and 367 transitions. [2024-10-13 02:06:48,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:06:48,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 185 [2024-10-13 02:06:48,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:06:48,252 INFO L225 Difference]: With dead ends: 231 [2024-10-13 02:06:48,252 INFO L226 Difference]: Without dead ends: 145 [2024-10-13 02:06:48,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 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-13 02:06:48,254 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 41 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:06:48,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 252 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:06:48,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-10-13 02:06:48,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 141. [2024-10-13 02:06:48,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 80 states have (on average 1.325) internal successors, (106), 80 states have internal predecessors, (106), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-13 02:06:48,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 222 transitions. [2024-10-13 02:06:48,307 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 222 transitions. Word has length 185 [2024-10-13 02:06:48,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:06:48,308 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 222 transitions. [2024-10-13 02:06:48,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 02:06:48,308 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 222 transitions. [2024-10-13 02:06:48,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-13 02:06:48,312 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:06:48,312 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 02:06:48,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 02:06:48,312 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:06:48,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:06:48,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1753267750, now seen corresponding path program 1 times [2024-10-13 02:06:48,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:06:48,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805065786] [2024-10-13 02:06:48,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:06:48,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:06:48,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:49,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:06:49,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:49,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:06:49,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:49,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:06:49,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:49,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 02:06:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:49,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:06:49,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:49,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:06:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:49,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:06:49,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:49,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:06:49,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:49,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:06:49,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:49,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:06:49,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:49,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:06:49,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:49,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:06:49,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:49,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:06:49,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:49,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 02:06:49,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:49,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 02:06:49,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:49,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 02:06:49,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:49,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 02:06:49,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:49,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 02:06:49,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:49,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 02:06:49,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:49,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 02:06:49,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:49,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 02:06:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:49,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 02:06:49,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:49,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 02:06:49,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:49,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 02:06:49,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:49,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 02:06:49,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:49,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 02:06:49,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:49,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 02:06:49,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:49,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 02:06:49,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:49,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 02:06:49,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:49,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-13 02:06:49,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:06:49,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805065786] [2024-10-13 02:06:49,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805065786] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:06:49,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:06:49,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 02:06:49,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893897741] [2024-10-13 02:06:49,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:06:49,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 02:06:49,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:06:49,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 02:06:49,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-13 02:06:49,224 INFO L87 Difference]: Start difference. First operand 141 states and 222 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-13 02:06:50,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:06:50,518 INFO L93 Difference]: Finished difference Result 426 states and 651 transitions. [2024-10-13 02:06:50,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 02:06:50,518 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 187 [2024-10-13 02:06:50,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:06:50,524 INFO L225 Difference]: With dead ends: 426 [2024-10-13 02:06:50,527 INFO L226 Difference]: Without dead ends: 340 [2024-10-13 02:06:50,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-10-13 02:06:50,533 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 621 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:06:50,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 674 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 02:06:50,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2024-10-13 02:06:50,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 300. [2024-10-13 02:06:50,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 200 states have (on average 1.405) internal successors, (281), 203 states have internal predecessors, (281), 91 states have call successors, (91), 8 states have call predecessors, (91), 8 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2024-10-13 02:06:50,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 463 transitions. [2024-10-13 02:06:50,621 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 463 transitions. Word has length 187 [2024-10-13 02:06:50,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:06:50,623 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 463 transitions. [2024-10-13 02:06:50,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-13 02:06:50,624 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 463 transitions. [2024-10-13 02:06:50,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-13 02:06:50,629 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:06:50,630 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 02:06:50,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 02:06:50,630 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:06:50,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:06:50,631 INFO L85 PathProgramCache]: Analyzing trace with hash 852755804, now seen corresponding path program 1 times [2024-10-13 02:06:50,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:06:50,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016779129] [2024-10-13 02:06:50,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:06:50,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:06:50,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:50,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:06:50,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:50,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:06:50,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:50,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:06:50,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:50,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 02:06:50,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:50,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:06:50,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:50,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:06:50,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:50,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:06:50,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:50,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:06:50,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:50,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:06:50,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:50,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:06:50,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:50,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:06:50,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:50,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:06:50,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:50,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:06:50,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:50,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 02:06:50,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:50,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 02:06:50,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:50,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 02:06:50,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:50,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 02:06:50,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:50,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 02:06:50,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:50,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 02:06:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:50,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 02:06:50,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:50,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 02:06:50,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:50,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 02:06:50,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:50,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 02:06:50,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:50,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 02:06:50,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:50,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 02:06:50,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:50,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 02:06:50,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:50,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 02:06:50,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:50,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 02:06:50,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:50,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 02:06:50,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:50,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-13 02:06:50,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:06:50,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016779129] [2024-10-13 02:06:50,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016779129] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:06:50,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:06:50,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:06:50,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984548617] [2024-10-13 02:06:50,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:06:50,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:06:50,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:06:50,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:06:50,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:06:50,808 INFO L87 Difference]: Start difference. First operand 300 states and 463 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 02:06:50,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:06:50,916 INFO L93 Difference]: Finished difference Result 529 states and 803 transitions. [2024-10-13 02:06:50,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:06:50,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 187 [2024-10-13 02:06:50,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:06:50,925 INFO L225 Difference]: With dead ends: 529 [2024-10-13 02:06:50,925 INFO L226 Difference]: Without dead ends: 404 [2024-10-13 02:06:50,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 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-13 02:06:50,930 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 59 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:06:50,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 262 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 02:06:50,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-10-13 02:06:50,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 346. [2024-10-13 02:06:50,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 235 states have (on average 1.4127659574468086) internal successors, (332), 239 states have internal predecessors, (332), 101 states have call successors, (101), 9 states have call predecessors, (101), 9 states have return successors, (101), 97 states have call predecessors, (101), 101 states have call successors, (101) [2024-10-13 02:06:50,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 534 transitions. [2024-10-13 02:06:50,993 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 534 transitions. Word has length 187 [2024-10-13 02:06:50,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:06:50,996 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 534 transitions. [2024-10-13 02:06:50,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 02:06:50,997 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 534 transitions. [2024-10-13 02:06:50,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-13 02:06:51,000 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:06:51,001 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 02:06:51,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 02:06:51,001 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:06:51,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:06:51,002 INFO L85 PathProgramCache]: Analyzing trace with hash 852815386, now seen corresponding path program 1 times [2024-10-13 02:06:51,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:06:51,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81545341] [2024-10-13 02:06:51,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:06:51,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:06:51,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:51,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:06:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:51,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:06:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:51,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:06:51,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:51,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 02:06:51,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:51,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:06:51,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:51,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:06:51,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:51,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:06:51,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:51,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:06:51,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:51,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:06:51,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:51,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:06:51,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:51,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:06:51,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:51,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:06:51,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:51,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:06:51,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:51,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 02:06:51,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:51,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 02:06:51,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:51,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 02:06:51,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:51,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 02:06:51,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:51,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 02:06:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:51,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 02:06:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:51,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 02:06:51,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:51,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 02:06:51,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:51,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 02:06:51,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:51,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 02:06:51,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:51,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 02:06:51,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:51,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 02:06:51,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:51,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-13 02:06:51,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:51,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 02:06:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:51,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 02:06:51,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:51,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 02:06:51,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:51,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 51 proven. 33 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-10-13 02:06:51,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:06:51,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81545341] [2024-10-13 02:06:51,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81545341] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 02:06:51,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951156969] [2024-10-13 02:06:51,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:06:51,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:06:51,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:06:51,433 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 02:06:51,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 02:06:51,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:51,578 INFO L255 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 02:06:51,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:06:52,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 810 proven. 33 refuted. 0 times theorem prover too weak. 781 trivial. 0 not checked. [2024-10-13 02:06:52,181 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:06:52,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 51 proven. 33 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-10-13 02:06:52,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951156969] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 02:06:52,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 02:06:52,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 17 [2024-10-13 02:06:52,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919577707] [2024-10-13 02:06:52,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 02:06:52,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-13 02:06:52,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:06:52,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-13 02:06:52,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2024-10-13 02:06:52,499 INFO L87 Difference]: Start difference. First operand 346 states and 534 transitions. Second operand has 17 states, 16 states have (on average 5.875) internal successors, (94), 17 states have internal predecessors, (94), 6 states have call successors, (87), 3 states have call predecessors, (87), 6 states have return successors, (87), 5 states have call predecessors, (87), 6 states have call successors, (87) [2024-10-13 02:06:53,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:06:53,282 INFO L93 Difference]: Finished difference Result 553 states and 854 transitions. [2024-10-13 02:06:53,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 02:06:53,283 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 5.875) internal successors, (94), 17 states have internal predecessors, (94), 6 states have call successors, (87), 3 states have call predecessors, (87), 6 states have return successors, (87), 5 states have call predecessors, (87), 6 states have call successors, (87) Word has length 187 [2024-10-13 02:06:53,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:06:53,286 INFO L225 Difference]: With dead ends: 553 [2024-10-13 02:06:53,286 INFO L226 Difference]: Without dead ends: 270 [2024-10-13 02:06:53,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=371, Unknown=0, NotChecked=0, Total=506 [2024-10-13 02:06:53,288 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 234 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 02:06:53,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 594 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 02:06:53,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-10-13 02:06:53,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 198. [2024-10-13 02:06:53,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 124 states have (on average 1.3548387096774193) internal successors, (168), 125 states have internal predecessors, (168), 68 states have call successors, (68), 5 states have call predecessors, (68), 5 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-13 02:06:53,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 304 transitions. [2024-10-13 02:06:53,324 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 304 transitions. Word has length 187 [2024-10-13 02:06:53,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:06:53,325 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 304 transitions. [2024-10-13 02:06:53,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 5.875) internal successors, (94), 17 states have internal predecessors, (94), 6 states have call successors, (87), 3 states have call predecessors, (87), 6 states have return successors, (87), 5 states have call predecessors, (87), 6 states have call successors, (87) [2024-10-13 02:06:53,325 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 304 transitions. [2024-10-13 02:06:53,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-13 02:06:53,327 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:06:53,327 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 02:06:53,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 02:06:53,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:06:53,529 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:06:53,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:06:53,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1724051096, now seen corresponding path program 1 times [2024-10-13 02:06:53,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:06:53,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739658124] [2024-10-13 02:06:53,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:06:53,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:06:53,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 02:06:53,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [861261929] [2024-10-13 02:06:53,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:06:53,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:06:53,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:06:53,631 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 02:06:53,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 02:06:53,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:06:53,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 02:06:53,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:06:54,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-13 02:06:54,088 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:06:54,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:06:54,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739658124] [2024-10-13 02:06:54,090 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 02:06:54,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861261929] [2024-10-13 02:06:54,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861261929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:06:54,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:06:54,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 02:06:54,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767626492] [2024-10-13 02:06:54,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:06:54,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 02:06:54,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:06:54,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 02:06:54,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 02:06:54,093 INFO L87 Difference]: Start difference. First operand 198 states and 304 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 02:06:54,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:06:54,404 INFO L93 Difference]: Finished difference Result 405 states and 644 transitions. [2024-10-13 02:06:54,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 02:06:54,405 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 187 [2024-10-13 02:06:54,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:06:54,408 INFO L225 Difference]: With dead ends: 405 [2024-10-13 02:06:54,408 INFO L226 Difference]: Without dead ends: 273 [2024-10-13 02:06:54,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-10-13 02:06:54,410 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 154 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 02:06:54,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 364 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 02:06:54,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-10-13 02:06:54,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 205. [2024-10-13 02:06:54,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 131 states have (on average 1.3587786259541985) internal successors, (178), 132 states have internal predecessors, (178), 68 states have call successors, (68), 5 states have call predecessors, (68), 5 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-13 02:06:54,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 314 transitions. [2024-10-13 02:06:54,440 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 314 transitions. Word has length 187 [2024-10-13 02:06:54,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:06:54,440 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 314 transitions. [2024-10-13 02:06:54,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 02:06:54,441 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 314 transitions. [2024-10-13 02:06:54,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-13 02:06:54,444 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:06:54,444 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 02:06:54,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 02:06:54,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-13 02:06:54,649 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:06:54,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:06:54,649 INFO L85 PathProgramCache]: Analyzing trace with hash 135703194, now seen corresponding path program 1 times [2024-10-13 02:06:54,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:06:54,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638873305] [2024-10-13 02:06:54,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:06:54,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:06:54,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 02:06:54,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [933379814] [2024-10-13 02:06:54,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:06:54,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:06:54,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:06:54,716 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 02:06:54,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 02:06:54,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 02:06:54,843 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 02:06:54,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 02:06:55,014 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 02:06:55,014 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 02:06:55,015 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 02:06:55,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-13 02:06:55,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:06:55,222 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:06:55,384 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 02:06:55,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 02:06:55 BoogieIcfgContainer [2024-10-13 02:06:55,388 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 02:06:55,388 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 02:06:55,389 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 02:06:55,389 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 02:06:55,389 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:06:46" (3/4) ... [2024-10-13 02:06:55,391 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 02:06:55,392 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 02:06:55,393 INFO L158 Benchmark]: Toolchain (without parser) took 9998.63ms. Allocated memory was 165.7MB in the beginning and 249.6MB in the end (delta: 83.9MB). Free memory was 131.0MB in the beginning and 206.6MB in the end (delta: -75.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-13 02:06:55,393 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 109.1MB. Free memory is still 78.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 02:06:55,393 INFO L158 Benchmark]: CACSL2BoogieTranslator took 421.61ms. Allocated memory is still 165.7MB. Free memory was 131.0MB in the beginning and 114.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 02:06:55,394 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.14ms. Allocated memory is still 165.7MB. Free memory was 114.1MB in the beginning and 111.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 02:06:55,394 INFO L158 Benchmark]: Boogie Preprocessor took 66.11ms. Allocated memory is still 165.7MB. Free memory was 111.2MB in the beginning and 107.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 02:06:55,394 INFO L158 Benchmark]: RCFGBuilder took 668.62ms. Allocated memory is still 165.7MB. Free memory was 107.0MB in the beginning and 110.9MB in the end (delta: -3.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 02:06:55,395 INFO L158 Benchmark]: TraceAbstraction took 8778.31ms. Allocated memory was 165.7MB in the beginning and 249.6MB in the end (delta: 83.9MB). Free memory was 110.9MB in the beginning and 207.7MB in the end (delta: -96.7MB). Peak memory consumption was 130.8MB. Max. memory is 16.1GB. [2024-10-13 02:06:55,395 INFO L158 Benchmark]: Witness Printer took 3.78ms. Allocated memory is still 249.6MB. Free memory is still 206.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 02:06:55,397 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 109.1MB. Free memory is still 78.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 421.61ms. Allocated memory is still 165.7MB. Free memory was 131.0MB in the beginning and 114.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.14ms. Allocated memory is still 165.7MB. Free memory was 114.1MB in the beginning and 111.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.11ms. Allocated memory is still 165.7MB. Free memory was 111.2MB in the beginning and 107.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 668.62ms. Allocated memory is still 165.7MB. Free memory was 107.0MB in the beginning and 110.9MB in the end (delta: -3.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 8778.31ms. Allocated memory was 165.7MB in the beginning and 249.6MB in the end (delta: 83.9MB). Free memory was 110.9MB in the beginning and 207.7MB in the end (delta: -96.7MB). Peak memory consumption was 130.8MB. Max. memory is 16.1GB. * Witness Printer took 3.78ms. Allocated memory is still 249.6MB. Free memory is still 206.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 195, overapproximation of someBinaryArithmeticDOUBLEoperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 195, overapproximation of someBinaryArithmeticFLOAToperation at line 104. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -1; [L23] float var_1_3 = 32.4; [L24] float var_1_4 = 5.5; [L25] float var_1_5 = 255.475; [L26] unsigned char var_1_7 = 0; [L27] signed char var_1_8 = -5; [L28] signed char var_1_9 = 2; [L29] unsigned char var_1_10 = 16; [L30] unsigned char var_1_11 = 16; [L31] float var_1_12 = 10000000.8; [L32] float var_1_13 = 127.7; [L33] float var_1_14 = 199.2; [L34] float var_1_15 = 999999.5; [L35] signed long int var_1_16 = -8; [L36] signed short int var_1_18 = -8; [L37] double var_1_19 = 5.4; [L38] unsigned char var_1_20 = 0; [L39] unsigned char var_1_21 = 0; [L40] signed char var_1_22 = 1; [L41] signed short int var_1_25 = 32; [L42] unsigned char var_1_27 = 0; [L43] unsigned char var_1_28 = 0; [L44] unsigned long int var_1_29 = 5; [L45] unsigned long int var_1_30 = 4; [L46] unsigned char var_1_31 = 2; [L47] unsigned char var_1_34 = 5; [L48] unsigned char var_1_35 = 25; [L49] unsigned char var_1_36 = 10; [L50] unsigned short int var_1_37 = 64; [L51] unsigned short int var_1_38 = 16; [L52] signed long int var_1_39 = -50; [L53] signed char last_1_var_1_1 = -1; [L54] unsigned char last_1_var_1_10 = 16; [L55] signed long int last_1_var_1_16 = -8; [L199] isInitial = 1 [L200] FCALL initially() [L201] COND TRUE 1 [L202] CALL updateLastVariables() [L190] last_1_var_1_1 = var_1_1 [L191] last_1_var_1_10 = var_1_10 [L192] last_1_var_1_16 = var_1_16 [L202] RET updateLastVariables() [L203] CALL updateVariables() [L142] var_1_3 = __VERIFIER_nondet_float() [L143] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_4=11/2, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_4=11/2, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L143] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_4=11/2, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L144] CALL assume_abort_if_not(var_1_3 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_4=11/2, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_4=11/2, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L144] RET assume_abort_if_not(var_1_3 != 0.0F) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_4=11/2, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L145] var_1_4 = __VERIFIER_nondet_float() [L146] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L146] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L147] var_1_5 = __VERIFIER_nondet_float() [L148] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=0, var_1_8=-5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=0, var_1_8=-5, var_1_9=2] [L148] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=0, var_1_8=-5, var_1_9=2] [L149] var_1_7 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_8=-5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_8=-5, var_1_9=2] [L150] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_8=-5, var_1_9=2] [L151] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-5, var_1_9=2] [L151] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-5, var_1_9=2] [L152] var_1_8 = __VERIFIER_nondet_char() [L153] CALL assume_abort_if_not(var_1_8 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=2] [L153] RET assume_abort_if_not(var_1_8 >= -127) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=2] [L154] CALL assume_abort_if_not(var_1_8 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=2] [L154] RET assume_abort_if_not(var_1_8 <= 126) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=2] [L155] var_1_9 = __VERIFIER_nondet_char() [L156] CALL assume_abort_if_not(var_1_9 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L156] RET assume_abort_if_not(var_1_9 >= -127) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L157] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L157] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L158] var_1_11 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L159] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L160] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L160] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L161] var_1_13 = __VERIFIER_nondet_float() [L162] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L162] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L163] var_1_14 = __VERIFIER_nondet_float() [L164] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L164] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L165] var_1_15 = __VERIFIER_nondet_float() [L166] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L166] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L167] var_1_21 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L168] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L169] CALL assume_abort_if_not(var_1_21 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L169] RET assume_abort_if_not(var_1_21 <= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L170] var_1_25 = __VERIFIER_nondet_short() [L171] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L171] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L172] CALL assume_abort_if_not(var_1_25 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L172] RET assume_abort_if_not(var_1_25 <= 32) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L173] var_1_28 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L174] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L175] CALL assume_abort_if_not(var_1_28 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L175] RET assume_abort_if_not(var_1_28 <= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L176] var_1_30 = __VERIFIER_nondet_ulong() [L177] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L177] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L178] CALL assume_abort_if_not(var_1_30 <= 8) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L178] RET assume_abort_if_not(var_1_30 <= 8) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L179] var_1_34 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L180] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L181] CALL assume_abort_if_not(var_1_34 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L181] RET assume_abort_if_not(var_1_34 <= 127) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L182] var_1_35 = __VERIFIER_nondet_uchar() [L183] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L183] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L184] CALL assume_abort_if_not(var_1_35 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L184] RET assume_abort_if_not(var_1_35 <= 127) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L185] var_1_36 = __VERIFIER_nondet_uchar() [L186] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L186] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L187] CALL assume_abort_if_not(var_1_36 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L187] RET assume_abort_if_not(var_1_36 <= 127) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L203] RET updateVariables() [L204] CALL step() [L59] signed long int stepLocal_0 = last_1_var_1_16; VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, stepLocal_0=-8, var_1_10=16, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L60] COND FALSE !(var_1_9 < stepLocal_0) [L65] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=-255, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L67] COND TRUE 64 >= (10 * var_1_16) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=-255, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L68] EXPR var_1_16 >> var_1_30 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=-255, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L68] COND FALSE !(var_1_25 <= (var_1_16 >> var_1_30)) [L71] var_1_29 = var_1_25 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=-255, var_1_11=-255, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L74] COND TRUE \read(var_1_7) [L75] var_1_16 = var_1_8 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=-255, var_1_11=-255, var_1_12=50000004/5, var_1_16=2, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L79] EXPR var_1_11 >> var_1_25 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=-255, var_1_11=-255, var_1_12=50000004/5, var_1_16=2, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L79] COND FALSE !(var_1_1 > ((var_1_11 >> var_1_25) * var_1_10)) [L82] EXPR var_1_30 & var_1_11 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=-255, var_1_11=-255, var_1_12=50000004/5, var_1_16=2, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L82] COND FALSE !(var_1_16 < (var_1_30 & var_1_11)) [L87] COND TRUE var_1_9 >= var_1_11 [L88] var_1_37 = ((((var_1_35) < 0 ) ? -(var_1_35) : (var_1_35))) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=-255, var_1_11=-255, var_1_12=50000004/5, var_1_16=2, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L92] COND TRUE 100.75 >= ((((var_1_4 + var_1_3) < 0 ) ? -(var_1_4 + var_1_3) : (var_1_4 + var_1_3))) [L93] var_1_39 = ((((var_1_11) < (var_1_34)) ? (var_1_11) : (var_1_34))) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=-255, var_1_11=-255, var_1_12=50000004/5, var_1_16=2, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=0, var_1_7=1, var_1_8=2, var_1_9=1] [L95] signed long int stepLocal_2 = last_1_var_1_10; VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, stepLocal_2=16, var_1_10=-255, var_1_11=-255, var_1_12=50000004/5, var_1_16=2, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=0, var_1_7=1, var_1_8=2, var_1_9=1] [L96] COND TRUE ! (last_1_var_1_1 > last_1_var_1_10) [L97] var_1_19 = ((((var_1_13) > ((((((0.05 + var_1_15)) < (var_1_14)) ? ((0.05 + var_1_15)) : (var_1_14))))) ? (var_1_13) : ((((((0.05 + var_1_15)) < (var_1_14)) ? ((0.05 + var_1_15)) : (var_1_14)))))) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, stepLocal_2=16, var_1_10=-255, var_1_11=-255, var_1_12=50000004/5, var_1_13=2, var_1_14=0, var_1_16=2, var_1_18=-8, var_1_19=2, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=0, var_1_7=1, var_1_8=2, var_1_9=1] [L103] COND TRUE var_1_5 <= (var_1_19 / var_1_3) [L104] var_1_12 = ((((var_1_13) > ((var_1_14 + var_1_15))) ? (var_1_13) : ((var_1_14 + var_1_15)))) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, stepLocal_2=16, var_1_10=-255, var_1_11=-255, var_1_12=2, var_1_13=2, var_1_14=0, var_1_16=2, var_1_18=-8, var_1_19=2, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=0, var_1_7=1, var_1_8=2, var_1_9=1] [L108] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, stepLocal_2=16, var_1_10=-255, var_1_11=-255, var_1_12=2, var_1_13=2, var_1_14=0, var_1_16=2, var_1_18=-8, var_1_19=2, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=0, var_1_7=1, var_1_8=2, var_1_9=1] [L109] COND FALSE !((var_1_12 / var_1_3) > ((var_1_4 - var_1_5) * var_1_19)) [L116] var_1_1 = var_1_8 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, stepLocal_2=16, var_1_10=-255, var_1_11=-255, var_1_12=2, var_1_13=2, var_1_14=0, var_1_16=2, var_1_18=-8, var_1_19=2, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=0, var_1_7=1, var_1_8=2, var_1_9=1] [L118] COND FALSE !((-128 >> 10u) >= var_1_10) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, stepLocal_2=16, var_1_10=-255, var_1_11=-255, var_1_12=2, var_1_13=2, var_1_14=0, var_1_16=2, var_1_18=-8, var_1_19=2, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=0, var_1_7=1, var_1_8=2, var_1_9=1] [L123] signed char stepLocal_1 = var_1_1; VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, stepLocal_1=2, stepLocal_2=16, var_1_10=-255, var_1_11=-255, var_1_12=2, var_1_13=2, var_1_14=0, var_1_16=2, var_1_18=-8, var_1_19=2, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=0, var_1_7=1, var_1_8=2, var_1_9=1] [L124] COND FALSE !(stepLocal_1 >= (var_1_16 + var_1_10)) [L135] var_1_18 = var_1_8 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, stepLocal_2=16, var_1_10=-255, var_1_11=-255, var_1_12=2, var_1_13=2, var_1_14=0, var_1_16=2, var_1_18=2, var_1_19=2, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=0, var_1_7=1, var_1_8=2, var_1_9=1] [L137] COND TRUE var_1_11 < var_1_16 [L138] var_1_38 = (((((((5) < (var_1_25)) ? (5) : (var_1_25))) < 0 ) ? -((((5) < (var_1_25)) ? (5) : (var_1_25))) : ((((5) < (var_1_25)) ? (5) : (var_1_25))))) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, stepLocal_2=16, var_1_10=-255, var_1_11=-255, var_1_12=2, var_1_13=2, var_1_14=0, var_1_16=2, var_1_18=2, var_1_19=2, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=1, var_1_8=2, var_1_9=1] [L204] RET step() [L205] CALL, EXPR property() [L195-L196] return (((((((var_1_12 / var_1_3) > ((var_1_4 - var_1_5) * var_1_19)) ? (var_1_7 ? (var_1_1 == ((signed char) var_1_8)) : (var_1_1 == ((signed char) var_1_9))) : (var_1_1 == ((signed char) var_1_8))) && ((var_1_9 < last_1_var_1_16) ? (((var_1_4 - var_1_5) > var_1_3) ? (var_1_10 == ((unsigned char) 8)) : 1) : (var_1_10 == ((unsigned char) var_1_11)))) && ((var_1_5 <= (var_1_19 / var_1_3)) ? (var_1_12 == ((float) ((((var_1_13) > ((var_1_14 + var_1_15))) ? (var_1_13) : ((var_1_14 + var_1_15)))))) : (var_1_12 == ((float) var_1_14)))) && (var_1_7 ? (var_1_16 == ((signed long int) var_1_8)) : (var_1_16 == ((signed long int) (var_1_11 - ((((var_1_10 - var_1_10) < 0 ) ? -(var_1_10 - var_1_10) : (var_1_10 - var_1_10)))))))) && ((var_1_1 >= (var_1_16 + var_1_10)) ? ((var_1_5 < 999.5f) ? (var_1_7 ? (var_1_18 == ((signed short int) (var_1_16 + var_1_16))) : (var_1_18 == ((signed short int) var_1_8))) : (var_1_18 == ((signed short int) var_1_9))) : (var_1_18 == ((signed short int) var_1_8)))) && ((! (last_1_var_1_1 > last_1_var_1_10)) ? (var_1_19 == ((double) ((((var_1_13) > ((((((0.05 + var_1_15)) < (var_1_14)) ? ((0.05 + var_1_15)) : (var_1_14))))) ? (var_1_13) : ((((((0.05 + var_1_15)) < (var_1_14)) ? ((0.05 + var_1_15)) : (var_1_14)))))))) : ((last_1_var_1_10 > var_1_9) ? (var_1_19 == ((double) var_1_15)) : 1)) ; [L205] RET, EXPR property() [L205] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=-255, var_1_11=-255, var_1_12=2, var_1_13=2, var_1_14=0, var_1_16=2, var_1_18=2, var_1_19=2, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=1, var_1_8=2, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=-255, var_1_11=-255, var_1_12=2, var_1_13=2, var_1_14=0, var_1_16=2, var_1_18=2, var_1_19=2, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=1, var_1_8=2, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.5s, OverallIterations: 7, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1154 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1109 mSDsluCounter, 2281 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1500 mSDsCounter, 363 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1954 IncrementalHoareTripleChecker+Invalid, 2317 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 363 mSolverCounterUnsat, 781 mSDtfsCounter, 1954 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 924 GetRequests, 879 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=346occurred in iteration=4, InterpolantAutomatonStates: 42, 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, 6 MinimizatonAttempts, 242 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 1866 NumberOfCodeBlocks, 1866 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1484 ConstructedInterpolants, 0 QuantifiedInterpolants, 4415 SizeOfPredicates, 4 NumberOfNonLiveVariables, 873 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 12893/12992 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-13 02:06:55,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-18.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0ddfed299cddd9e32e0c725c50eded2fe88f31aaefb86ca27530d10afeb40c79 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 02:06:57,779 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 02:06:57,867 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 02:06:57,873 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 02:06:57,874 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 02:06:57,903 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 02:06:57,904 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 02:06:57,904 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 02:06:57,905 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 02:06:57,905 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 02:06:57,906 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 02:06:57,906 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 02:06:57,906 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 02:06:57,907 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 02:06:57,907 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 02:06:57,907 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 02:06:57,908 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 02:06:57,908 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 02:06:57,908 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 02:06:57,909 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 02:06:57,913 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 02:06:57,913 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 02:06:57,914 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 02:06:57,914 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 02:06:57,914 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 02:06:57,914 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 02:06:57,915 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 02:06:57,915 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 02:06:57,915 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 02:06:57,916 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 02:06:57,916 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 02:06:57,916 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 02:06:57,916 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 02:06:57,917 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 02:06:57,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:06:57,921 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 02:06:57,922 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 02:06:57,922 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 02:06:57,922 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 02:06:57,923 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 02:06:57,924 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 02:06:57,924 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 02:06:57,925 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 02:06:57,925 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 02:06:57,925 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 02:06:57,926 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0ddfed299cddd9e32e0c725c50eded2fe88f31aaefb86ca27530d10afeb40c79 [2024-10-13 02:06:58,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 02:06:58,310 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 02:06:58,313 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 02:06:58,314 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 02:06:58,316 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 02:06:58,318 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-18.i [2024-10-13 02:06:59,830 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 02:07:00,062 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 02:07:00,064 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-18.i [2024-10-13 02:07:00,084 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae4c0553e/811239d0da6c4c6f92d484e9a5d4f8f7/FLAG6f0be82e0 [2024-10-13 02:07:00,107 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae4c0553e/811239d0da6c4c6f92d484e9a5d4f8f7 [2024-10-13 02:07:00,110 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 02:07:00,112 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 02:07:00,115 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 02:07:00,115 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 02:07:00,120 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 02:07:00,122 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:07:00" (1/1) ... [2024-10-13 02:07:00,123 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@516ce294 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:07:00, skipping insertion in model container [2024-10-13 02:07:00,124 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:07:00" (1/1) ... [2024-10-13 02:07:00,178 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 02:07:00,366 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_fillercode_fillercodestructure_filler-pr-ci_file-18.i[919,932] [2024-10-13 02:07:00,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:07:00,481 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 02:07:00,494 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_fillercode_fillercodestructure_filler-pr-ci_file-18.i[919,932] [2024-10-13 02:07:00,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:07:00,569 INFO L204 MainTranslator]: Completed translation [2024-10-13 02:07:00,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:07:00 WrapperNode [2024-10-13 02:07:00,570 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 02:07:00,571 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 02:07:00,571 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 02:07:00,572 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 02:07:00,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:07:00" (1/1) ... [2024-10-13 02:07:00,598 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:07:00" (1/1) ... [2024-10-13 02:07:00,637 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 200 [2024-10-13 02:07:00,640 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 02:07:00,641 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 02:07:00,642 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 02:07:00,642 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 02:07:00,652 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:07:00" (1/1) ... [2024-10-13 02:07:00,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:07:00" (1/1) ... [2024-10-13 02:07:00,657 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:07:00" (1/1) ... [2024-10-13 02:07:00,671 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-13 02:07:00,672 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:07:00" (1/1) ... [2024-10-13 02:07:00,672 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:07:00" (1/1) ... [2024-10-13 02:07:00,695 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:07:00" (1/1) ... [2024-10-13 02:07:00,702 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:07:00" (1/1) ... [2024-10-13 02:07:00,709 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:07:00" (1/1) ... [2024-10-13 02:07:00,714 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:07:00" (1/1) ... [2024-10-13 02:07:00,723 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 02:07:00,728 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 02:07:00,728 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 02:07:00,728 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 02:07:00,729 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:07:00" (1/1) ... [2024-10-13 02:07:00,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:07:00,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:07:00,773 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 02:07:00,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 02:07:00,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 02:07:00,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 02:07:00,819 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 02:07:00,819 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 02:07:00,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 02:07:00,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 02:07:00,902 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 02:07:00,904 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 02:07:24,431 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-13 02:07:24,432 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 02:07:24,489 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 02:07:24,489 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 02:07:24,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:07:24 BoogieIcfgContainer [2024-10-13 02:07:24,489 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 02:07:24,491 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 02:07:24,491 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 02:07:24,498 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 02:07:24,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:07:00" (1/3) ... [2024-10-13 02:07:24,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b34f62a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:07:24, skipping insertion in model container [2024-10-13 02:07:24,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:07:00" (2/3) ... [2024-10-13 02:07:24,503 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b34f62a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:07:24, skipping insertion in model container [2024-10-13 02:07:24,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:07:24" (3/3) ... [2024-10-13 02:07:24,504 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-18.i [2024-10-13 02:07:24,524 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 02:07:24,524 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 02:07:24,605 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 02:07:24,612 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;@13f00774, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 02:07:24,612 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 02:07:24,616 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 52 states have internal predecessors, (77), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-13 02:07:24,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-13 02:07:24,629 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:07:24,630 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 02:07:24,631 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:07:24,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:07:24,636 INFO L85 PathProgramCache]: Analyzing trace with hash 991443149, now seen corresponding path program 1 times [2024-10-13 02:07:24,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:07:24,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1572926681] [2024-10-13 02:07:24,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:07:24,650 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-13 02:07:24,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:07:24,653 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:07:24,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 02:07:25,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:07:26,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 02:07:26,056 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:07:26,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 804 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2024-10-13 02:07:26,131 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:07:26,132 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:07:26,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1572926681] [2024-10-13 02:07:26,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1572926681] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:07:26,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:07:26,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:07:26,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185648099] [2024-10-13 02:07:26,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:07:26,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 02:07:26,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:07:26,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 02:07:26,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:07:26,181 INFO L87 Difference]: Start difference. First operand has 83 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 52 states have internal predecessors, (77), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-13 02:07:30,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.60s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:07:30,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:07:30,878 INFO L93 Difference]: Finished difference Result 162 states and 295 transitions. [2024-10-13 02:07:31,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 02:07:31,055 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 183 [2024-10-13 02:07:31,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:07:31,062 INFO L225 Difference]: With dead ends: 162 [2024-10-13 02:07:31,063 INFO L226 Difference]: Without dead ends: 80 [2024-10-13 02:07:31,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 182 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-13 02:07:31,070 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-10-13 02:07:31,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2024-10-13 02:07:31,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-13 02:07:31,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-10-13 02:07:31,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 49 states have internal predecessors, (69), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-13 02:07:31,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 127 transitions. [2024-10-13 02:07:31,127 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 127 transitions. Word has length 183 [2024-10-13 02:07:31,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:07:31,128 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 127 transitions. [2024-10-13 02:07:31,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-13 02:07:31,129 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 127 transitions. [2024-10-13 02:07:31,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-13 02:07:31,133 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:07:31,133 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 02:07:31,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 02:07:31,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:07:31,335 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:07:31,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:07:31,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1100034435, now seen corresponding path program 1 times [2024-10-13 02:07:31,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:07:31,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2053568978] [2024-10-13 02:07:31,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:07:31,337 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-13 02:07:31,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:07:31,341 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:07:31,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 02:07:32,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:07:32,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 02:07:32,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:07:39,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-13 02:07:39,923 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:07:39,923 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:07:39,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2053568978] [2024-10-13 02:07:39,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2053568978] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:07:39,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:07:39,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:07:39,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262509717] [2024-10-13 02:07:39,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:07:39,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:07:39,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:07:39,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:07:39,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:07:39,930 INFO L87 Difference]: Start difference. First operand 80 states and 127 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 02:07:44,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.44s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:07:48,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:07:49,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:07:49,077 INFO L93 Difference]: Finished difference Result 215 states and 342 transitions. [2024-10-13 02:07:49,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:07:49,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 183 [2024-10-13 02:07:49,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:07:49,086 INFO L225 Difference]: With dead ends: 215 [2024-10-13 02:07:49,086 INFO L226 Difference]: Without dead ends: 136 [2024-10-13 02:07:49,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:07:49,088 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 6 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:07:49,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 232 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 2 Unknown, 0 Unchecked, 9.1s Time] [2024-10-13 02:07:49,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-13 02:07:49,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2024-10-13 02:07:49,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 73 states have (on average 1.3013698630136987) internal successors, (95), 73 states have internal predecessors, (95), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-13 02:07:49,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 211 transitions. [2024-10-13 02:07:49,136 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 211 transitions. Word has length 183 [2024-10-13 02:07:49,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:07:49,147 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 211 transitions. [2024-10-13 02:07:49,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 02:07:49,147 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 211 transitions. [2024-10-13 02:07:49,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-13 02:07:49,151 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:07:49,151 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 02:07:49,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-13 02:07:49,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:07:49,352 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:07:49,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:07:49,353 INFO L85 PathProgramCache]: Analyzing trace with hash 43013255, now seen corresponding path program 1 times [2024-10-13 02:07:49,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:07:49,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [269994538] [2024-10-13 02:07:49,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:07:49,354 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-13 02:07:49,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:07:49,358 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:07:49,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 02:07:50,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:07:50,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 02:07:50,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:08:02,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 810 proven. 33 refuted. 0 times theorem prover too weak. 781 trivial. 0 not checked. [2024-10-13 02:08:02,319 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:08:02,986 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:08:02,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [269994538] [2024-10-13 02:08:02,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [269994538] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 02:08:02,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1302961425] [2024-10-13 02:08:02,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:08:02,987 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 02:08:02,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 02:08:02,990 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 02:08:02,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-10-13 02:08:05,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:08:05,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 02:08:05,824 INFO L278 TraceCheckSpWp]: Computing forward predicates...