./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-15.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-15.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 ffd456b3aee4a03e3ad29674b9135df7e42dac45ab32681ea39048340b5ac3f8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 15:56:26,845 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 15:56:26,935 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 15:56:26,942 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 15:56:26,942 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 15:56:26,976 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 15:56:26,977 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 15:56:26,977 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 15:56:26,978 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 15:56:26,980 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 15:56:26,980 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 15:56:26,980 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 15:56:26,981 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 15:56:26,983 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 15:56:26,983 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 15:56:26,983 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 15:56:26,984 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 15:56:26,984 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 15:56:26,984 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 15:56:26,984 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 15:56:26,985 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 15:56:26,989 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 15:56:26,989 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 15:56:26,989 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 15:56:26,989 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 15:56:26,990 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 15:56:26,990 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 15:56:26,990 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 15:56:26,990 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 15:56:26,991 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 15:56:26,991 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 15:56:26,991 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 15:56:26,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:56:26,992 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 15:56:26,992 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 15:56:26,993 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 15:56:26,993 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 15:56:26,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 15:56:26,993 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 15:56:26,993 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 15:56:26,994 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 15:56:26,994 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 15:56:26,994 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 -> ffd456b3aee4a03e3ad29674b9135df7e42dac45ab32681ea39048340b5ac3f8 [2024-11-16 15:56:27,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 15:56:27,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 15:56:27,253 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 15:56:27,254 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 15:56:27,255 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 15:56:27,256 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-15.i [2024-11-16 15:56:28,579 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 15:56:28,782 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 15:56:28,784 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-15.i [2024-11-16 15:56:28,794 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f43449fda/6cd64d6080654a8db2d3649ab0cf971d/FLAGbb13ea2f3 [2024-11-16 15:56:28,808 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f43449fda/6cd64d6080654a8db2d3649ab0cf971d [2024-11-16 15:56:28,811 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 15:56:28,812 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 15:56:28,813 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 15:56:28,813 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 15:56:28,818 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 15:56:28,819 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:56:28" (1/1) ... [2024-11-16 15:56:28,820 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6838e634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:28, skipping insertion in model container [2024-11-16 15:56:28,820 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:56:28" (1/1) ... [2024-11-16 15:56:28,849 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 15:56:29,045 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-15.i[916,929] [2024-11-16 15:56:29,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:56:29,170 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 15:56:29,183 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-15.i[916,929] [2024-11-16 15:56:29,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:56:29,230 INFO L204 MainTranslator]: Completed translation [2024-11-16 15:56:29,231 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:29 WrapperNode [2024-11-16 15:56:29,231 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 15:56:29,232 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 15:56:29,232 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 15:56:29,232 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 15:56:29,239 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:29" (1/1) ... [2024-11-16 15:56:29,255 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:29" (1/1) ... [2024-11-16 15:56:29,306 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 267 [2024-11-16 15:56:29,306 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 15:56:29,308 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 15:56:29,308 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 15:56:29,308 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 15:56:29,318 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:29" (1/1) ... [2024-11-16 15:56:29,319 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:29" (1/1) ... [2024-11-16 15:56:29,323 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:29" (1/1) ... [2024-11-16 15:56:29,351 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 15:56:29,355 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:29" (1/1) ... [2024-11-16 15:56:29,355 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:29" (1/1) ... [2024-11-16 15:56:29,374 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:29" (1/1) ... [2024-11-16 15:56:29,375 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:29" (1/1) ... [2024-11-16 15:56:29,377 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:29" (1/1) ... [2024-11-16 15:56:29,379 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:29" (1/1) ... [2024-11-16 15:56:29,383 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 15:56:29,384 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 15:56:29,384 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 15:56:29,384 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 15:56:29,385 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:29" (1/1) ... [2024-11-16 15:56:29,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:56:29,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:56:29,418 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 15:56:29,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 15:56:29,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 15:56:29,459 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 15:56:29,459 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 15:56:29,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 15:56:29,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 15:56:29,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 15:56:29,561 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 15:56:29,567 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 15:56:30,048 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L193: havoc property_#t~bitwise23#1;havoc property_#t~bitwise24#1;havoc property_#t~short25#1;havoc property_#t~bitwise26#1;havoc property_#t~short27#1; [2024-11-16 15:56:30,095 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-16 15:56:30,095 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 15:56:30,121 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 15:56:30,123 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 15:56:30,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:56:30 BoogieIcfgContainer [2024-11-16 15:56:30,124 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 15:56:30,127 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 15:56:30,127 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 15:56:30,130 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 15:56:30,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:56:28" (1/3) ... [2024-11-16 15:56:30,131 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5da7e7f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:56:30, skipping insertion in model container [2024-11-16 15:56:30,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:29" (2/3) ... [2024-11-16 15:56:30,132 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5da7e7f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:56:30, skipping insertion in model container [2024-11-16 15:56:30,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:56:30" (3/3) ... [2024-11-16 15:56:30,133 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-15.i [2024-11-16 15:56:30,151 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 15:56:30,152 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 15:56:30,227 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 15:56:30,233 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;@1985c3d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 15:56:30,234 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 15:56:30,239 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 86 states have internal predecessors, (123), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 15:56:30,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-16 15:56:30,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:56:30,258 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:56:30,259 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:56:30,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:56:30,265 INFO L85 PathProgramCache]: Analyzing trace with hash 907310196, now seen corresponding path program 1 times [2024-11-16 15:56:30,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:56:30,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640496034] [2024-11-16 15:56:30,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:56:30,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:56:30,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:30,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:56:30,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:30,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:56:30,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:30,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:56:30,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:30,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:56:30,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:30,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:56:30,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:30,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:56:30,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:30,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 15:56:30,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:30,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:56:30,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:30,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 15:56:30,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:30,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 15:56:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:30,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 15:56:30,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:30,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:56:30,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:30,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:56:30,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:30,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:56:30,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:30,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 15:56:30,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:30,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 15:56:30,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:30,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 15:56:30,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:30,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 15:56:30,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:30,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 15:56:30,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:30,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 15:56:30,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:30,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 15:56:30,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:30,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 15:56:30,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:30,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 15:56:30,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:30,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 15:56:30,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:30,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 15:56:30,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:30,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 15:56:30,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:30,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 15:56:30,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:30,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 15:56:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:30,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 15:56:30,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:56:30,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640496034] [2024-11-16 15:56:30,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640496034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:56:30,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:56:30,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 15:56:30,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623839332] [2024-11-16 15:56:30,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:56:30,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 15:56:30,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:56:31,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 15:56:31,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:56:31,018 INFO L87 Difference]: Start difference. First operand has 116 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 86 states have internal predecessors, (123), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 15:56:31,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:56:31,186 INFO L93 Difference]: Finished difference Result 335 states and 575 transitions. [2024-11-16 15:56:31,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 15:56:31,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 190 [2024-11-16 15:56:31,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:56:31,200 INFO L225 Difference]: With dead ends: 335 [2024-11-16 15:56:31,200 INFO L226 Difference]: Without dead ends: 214 [2024-11-16 15:56:31,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:56:31,207 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 156 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 15:56:31,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 457 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 15:56:31,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-16 15:56:31,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 138. [2024-11-16 15:56:31,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 108 states have (on average 1.4444444444444444) internal successors, (156), 108 states have internal predecessors, (156), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 15:56:31,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 212 transitions. [2024-11-16 15:56:31,269 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 212 transitions. Word has length 190 [2024-11-16 15:56:31,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:56:31,271 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 212 transitions. [2024-11-16 15:56:31,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 15:56:31,272 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 212 transitions. [2024-11-16 15:56:31,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-16 15:56:31,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:56:31,276 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:56:31,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 15:56:31,276 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:56:31,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:56:31,277 INFO L85 PathProgramCache]: Analyzing trace with hash 938330003, now seen corresponding path program 1 times [2024-11-16 15:56:31,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:56:31,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560251268] [2024-11-16 15:56:31,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:56:31,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:56:31,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:31,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:56:31,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:31,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:56:31,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:31,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:56:31,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:31,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:56:31,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:31,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:56:31,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:31,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:56:31,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:31,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 15:56:31,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:31,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:56:31,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:31,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 15:56:31,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:31,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 15:56:31,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:31,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 15:56:31,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:31,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:56:31,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:31,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:56:31,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:31,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:56:31,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:31,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 15:56:31,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:31,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 15:56:31,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:31,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 15:56:31,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:31,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 15:56:31,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:31,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 15:56:31,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:31,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 15:56:31,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:31,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 15:56:31,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:31,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 15:56:31,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:31,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 15:56:31,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:31,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 15:56:31,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:31,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 15:56:31,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:31,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 15:56:31,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:31,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 15:56:31,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:31,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 15:56:31,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:31,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 15:56:31,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:56:31,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560251268] [2024-11-16 15:56:31,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560251268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:56:31,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:56:31,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 15:56:31,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437573603] [2024-11-16 15:56:31,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:56:31,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 15:56:31,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:56:31,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 15:56:31,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:56:31,637 INFO L87 Difference]: Start difference. First operand 138 states and 212 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 15:56:31,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:56:31,777 INFO L93 Difference]: Finished difference Result 408 states and 630 transitions. [2024-11-16 15:56:31,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 15:56:31,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 190 [2024-11-16 15:56:31,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:56:31,785 INFO L225 Difference]: With dead ends: 408 [2024-11-16 15:56:31,787 INFO L226 Difference]: Without dead ends: 273 [2024-11-16 15:56:31,789 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-11-16 15:56:31,789 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 146 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 15:56:31,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 371 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 15:56:31,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-11-16 15:56:31,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 209. [2024-11-16 15:56:31,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 179 states have (on average 1.4916201117318435) internal successors, (267), 179 states have internal predecessors, (267), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 15:56:31,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 323 transitions. [2024-11-16 15:56:31,813 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 323 transitions. Word has length 190 [2024-11-16 15:56:31,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:56:31,815 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 323 transitions. [2024-11-16 15:56:31,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 15:56:31,816 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 323 transitions. [2024-11-16 15:56:31,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-16 15:56:31,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:56:31,821 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:56:31,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 15:56:31,822 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:56:31,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:56:31,823 INFO L85 PathProgramCache]: Analyzing trace with hash -757533520, now seen corresponding path program 1 times [2024-11-16 15:56:31,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:56:31,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177986179] [2024-11-16 15:56:31,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:56:31,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:56:31,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:56:32,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:56:32,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:56:32,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:56:32,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:56:32,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:56:32,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 15:56:32,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:56:32,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 15:56:32,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 15:56:32,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 15:56:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:56:32,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:56:32,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:56:32,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 15:56:32,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 15:56:32,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 15:56:32,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 15:56:32,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 15:56:32,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 15:56:32,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 15:56:32,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 15:56:32,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 15:56:32,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 15:56:32,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 15:56:32,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 15:56:32,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 15:56:32,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 15:56:32,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 15:56:32,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:56:32,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177986179] [2024-11-16 15:56:32,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177986179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:56:32,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:56:32,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 15:56:32,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562445129] [2024-11-16 15:56:32,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:56:32,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 15:56:32,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:56:32,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 15:56:32,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 15:56:32,177 INFO L87 Difference]: Start difference. First operand 209 states and 323 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 15:56:32,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:56:32,326 INFO L93 Difference]: Finished difference Result 565 states and 871 transitions. [2024-11-16 15:56:32,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 15:56:32,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 191 [2024-11-16 15:56:32,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:56:32,331 INFO L225 Difference]: With dead ends: 565 [2024-11-16 15:56:32,331 INFO L226 Difference]: Without dead ends: 359 [2024-11-16 15:56:32,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 15:56:32,334 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 99 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 15:56:32,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 411 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 15:56:32,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-11-16 15:56:32,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 320. [2024-11-16 15:56:32,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 290 states have (on average 1.513793103448276) internal successors, (439), 290 states have internal predecessors, (439), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 15:56:32,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 495 transitions. [2024-11-16 15:56:32,351 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 495 transitions. Word has length 191 [2024-11-16 15:56:32,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:56:32,352 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 495 transitions. [2024-11-16 15:56:32,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 15:56:32,352 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 495 transitions. [2024-11-16 15:56:32,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-16 15:56:32,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:56:32,358 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:56:32,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 15:56:32,361 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:56:32,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:56:32,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1682747912, now seen corresponding path program 1 times [2024-11-16 15:56:32,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:56:32,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568904022] [2024-11-16 15:56:32,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:56:32,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:56:32,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:56:32,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:56:32,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:56:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:56:32,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:56:32,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:56:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 15:56:32,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:56:32,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 15:56:32,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 15:56:32,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 15:56:32,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:56:32,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:56:32,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:56:32,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 15:56:32,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 15:56:32,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 15:56:32,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 15:56:32,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 15:56:32,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 15:56:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 15:56:32,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 15:56:32,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 15:56:32,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 15:56:32,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 15:56:32,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 15:56:32,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 15:56:32,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 15:56:32,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 15:56:32,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:56:32,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568904022] [2024-11-16 15:56:32,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568904022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:56:32,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:56:32,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 15:56:32,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979979287] [2024-11-16 15:56:32,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:56:32,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 15:56:32,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:56:32,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 15:56:32,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:56:32,558 INFO L87 Difference]: Start difference. First operand 320 states and 495 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 15:56:32,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:56:32,654 INFO L93 Difference]: Finished difference Result 828 states and 1285 transitions. [2024-11-16 15:56:32,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 15:56:32,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 191 [2024-11-16 15:56:32,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:56:32,661 INFO L225 Difference]: With dead ends: 828 [2024-11-16 15:56:32,662 INFO L226 Difference]: Without dead ends: 511 [2024-11-16 15:56:32,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:56:32,664 INFO L432 NwaCegarLoop]: 306 mSDtfsCounter, 146 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 15:56:32,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 447 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 15:56:32,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2024-11-16 15:56:32,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 320. [2024-11-16 15:56:32,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 290 states have (on average 1.513793103448276) internal successors, (439), 290 states have internal predecessors, (439), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 15:56:32,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 495 transitions. [2024-11-16 15:56:32,696 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 495 transitions. Word has length 191 [2024-11-16 15:56:32,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:56:32,697 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 495 transitions. [2024-11-16 15:56:32,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 15:56:32,697 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 495 transitions. [2024-11-16 15:56:32,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-16 15:56:32,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:56:32,702 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:56:32,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 15:56:32,703 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:56:32,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:56:32,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1428011367, now seen corresponding path program 1 times [2024-11-16 15:56:32,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:56:32,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964951623] [2024-11-16 15:56:32,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:56:32,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:56:32,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:56:32,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:56:32,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:56:32,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:56:32,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:56:32,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:56:32,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 15:56:32,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:56:32,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 15:56:32,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 15:56:32,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 15:56:32,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:56:32,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:56:32,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:56:32,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 15:56:32,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 15:56:32,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 15:56:32,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 15:56:32,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 15:56:32,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 15:56:32,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 15:56:32,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 15:56:32,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 15:56:32,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 15:56:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 15:56:32,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 15:56:32,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 15:56:32,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 15:56:32,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:32,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 15:56:32,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:56:32,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964951623] [2024-11-16 15:56:32,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964951623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:56:32,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:56:32,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 15:56:32,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440417967] [2024-11-16 15:56:32,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:56:32,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 15:56:32,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:56:32,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 15:56:32,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 15:56:32,970 INFO L87 Difference]: Start difference. First operand 320 states and 495 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 15:56:33,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:56:33,107 INFO L93 Difference]: Finished difference Result 707 states and 1094 transitions. [2024-11-16 15:56:33,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 15:56:33,108 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 191 [2024-11-16 15:56:33,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:56:33,111 INFO L225 Difference]: With dead ends: 707 [2024-11-16 15:56:33,111 INFO L226 Difference]: Without dead ends: 390 [2024-11-16 15:56:33,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 15:56:33,113 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 48 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 15:56:33,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 402 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 15:56:33,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-11-16 15:56:33,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 326. [2024-11-16 15:56:33,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 296 states have (on average 1.510135135135135) internal successors, (447), 296 states have internal predecessors, (447), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 15:56:33,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 503 transitions. [2024-11-16 15:56:33,126 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 503 transitions. Word has length 191 [2024-11-16 15:56:33,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:56:33,127 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 503 transitions. [2024-11-16 15:56:33,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 15:56:33,127 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 503 transitions. [2024-11-16 15:56:33,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-16 15:56:33,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:56:33,130 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:56:33,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 15:56:33,131 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:56:33,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:56:33,131 INFO L85 PathProgramCache]: Analyzing trace with hash 450155318, now seen corresponding path program 1 times [2024-11-16 15:56:33,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:56:33,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864377291] [2024-11-16 15:56:33,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:56:33,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:56:33,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:33,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:56:33,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:33,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:56:33,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:33,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:56:33,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:33,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:56:33,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:33,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:56:33,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:33,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:56:33,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:33,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 15:56:33,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:33,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:56:33,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:33,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 15:56:33,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:33,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 15:56:33,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:33,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 15:56:33,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:33,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:56:33,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:33,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:56:33,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:33,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:56:33,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:33,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 15:56:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:33,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 15:56:33,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:33,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 15:56:33,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:33,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 15:56:33,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:33,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 15:56:33,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:33,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 15:56:33,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:33,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 15:56:33,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:33,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 15:56:33,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:33,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 15:56:33,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:33,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 15:56:33,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:33,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 15:56:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:33,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 15:56:33,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:33,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 15:56:33,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:33,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 15:56:33,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:33,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 15:56:33,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:56:33,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864377291] [2024-11-16 15:56:33,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864377291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:56:33,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:56:33,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 15:56:33,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343714774] [2024-11-16 15:56:33,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:56:33,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 15:56:33,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:56:33,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 15:56:33,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 15:56:33,424 INFO L87 Difference]: Start difference. First operand 326 states and 503 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 15:56:33,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:56:33,846 INFO L93 Difference]: Finished difference Result 975 states and 1485 transitions. [2024-11-16 15:56:33,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 15:56:33,847 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 192 [2024-11-16 15:56:33,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:56:33,852 INFO L225 Difference]: With dead ends: 975 [2024-11-16 15:56:33,852 INFO L226 Difference]: Without dead ends: 652 [2024-11-16 15:56:33,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-16 15:56:33,853 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 281 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 15:56:33,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 669 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 15:56:33,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2024-11-16 15:56:33,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 459. [2024-11-16 15:56:33,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 429 states have (on average 1.5128205128205128) internal successors, (649), 429 states have internal predecessors, (649), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 15:56:33,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 705 transitions. [2024-11-16 15:56:33,873 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 705 transitions. Word has length 192 [2024-11-16 15:56:33,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:56:33,875 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 705 transitions. [2024-11-16 15:56:33,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 15:56:33,876 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 705 transitions. [2024-11-16 15:56:33,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-16 15:56:33,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:56:33,879 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:56:33,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 15:56:33,880 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:56:33,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:56:33,880 INFO L85 PathProgramCache]: Analyzing trace with hash 272707507, now seen corresponding path program 1 times [2024-11-16 15:56:33,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:56:33,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54679512] [2024-11-16 15:56:33,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:56:33,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:56:33,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 15:56:33,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1358883834] [2024-11-16 15:56:33,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:56:33,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 15:56:33,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:56:34,002 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 15:56:34,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 15:56:34,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 15:56:34,195 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 15:56:34,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 15:56:34,372 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 15:56:34,373 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 15:56:34,373 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 15:56:34,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 15:56:34,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 15:56:34,579 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:56:34,712 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 15:56:34,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 03:56:34 BoogieIcfgContainer [2024-11-16 15:56:34,714 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 15:56:34,715 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 15:56:34,715 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 15:56:34,715 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 15:56:34,716 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:56:30" (3/4) ... [2024-11-16 15:56:34,718 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 15:56:34,719 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 15:56:34,719 INFO L158 Benchmark]: Toolchain (without parser) took 5907.35ms. Allocated memory was 151.0MB in the beginning and 243.3MB in the end (delta: 92.3MB). Free memory was 94.5MB in the beginning and 116.5MB in the end (delta: -22.0MB). Peak memory consumption was 73.3MB. Max. memory is 16.1GB. [2024-11-16 15:56:34,719 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 151.0MB. Free memory is still 111.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 15:56:34,720 INFO L158 Benchmark]: CACSL2BoogieTranslator took 417.99ms. Allocated memory is still 151.0MB. Free memory was 94.5MB in the beginning and 76.3MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-16 15:56:34,720 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.61ms. Allocated memory is still 151.0MB. Free memory was 76.3MB in the beginning and 71.4MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 15:56:34,720 INFO L158 Benchmark]: Boogie Preprocessor took 75.80ms. Allocated memory is still 151.0MB. Free memory was 71.4MB in the beginning and 65.9MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 15:56:34,720 INFO L158 Benchmark]: IcfgBuilder took 739.88ms. Allocated memory was 151.0MB in the beginning and 195.0MB in the end (delta: 44.0MB). Free memory was 65.5MB in the beginning and 135.9MB in the end (delta: -70.4MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. [2024-11-16 15:56:34,721 INFO L158 Benchmark]: TraceAbstraction took 4587.80ms. Allocated memory was 195.0MB in the beginning and 243.3MB in the end (delta: 48.2MB). Free memory was 135.9MB in the beginning and 116.5MB in the end (delta: 19.4MB). Peak memory consumption was 67.6MB. Max. memory is 16.1GB. [2024-11-16 15:56:34,721 INFO L158 Benchmark]: Witness Printer took 3.92ms. Allocated memory is still 243.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 15:56:34,722 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 151.0MB. Free memory is still 111.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 417.99ms. Allocated memory is still 151.0MB. Free memory was 94.5MB in the beginning and 76.3MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.61ms. Allocated memory is still 151.0MB. Free memory was 76.3MB in the beginning and 71.4MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.80ms. Allocated memory is still 151.0MB. Free memory was 71.4MB in the beginning and 65.9MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 739.88ms. Allocated memory was 151.0MB in the beginning and 195.0MB in the end (delta: 44.0MB). Free memory was 65.5MB in the beginning and 135.9MB in the end (delta: -70.4MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. * TraceAbstraction took 4587.80ms. Allocated memory was 195.0MB in the beginning and 243.3MB in the end (delta: 48.2MB). Free memory was 135.9MB in the beginning and 116.5MB in the end (delta: 19.4MB). Peak memory consumption was 67.6MB. Max. memory is 16.1GB. * Witness Printer took 3.92ms. Allocated memory is still 243.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 193, overapproximation of someBinaryFLOATComparisonOperation at line 193. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 32; [L23] unsigned char var_1_3 = 32; [L24] unsigned char var_1_4 = 4; [L25] double var_1_5 = 128.5; [L26] signed long int var_1_6 = 64; [L27] signed long int var_1_7 = 4; [L28] double var_1_8 = 1.875; [L29] double var_1_9 = 0.1; [L30] double var_1_10 = 32.6; [L31] double var_1_11 = 0.6; [L32] signed long int var_1_12 = -128; [L33] signed long int var_1_14 = 16; [L34] signed short int var_1_15 = 1; [L35] signed long int var_1_18 = 2; [L36] signed char var_1_19 = 32; [L37] signed char var_1_20 = 50; [L38] signed short int var_1_21 = 16; [L39] unsigned char var_1_22 = 0; [L40] signed long int var_1_23 = 25; [L41] unsigned short int var_1_24 = 50906; [L42] unsigned short int var_1_25 = 21992; [L43] float var_1_26 = 3.25; [L44] float var_1_27 = 10.2; [L45] float var_1_28 = 16.5; [L46] float var_1_29 = 0.0; [L47] float var_1_30 = 99.8; [L48] signed char var_1_31 = 2; [L49] float var_1_33 = 4.2; [L50] unsigned char last_1_var_1_1 = 32; [L51] unsigned char last_1_var_1_22 = 0; [L52] signed long int last_1_var_1_23 = 25; VAL [isInitial=0, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=32, var_1_4=4, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L197] isInitial = 1 [L198] FCALL initially() [L199] int k_loop; [L200] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=32, var_1_4=4, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L200] COND TRUE k_loop < 1 [L201] CALL updateLastVariables() [L188] last_1_var_1_1 = var_1_1 [L189] last_1_var_1_22 = var_1_22 [L190] last_1_var_1_23 = var_1_23 VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=32, var_1_4=4, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L201] RET updateLastVariables() [L202] CALL updateVariables() [L142] var_1_3 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_4=4, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_4=4, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L143] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_4=4, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L144] CALL assume_abort_if_not(var_1_3 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=4, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=4, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L144] RET assume_abort_if_not(var_1_3 <= 64) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=4, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L145] var_1_4 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L146] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L147] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L147] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L148] var_1_6 = __VERIFIER_nondet_long() [L149] CALL assume_abort_if_not(var_1_6 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L149] RET assume_abort_if_not(var_1_6 >= -2147483648) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L150] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L150] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L151] CALL assume_abort_if_not(var_1_6 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L151] RET assume_abort_if_not(var_1_6 != 0) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L152] var_1_7 = __VERIFIER_nondet_long() [L153] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3, var_1_8=15/8, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3, var_1_8=15/8, var_1_9=1/10] [L153] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3, var_1_8=15/8, var_1_9=1/10] [L154] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3, var_1_8=15/8, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3, var_1_8=15/8, var_1_9=1/10] [L154] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3, var_1_8=15/8, var_1_9=1/10] [L155] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3, var_1_8=15/8, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3, var_1_8=15/8, var_1_9=1/10] [L155] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3, var_1_8=15/8, var_1_9=1/10] [L156] var_1_8 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3, var_1_9=1/10] [L157] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3, var_1_9=1/10] [L158] var_1_9 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L159] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L160] var_1_10 = __VERIFIER_nondet_double() [L161] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L161] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L162] var_1_11 = __VERIFIER_nondet_double() [L163] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L163] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L164] var_1_18 = __VERIFIER_nondet_long() [L165] CALL assume_abort_if_not(var_1_18 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L165] RET assume_abort_if_not(var_1_18 >= -2147483648) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L166] CALL assume_abort_if_not(var_1_18 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L166] RET assume_abort_if_not(var_1_18 <= 2147483647) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L167] CALL assume_abort_if_not(var_1_18 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L167] RET assume_abort_if_not(var_1_18 != 0) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L168] var_1_20 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_20 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L169] RET assume_abort_if_not(var_1_20 >= -63) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L170] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L170] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L171] var_1_24 = __VERIFIER_nondet_ushort() [L172] CALL assume_abort_if_not(var_1_24 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L172] RET assume_abort_if_not(var_1_24 >= 32767) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L173] CALL assume_abort_if_not(var_1_24 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L173] RET assume_abort_if_not(var_1_24 <= 65535) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L174] var_1_25 = __VERIFIER_nondet_ushort() [L175] CALL assume_abort_if_not(var_1_25 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L175] RET assume_abort_if_not(var_1_25 >= 16383) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L176] CALL assume_abort_if_not(var_1_25 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L176] RET assume_abort_if_not(var_1_25 <= 32767) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L177] var_1_27 = __VERIFIER_nondet_float() [L178] CALL assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 4611686.018427382800e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L178] RET assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 4611686.018427382800e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L179] var_1_28 = __VERIFIER_nondet_float() [L180] CALL assume_abort_if_not((var_1_28 >= 0.0F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 4611686.018427382800e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L180] RET assume_abort_if_not((var_1_28 >= 0.0F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 4611686.018427382800e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L181] var_1_29 = __VERIFIER_nondet_float() [L182] CALL assume_abort_if_not((var_1_29 >= 4611686.018427382800e+12F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854765600e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L182] RET assume_abort_if_not((var_1_29 >= 4611686.018427382800e+12F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854765600e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L183] var_1_31 = __VERIFIER_nondet_char() [L184] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L184] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L185] CALL assume_abort_if_not(var_1_31 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L185] RET assume_abort_if_not(var_1_31 <= 127) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L202] RET updateVariables() [L203] CALL step() [L56] COND FALSE !(last_1_var_1_22 || last_1_var_1_22) [L63] var_1_15 = 2 VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=2, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L65] var_1_22 = 0 [L66] var_1_33 = var_1_10 VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=2, var_1_12=-128, var_1_14=16, var_1_15=2, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L67] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=2, var_1_12=-128, var_1_14=16, var_1_15=2, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L70] unsigned char stepLocal_1 = var_1_22; VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_1=0, var_1_10=2, var_1_12=-128, var_1_14=16, var_1_15=2, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L71] COND TRUE stepLocal_1 || (var_1_4 <= (- var_1_6)) [L72] var_1_14 = ((((((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4)))) > (var_1_15)) ? (((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_15))) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=2, var_1_12=-128, var_1_14=5, var_1_15=2, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L76] signed long int stepLocal_0 = (var_1_3 / 1) / var_1_6; VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=0, var_1_10=2, var_1_12=-128, var_1_14=5, var_1_15=2, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-7, var_1_7=3] [L77] COND FALSE !(\read(var_1_22)) [L84] var_1_5 = var_1_10 VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=0, var_1_10=2, var_1_12=-128, var_1_14=5, var_1_15=2, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-7, var_1_7=3] [L86] signed long int stepLocal_4 = (((var_1_15) > (var_1_7)) ? (var_1_15) : (var_1_7)); VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=0, stepLocal_4=3, var_1_10=2, var_1_12=-128, var_1_14=5, var_1_15=2, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-7, var_1_7=3] [L87] COND FALSE !((var_1_24 - (var_1_25 - var_1_3)) <= stepLocal_4) [L94] var_1_23 = var_1_1 VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=0, var_1_10=2, var_1_12=-128, var_1_14=5, var_1_15=2, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-7, var_1_7=3] [L96] var_1_12 = ((((((var_1_23) < (var_1_3)) ? (var_1_23) : (var_1_3))) + var_1_4) + ((((var_1_1) < (100)) ? (var_1_1) : (100)))) [L97] signed long int stepLocal_7 = -1; [L98] signed long int stepLocal_6 = 0 & var_1_25; [L99] signed short int stepLocal_5 = var_1_15; VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=0, stepLocal_5=2, stepLocal_6=0, stepLocal_7=-1, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-7, var_1_7=3] [L100] COND FALSE !(stepLocal_5 < var_1_15) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=0, stepLocal_6=0, stepLocal_7=-1, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=7, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-7, var_1_7=3] [L109] COND TRUE var_1_9 > (var_1_26 * var_1_8) [L110] var_1_19 = var_1_4 VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=0, stepLocal_6=0, stepLocal_7=-1, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=7, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-7, var_1_7=3] [L114] signed short int stepLocal_3 = var_1_15; VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=0, stepLocal_3=2, stepLocal_6=0, stepLocal_7=-1, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=7, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-7, var_1_7=3] [L115] EXPR 5 | var_1_3 VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=0, stepLocal_3=2, stepLocal_6=0, stepLocal_7=-1, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=7, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-7, var_1_7=3] [L115] EXPR var_1_4 << var_1_18 VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=0, stepLocal_3=2, stepLocal_6=0, stepLocal_7=-1, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=7, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-7, var_1_7=3] [L115] unsigned char stepLocal_2 = (5 | var_1_3) < (var_1_4 << var_1_18); [L116] COND FALSE !(stepLocal_2 && (var_1_19 < var_1_23)) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=0, stepLocal_3=2, stepLocal_6=0, stepLocal_7=-1, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=7, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-7, var_1_7=3] [L119] COND TRUE var_1_18 > stepLocal_3 [L120] var_1_21 = var_1_20 VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=0, stepLocal_6=0, stepLocal_7=-1, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=7, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-7, var_1_7=3] [L125] EXPR var_1_15 ^ var_1_21 VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=0, stepLocal_6=0, stepLocal_7=-1, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=7, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-7, var_1_7=3] [L125] COND FALSE !((var_1_15 ^ var_1_21) <= var_1_21) [L203] RET step() [L204] CALL, EXPR property() [L193] EXPR ((((((var_1_22 ? (var_1_1 == ((unsigned char) ((var_1_3 + var_1_4) + 8))) : 1) && (var_1_22 ? ((((var_1_3 / 1) / var_1_6) == ((var_1_14 * var_1_4) % var_1_7)) ? (var_1_5 == ((double) (((((var_1_8 - var_1_9)) > (var_1_10)) ? ((var_1_8 - var_1_9)) : (var_1_10))))) : (var_1_5 == ((double) var_1_11))) : (var_1_5 == ((double) var_1_10)))) && (var_1_12 == ((signed long int) ((((((var_1_23) < (var_1_3)) ? (var_1_23) : (var_1_3))) + var_1_4) + ((((var_1_1) < (100)) ? (var_1_1) : (100))))))) && ((var_1_22 || (var_1_4 <= (- var_1_6))) ? (var_1_14 == ((signed long int) ((((((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4)))) > (var_1_15)) ? (((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_15))))) : (var_1_14 == ((signed long int) 5)))) && ((last_1_var_1_22 || last_1_var_1_22) ? (((last_1_var_1_1 * (last_1_var_1_23 % var_1_7)) < (var_1_6 / var_1_18)) ? (var_1_15 == ((signed short int) 10)) : (var_1_15 == ((signed short int) var_1_4))) : (var_1_15 == ((signed short int) 2)))) && ((var_1_9 > (var_1_26 * var_1_8)) ? (var_1_19 == ((signed char) var_1_4)) : (var_1_19 == ((signed char) (var_1_4 + var_1_20))))) && ((((5 | var_1_3) < (var_1_4 << var_1_18)) && (var_1_19 < var_1_23)) ? (var_1_21 == ((signed short int) var_1_3)) : ((var_1_18 > var_1_15) ? (var_1_21 == ((signed short int) var_1_20)) : (var_1_21 == ((signed short int) var_1_4)))) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=7, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-7, var_1_7=3] [L193] EXPR ((((((((((var_1_22 ? (var_1_1 == ((unsigned char) ((var_1_3 + var_1_4) + 8))) : 1) && (var_1_22 ? ((((var_1_3 / 1) / var_1_6) == ((var_1_14 * var_1_4) % var_1_7)) ? (var_1_5 == ((double) (((((var_1_8 - var_1_9)) > (var_1_10)) ? ((var_1_8 - var_1_9)) : (var_1_10))))) : (var_1_5 == ((double) var_1_11))) : (var_1_5 == ((double) var_1_10)))) && (var_1_12 == ((signed long int) ((((((var_1_23) < (var_1_3)) ? (var_1_23) : (var_1_3))) + var_1_4) + ((((var_1_1) < (100)) ? (var_1_1) : (100))))))) && ((var_1_22 || (var_1_4 <= (- var_1_6))) ? (var_1_14 == ((signed long int) ((((((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4)))) > (var_1_15)) ? (((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_15))))) : (var_1_14 == ((signed long int) 5)))) && ((last_1_var_1_22 || last_1_var_1_22) ? (((last_1_var_1_1 * (last_1_var_1_23 % var_1_7)) < (var_1_6 / var_1_18)) ? (var_1_15 == ((signed short int) 10)) : (var_1_15 == ((signed short int) var_1_4))) : (var_1_15 == ((signed short int) 2)))) && ((var_1_9 > (var_1_26 * var_1_8)) ? (var_1_19 == ((signed char) var_1_4)) : (var_1_19 == ((signed char) (var_1_4 + var_1_20))))) && ((((5 | var_1_3) < (var_1_4 << var_1_18)) && (var_1_19 < var_1_23)) ? (var_1_21 == ((signed short int) var_1_3)) : ((var_1_18 > var_1_15) ? (var_1_21 == ((signed short int) var_1_20)) : (var_1_21 == ((signed short int) var_1_4))))) && (var_1_22 == ((unsigned char) 0))) && (((var_1_24 - (var_1_25 - var_1_3)) <= ((((var_1_15) > (var_1_7)) ? (var_1_15) : (var_1_7)))) ? (var_1_22 ? (var_1_23 == ((signed long int) (var_1_24 - var_1_25))) : (var_1_23 == ((signed long int) 50))) : (var_1_23 == ((signed long int) var_1_1)))) && ((var_1_15 < var_1_15) ? ((-1 >= var_1_23) ? ((var_1_23 <= (0 & var_1_25)) ? (var_1_26 == ((float) (var_1_9 - (var_1_27 + var_1_28)))) : 1) : (var_1_26 == ((float) (((((var_1_9) > ((var_1_29 - var_1_28))) ? (var_1_9) : ((var_1_29 - var_1_28)))) - var_1_27)))) : 1)) && (((var_1_15 ^ var_1_21) <= var_1_21) ? ((var_1_22 && var_1_22) ? (var_1_22 ? (var_1_30 == ((float) ((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))))) : 1) : ((((var_1_3 + var_1_4) - var_1_31) <= var_1_21) ? ((var_1_20 < var_1_1) ? (var_1_30 == ((float) (var_1_9 - var_1_27))) : (var_1_30 == ((float) ((((var_1_10) > (var_1_8)) ? (var_1_10) : (var_1_8)))))) : 1)) : 1) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=7, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-7, var_1_7=3] [L193-L194] return (((((((((((var_1_22 ? (var_1_1 == ((unsigned char) ((var_1_3 + var_1_4) + 8))) : 1) && (var_1_22 ? ((((var_1_3 / 1) / var_1_6) == ((var_1_14 * var_1_4) % var_1_7)) ? (var_1_5 == ((double) (((((var_1_8 - var_1_9)) > (var_1_10)) ? ((var_1_8 - var_1_9)) : (var_1_10))))) : (var_1_5 == ((double) var_1_11))) : (var_1_5 == ((double) var_1_10)))) && (var_1_12 == ((signed long int) ((((((var_1_23) < (var_1_3)) ? (var_1_23) : (var_1_3))) + var_1_4) + ((((var_1_1) < (100)) ? (var_1_1) : (100))))))) && ((var_1_22 || (var_1_4 <= (- var_1_6))) ? (var_1_14 == ((signed long int) ((((((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4)))) > (var_1_15)) ? (((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_15))))) : (var_1_14 == ((signed long int) 5)))) && ((last_1_var_1_22 || last_1_var_1_22) ? (((last_1_var_1_1 * (last_1_var_1_23 % var_1_7)) < (var_1_6 / var_1_18)) ? (var_1_15 == ((signed short int) 10)) : (var_1_15 == ((signed short int) var_1_4))) : (var_1_15 == ((signed short int) 2)))) && ((var_1_9 > (var_1_26 * var_1_8)) ? (var_1_19 == ((signed char) var_1_4)) : (var_1_19 == ((signed char) (var_1_4 + var_1_20))))) && ((((5 | var_1_3) < (var_1_4 << var_1_18)) && (var_1_19 < var_1_23)) ? (var_1_21 == ((signed short int) var_1_3)) : ((var_1_18 > var_1_15) ? (var_1_21 == ((signed short int) var_1_20)) : (var_1_21 == ((signed short int) var_1_4))))) && (var_1_22 == ((unsigned char) 0))) && (((var_1_24 - (var_1_25 - var_1_3)) <= ((((var_1_15) > (var_1_7)) ? (var_1_15) : (var_1_7)))) ? (var_1_22 ? (var_1_23 == ((signed long int) (var_1_24 - var_1_25))) : (var_1_23 == ((signed long int) 50))) : (var_1_23 == ((signed long int) var_1_1)))) && ((var_1_15 < var_1_15) ? ((-1 >= var_1_23) ? ((var_1_23 <= (0 & var_1_25)) ? (var_1_26 == ((float) (var_1_9 - (var_1_27 + var_1_28)))) : 1) : (var_1_26 == ((float) (((((var_1_9) > ((var_1_29 - var_1_28))) ? (var_1_9) : ((var_1_29 - var_1_28)))) - var_1_27)))) : 1)) && (((var_1_15 ^ var_1_21) <= var_1_21) ? ((var_1_22 && var_1_22) ? (var_1_22 ? (var_1_30 == ((float) ((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))))) : 1) : ((((var_1_3 + var_1_4) - var_1_31) <= var_1_21) ? ((var_1_20 < var_1_1) ? (var_1_30 == ((float) (var_1_9 - var_1_27))) : (var_1_30 == ((float) ((((var_1_10) > (var_1_8)) ? (var_1_10) : (var_1_8)))))) : 1)) : 1)) && (var_1_33 == ((float) var_1_10)) ; [L204] RET, EXPR property() [L204] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=7, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-7, var_1_7=3] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=7, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-7, var_1_7=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 116 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.4s, OverallIterations: 7, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 876 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 876 mSDsluCounter, 2757 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1400 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 727 IncrementalHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 1357 mSDtfsCounter, 727 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 365 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=459occurred in iteration=6, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 627 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1529 NumberOfCodeBlocks, 1529 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1139 ConstructedInterpolants, 0 QuantifiedInterpolants, 1439 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 9072/9072 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-16 15:56:34,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-15.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 ffd456b3aee4a03e3ad29674b9135df7e42dac45ab32681ea39048340b5ac3f8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 15:56:36,878 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 15:56:36,945 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 15:56:36,951 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 15:56:36,951 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 15:56:36,985 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 15:56:36,986 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 15:56:36,987 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 15:56:36,987 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 15:56:36,988 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 15:56:36,989 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 15:56:36,989 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 15:56:36,990 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 15:56:36,990 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 15:56:36,991 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 15:56:36,992 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 15:56:36,992 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 15:56:36,992 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 15:56:36,993 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 15:56:36,993 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 15:56:36,993 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 15:56:36,997 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 15:56:36,997 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 15:56:36,998 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 15:56:36,998 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 15:56:36,998 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 15:56:36,998 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 15:56:36,999 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 15:56:36,999 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 15:56:36,999 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 15:56:36,999 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 15:56:36,999 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 15:56:37,000 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 15:56:37,000 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 15:56:37,000 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:56:37,000 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 15:56:37,001 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 15:56:37,001 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 15:56:37,001 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 15:56:37,001 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 15:56:37,001 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 15:56:37,002 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 15:56:37,002 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 15:56:37,002 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 15:56:37,002 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 -> ffd456b3aee4a03e3ad29674b9135df7e42dac45ab32681ea39048340b5ac3f8 [2024-11-16 15:56:37,320 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 15:56:37,343 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 15:56:37,346 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 15:56:37,347 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 15:56:37,348 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 15:56:37,349 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-15.i [2024-11-16 15:56:38,933 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 15:56:39,164 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 15:56:39,165 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-15.i [2024-11-16 15:56:39,177 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/225baf4dd/1b19e8e6aa824c24b586b39418515682/FLAGd60d86a39 [2024-11-16 15:56:39,191 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/225baf4dd/1b19e8e6aa824c24b586b39418515682 [2024-11-16 15:56:39,193 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 15:56:39,194 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 15:56:39,195 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 15:56:39,195 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 15:56:39,201 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 15:56:39,202 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:56:39" (1/1) ... [2024-11-16 15:56:39,202 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57e3d5ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:39, skipping insertion in model container [2024-11-16 15:56:39,202 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:56:39" (1/1) ... [2024-11-16 15:56:39,236 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 15:56:39,416 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-15.i[916,929] [2024-11-16 15:56:39,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:56:39,538 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 15:56:39,550 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-15.i[916,929] [2024-11-16 15:56:39,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:56:39,627 INFO L204 MainTranslator]: Completed translation [2024-11-16 15:56:39,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:39 WrapperNode [2024-11-16 15:56:39,628 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 15:56:39,629 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 15:56:39,629 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 15:56:39,629 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 15:56:39,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:39" (1/1) ... [2024-11-16 15:56:39,651 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:39" (1/1) ... [2024-11-16 15:56:39,692 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 200 [2024-11-16 15:56:39,693 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 15:56:39,694 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 15:56:39,697 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 15:56:39,697 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 15:56:39,708 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:39" (1/1) ... [2024-11-16 15:56:39,708 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:39" (1/1) ... [2024-11-16 15:56:39,716 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:39" (1/1) ... [2024-11-16 15:56:39,741 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 15:56:39,745 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:39" (1/1) ... [2024-11-16 15:56:39,745 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:39" (1/1) ... [2024-11-16 15:56:39,757 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:39" (1/1) ... [2024-11-16 15:56:39,758 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:39" (1/1) ... [2024-11-16 15:56:39,760 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:39" (1/1) ... [2024-11-16 15:56:39,766 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:39" (1/1) ... [2024-11-16 15:56:39,772 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 15:56:39,777 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 15:56:39,777 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 15:56:39,777 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 15:56:39,778 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:39" (1/1) ... [2024-11-16 15:56:39,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:56:39,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:56:39,810 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 15:56:39,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 15:56:39,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 15:56:39,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 15:56:39,857 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 15:56:39,857 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 15:56:39,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 15:56:39,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 15:56:39,963 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 15:56:39,972 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 15:56:56,810 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-16 15:56:56,810 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 15:56:56,823 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 15:56:56,823 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 15:56:56,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:56:56 BoogieIcfgContainer [2024-11-16 15:56:56,824 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 15:56:56,827 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 15:56:56,827 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 15:56:56,830 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 15:56:56,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:56:39" (1/3) ... [2024-11-16 15:56:56,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@652f8c53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:56:56, skipping insertion in model container [2024-11-16 15:56:56,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:39" (2/3) ... [2024-11-16 15:56:56,832 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@652f8c53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:56:56, skipping insertion in model container [2024-11-16 15:56:56,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:56:56" (3/3) ... [2024-11-16 15:56:56,835 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-15.i [2024-11-16 15:56:56,851 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 15:56:56,852 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 15:56:56,908 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 15:56:56,926 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;@4930a8a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 15:56:56,926 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 15:56:56,933 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 60 states have (on average 1.4) internal successors, (84), 61 states have internal predecessors, (84), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 15:56:56,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-16 15:56:56,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:56:56,949 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:56:56,949 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:56:56,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:56:56,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1567053093, now seen corresponding path program 1 times [2024-11-16 15:56:56,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:56:56,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1261408900] [2024-11-16 15:56:56,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:56:56,971 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 15:56:56,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:56:56,975 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 15:56:56,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 15:56:57,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:57,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 15:56:57,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:56:57,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 558 proven. 0 refuted. 0 times theorem prover too weak. 954 trivial. 0 not checked. [2024-11-16 15:56:57,686 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 15:56:57,687 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 15:56:57,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1261408900] [2024-11-16 15:56:57,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1261408900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:56:57,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:56:57,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 15:56:57,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631198838] [2024-11-16 15:56:57,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:56:57,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 15:56:57,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 15:56:57,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 15:56:57,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:56:57,730 INFO L87 Difference]: Start difference. First operand has 91 states, 60 states have (on average 1.4) internal successors, (84), 61 states have internal predecessors, (84), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-16 15:56:57,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:56:57,761 INFO L93 Difference]: Finished difference Result 178 states and 304 transitions. [2024-11-16 15:56:57,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 15:56:57,763 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 182 [2024-11-16 15:56:57,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:56:57,773 INFO L225 Difference]: With dead ends: 178 [2024-11-16 15:56:57,773 INFO L226 Difference]: Without dead ends: 86 [2024-11-16 15:56:57,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:56:57,781 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 15:56:57,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:56:57,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-16 15:56:57,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-16 15:56:57,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 56 states have internal predecessors, (76), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 15:56:57,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 132 transitions. [2024-11-16 15:56:57,825 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 132 transitions. Word has length 182 [2024-11-16 15:56:57,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:56:57,826 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 132 transitions. [2024-11-16 15:56:57,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-16 15:56:57,827 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 132 transitions. [2024-11-16 15:56:57,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-16 15:56:57,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:56:57,830 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:56:57,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 15:56:58,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 15:56:58,031 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:56:58,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:56:58,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1778181271, now seen corresponding path program 1 times [2024-11-16 15:56:58,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:56:58,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2091744667] [2024-11-16 15:56:58,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:56:58,033 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 15:56:58,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:56:58,037 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 15:56:58,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 15:56:58,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:58,692 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 15:56:58,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:56:58,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 15:56:58,841 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 15:56:58,841 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 15:56:58,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2091744667] [2024-11-16 15:56:58,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2091744667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:56:58,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:56:58,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 15:56:58,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670502821] [2024-11-16 15:56:58,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:56:58,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 15:56:58,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 15:56:58,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 15:56:58,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:56:58,847 INFO L87 Difference]: Start difference. First operand 86 states and 132 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 15:57:03,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 15:57:07,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 15:57:07,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:57:07,816 INFO L93 Difference]: Finished difference Result 247 states and 380 transitions. [2024-11-16 15:57:07,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 15:57:07,822 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 182 [2024-11-16 15:57:07,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:57:07,826 INFO L225 Difference]: With dead ends: 247 [2024-11-16 15:57:07,826 INFO L226 Difference]: Without dead ends: 164 [2024-11-16 15:57:07,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:57:07,829 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 113 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2024-11-16 15:57:07,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 350 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 2 Unknown, 0 Unchecked, 8.9s Time] [2024-11-16 15:57:07,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-16 15:57:07,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 103. [2024-11-16 15:57:07,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 73 states have internal predecessors, (101), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 15:57:07,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 157 transitions. [2024-11-16 15:57:07,852 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 157 transitions. Word has length 182 [2024-11-16 15:57:07,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:57:07,857 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 157 transitions. [2024-11-16 15:57:07,857 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 15:57:07,858 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 157 transitions. [2024-11-16 15:57:07,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-16 15:57:07,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:57:07,864 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:57:07,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-16 15:57:08,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 15:57:08,065 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:57:08,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:57:08,065 INFO L85 PathProgramCache]: Analyzing trace with hash 781108918, now seen corresponding path program 1 times [2024-11-16 15:57:08,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:57:08,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1777839587] [2024-11-16 15:57:08,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:57:08,067 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 15:57:08,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:57:08,072 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 15:57:08,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 15:57:08,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:57:08,747 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-16 15:57:08,762 INFO L278 TraceCheckSpWp]: Computing forward predicates...