./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-41.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-41.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 0ce0eb489df8fa084a208059955735f91d7eaccc5d3a522f7cf2150fa7a42b6a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:04:04,187 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:04:04,262 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 03:04:04,266 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:04:04,266 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:04:04,285 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:04:04,285 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:04:04,286 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:04:04,286 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:04:04,287 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:04:04,287 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:04:04,287 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:04:04,288 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:04:04,288 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:04:04,289 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:04:04,289 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:04:04,290 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:04:04,290 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:04:04,290 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 03:04:04,291 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:04:04,291 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:04:04,294 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:04:04,294 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:04:04,295 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:04:04,295 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:04:04,295 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:04:04,296 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:04:04,296 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:04:04,296 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:04:04,296 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:04:04,297 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:04:04,297 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:04:04,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:04:04,301 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:04:04,302 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:04:04,302 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:04:04,302 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 03:04:04,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 03:04:04,302 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:04:04,303 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:04:04,303 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:04:04,303 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:04:04,303 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 -> 0ce0eb489df8fa084a208059955735f91d7eaccc5d3a522f7cf2150fa7a42b6a [2024-10-13 03:04:04,557 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:04:04,583 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:04:04,586 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:04:04,587 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:04:04,588 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:04:04,589 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-41.i [2024-10-13 03:04:06,049 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:04:06,303 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:04:06,304 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-41.i [2024-10-13 03:04:06,316 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31ab66f25/bda46dd333ae4c4a84476994853e3d9e/FLAG0e7195988 [2024-10-13 03:04:06,647 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31ab66f25/bda46dd333ae4c4a84476994853e3d9e [2024-10-13 03:04:06,649 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:04:06,651 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:04:06,652 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:04:06,652 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:04:06,657 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:04:06,658 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:04:06" (1/1) ... [2024-10-13 03:04:06,661 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fdeb117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:04:06, skipping insertion in model container [2024-10-13 03:04:06,661 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:04:06" (1/1) ... [2024-10-13 03:04:06,696 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:04:06,878 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-41.i[919,932] [2024-10-13 03:04:06,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:04:06,964 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:04:06,976 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-41.i[919,932] [2024-10-13 03:04:07,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:04:07,031 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:04:07,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:04:07 WrapperNode [2024-10-13 03:04:07,032 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:04:07,033 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:04:07,034 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:04:07,034 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:04:07,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:04:07" (1/1) ... [2024-10-13 03:04:07,059 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:04:07" (1/1) ... [2024-10-13 03:04:07,108 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 194 [2024-10-13 03:04:07,108 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:04:07,109 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:04:07,109 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:04:07,109 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:04:07,117 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:04:07" (1/1) ... [2024-10-13 03:04:07,118 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:04:07" (1/1) ... [2024-10-13 03:04:07,121 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:04:07" (1/1) ... [2024-10-13 03:04:07,145 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 03:04:07,145 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:04:07" (1/1) ... [2024-10-13 03:04:07,146 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:04:07" (1/1) ... [2024-10-13 03:04:07,159 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:04:07" (1/1) ... [2024-10-13 03:04:07,163 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:04:07" (1/1) ... [2024-10-13 03:04:07,165 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:04:07" (1/1) ... [2024-10-13 03:04:07,167 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:04:07" (1/1) ... [2024-10-13 03:04:07,171 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:04:07,172 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:04:07,176 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:04:07,176 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:04:07,177 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:04:07" (1/1) ... [2024-10-13 03:04:07,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:04:07,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:04:07,214 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 03:04:07,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 03:04:07,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:04:07,267 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:04:07,268 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:04:07,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 03:04:07,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:04:07,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:04:07,365 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:04:07,367 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:04:07,786 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-13 03:04:07,787 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:04:07,836 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:04:07,838 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:04:07,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:04:07 BoogieIcfgContainer [2024-10-13 03:04:07,838 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:04:07,841 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:04:07,842 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:04:07,845 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:04:07,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:04:06" (1/3) ... [2024-10-13 03:04:07,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46c458b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:04:07, skipping insertion in model container [2024-10-13 03:04:07,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:04:07" (2/3) ... [2024-10-13 03:04:07,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46c458b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:04:07, skipping insertion in model container [2024-10-13 03:04:07,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:04:07" (3/3) ... [2024-10-13 03:04:07,848 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-41.i [2024-10-13 03:04:07,865 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:04:07,866 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:04:07,928 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:04:07,937 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;@797199ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:04:07,938 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:04:07,943 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 53 states have (on average 1.509433962264151) internal successors, (80), 54 states have internal predecessors, (80), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 03:04:07,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-13 03:04:07,954 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:04:07,955 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:04:07,956 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:04:07,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:04:07,961 INFO L85 PathProgramCache]: Analyzing trace with hash -2050968300, now seen corresponding path program 1 times [2024-10-13 03:04:07,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:04:07,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970255959] [2024-10-13 03:04:07,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:04:07,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:04:08,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:08,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:04:08,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:08,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:04:08,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:08,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:04:08,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:08,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:04:08,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:08,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:04:08,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:08,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:04:08,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:08,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:04:08,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:08,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:04:08,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:08,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:04:08,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:08,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 03:04:08,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:08,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:04:08,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:08,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 03:04:08,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:08,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:04:08,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:08,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 03:04:08,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:08,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:04:08,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:08,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 03:04:08,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:08,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 03:04:08,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:08,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 03:04:08,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:08,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 03:04:08,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:08,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 03:04:08,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:08,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 03:04:08,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:08,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-13 03:04:08,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:08,533 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 03:04:08,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:04:08,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970255959] [2024-10-13 03:04:08,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970255959] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:04:08,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:04:08,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:04:08,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139584723] [2024-10-13 03:04:08,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:04:08,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:04:08,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:04:08,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:04:08,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:04:08,570 INFO L87 Difference]: Start difference. First operand has 78 states, 53 states have (on average 1.509433962264151) internal successors, (80), 54 states have internal predecessors, (80), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-13 03:04:08,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:04:08,623 INFO L93 Difference]: Finished difference Result 151 states and 265 transitions. [2024-10-13 03:04:08,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:04:08,626 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 148 [2024-10-13 03:04:08,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:04:08,634 INFO L225 Difference]: With dead ends: 151 [2024-10-13 03:04:08,634 INFO L226 Difference]: Without dead ends: 74 [2024-10-13 03:04:08,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:04:08,645 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:04:08,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:04:08,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-13 03:04:08,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-10-13 03:04:08,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.4) internal successors, (70), 50 states have internal predecessors, (70), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 03:04:08,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 114 transitions. [2024-10-13 03:04:08,705 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 114 transitions. Word has length 148 [2024-10-13 03:04:08,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:04:08,705 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 114 transitions. [2024-10-13 03:04:08,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-13 03:04:08,706 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 114 transitions. [2024-10-13 03:04:08,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-13 03:04:08,712 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:04:08,713 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:04:08,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 03:04:08,713 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:04:08,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:04:08,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1000391264, now seen corresponding path program 1 times [2024-10-13 03:04:08,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:04:08,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032613555] [2024-10-13 03:04:08,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:04:08,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:04:08,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:09,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:04:09,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:09,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:04:09,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:09,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:04:09,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:09,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:04:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:09,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:04:09,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:09,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:04:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:09,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:04:09,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:09,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:04:09,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:09,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:04:09,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:09,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 03:04:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:09,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:04:09,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:09,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 03:04:09,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:09,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:04:09,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:09,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 03:04:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:09,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:04:09,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:09,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 03:04:09,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:09,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 03:04:09,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:09,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 03:04:09,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:09,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 03:04:09,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:09,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 03:04:09,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:09,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 03:04:09,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:09,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-13 03:04:09,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:09,326 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 03:04:09,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:04:09,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032613555] [2024-10-13 03:04:09,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032613555] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:04:09,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:04:09,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:04:09,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648252530] [2024-10-13 03:04:09,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:04:09,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:04:09,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:04:09,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:04:09,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:04:09,334 INFO L87 Difference]: Start difference. First operand 74 states and 114 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 03:04:09,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:04:09,410 INFO L93 Difference]: Finished difference Result 207 states and 323 transitions. [2024-10-13 03:04:09,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:04:09,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 148 [2024-10-13 03:04:09,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:04:09,414 INFO L225 Difference]: With dead ends: 207 [2024-10-13 03:04:09,414 INFO L226 Difference]: Without dead ends: 134 [2024-10-13 03:04:09,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:04:09,416 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 50 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:04:09,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 210 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:04:09,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-13 03:04:09,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 128. [2024-10-13 03:04:09,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 81 states have (on average 1.345679012345679) internal successors, (109), 81 states have internal predecessors, (109), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-13 03:04:09,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 197 transitions. [2024-10-13 03:04:09,447 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 197 transitions. Word has length 148 [2024-10-13 03:04:09,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:04:09,450 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 197 transitions. [2024-10-13 03:04:09,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 03:04:09,450 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 197 transitions. [2024-10-13 03:04:09,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-13 03:04:09,452 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:04:09,452 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:04:09,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 03:04:09,453 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:04:09,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:04:09,454 INFO L85 PathProgramCache]: Analyzing trace with hash -568342606, now seen corresponding path program 1 times [2024-10-13 03:04:09,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:04:09,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472560112] [2024-10-13 03:04:09,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:04:09,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:04:09,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:10,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:04:10,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:10,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:04:10,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:10,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:04:10,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:10,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:04:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:10,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:04:10,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:10,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:04:10,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:10,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:04:10,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:10,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:04:10,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:10,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:04:10,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:10,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 03:04:10,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:10,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:04:10,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:10,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 03:04:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:10,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:04:10,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:10,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 03:04:10,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:10,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:04:10,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:10,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 03:04:10,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:10,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 03:04:10,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:10,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 03:04:10,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:10,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 03:04:10,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:10,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 03:04:10,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:10,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 03:04:10,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:10,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-13 03:04:10,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:10,566 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-10-13 03:04:10,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:04:10,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472560112] [2024-10-13 03:04:10,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472560112] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 03:04:10,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870716850] [2024-10-13 03:04:10,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:04:10,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 03:04:10,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:04:10,578 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 03:04:10,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 03:04:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:10,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-13 03:04:10,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:04:11,165 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 21 proven. 63 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 03:04:11,166 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 03:04:11,714 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-10-13 03:04:11,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870716850] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 03:04:11,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 03:04:11,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 16 [2024-10-13 03:04:11,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423569339] [2024-10-13 03:04:11,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 03:04:11,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-13 03:04:11,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:04:11,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 03:04:11,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-10-13 03:04:11,721 INFO L87 Difference]: Start difference. First operand 128 states and 197 transitions. Second operand has 16 states, 16 states have (on average 3.875) internal successors, (62), 16 states have internal predecessors, (62), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 1 states have call predecessors, (44), 2 states have call successors, (44) [2024-10-13 03:04:13,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:04:13,101 INFO L93 Difference]: Finished difference Result 306 states and 452 transitions. [2024-10-13 03:04:13,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-13 03:04:13,103 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.875) internal successors, (62), 16 states have internal predecessors, (62), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 1 states have call predecessors, (44), 2 states have call successors, (44) Word has length 150 [2024-10-13 03:04:13,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:04:13,107 INFO L225 Difference]: With dead ends: 306 [2024-10-13 03:04:13,107 INFO L226 Difference]: Without dead ends: 233 [2024-10-13 03:04:13,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 338 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=367, Invalid=1355, Unknown=0, NotChecked=0, Total=1722 [2024-10-13 03:04:13,110 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 333 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 03:04:13,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 875 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 03:04:13,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-10-13 03:04:13,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 142. [2024-10-13 03:04:13,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 91 states have (on average 1.2417582417582418) internal successors, (113), 91 states have internal predecessors, (113), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-13 03:04:13,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 201 transitions. [2024-10-13 03:04:13,137 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 201 transitions. Word has length 150 [2024-10-13 03:04:13,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:04:13,138 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 201 transitions. [2024-10-13 03:04:13,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.875) internal successors, (62), 16 states have internal predecessors, (62), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 1 states have call predecessors, (44), 2 states have call successors, (44) [2024-10-13 03:04:13,138 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 201 transitions. [2024-10-13 03:04:13,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-13 03:04:13,140 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:04:13,140 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:04:13,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 03:04:13,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 03:04:13,345 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:04:13,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:04:13,346 INFO L85 PathProgramCache]: Analyzing trace with hash -175315596, now seen corresponding path program 1 times [2024-10-13 03:04:13,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:04:13,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283081492] [2024-10-13 03:04:13,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:04:13,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:04:13,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 03:04:13,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2080317714] [2024-10-13 03:04:13,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:04:13,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 03:04:13,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:04:13,539 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 03:04:13,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 03:04:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:13,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-13 03:04:13,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:04:14,331 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 494 proven. 60 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-10-13 03:04:14,332 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 03:04:15,112 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 33 proven. 30 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-10-13 03:04:15,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:04:15,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283081492] [2024-10-13 03:04:15,113 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 03:04:15,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080317714] [2024-10-13 03:04:15,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080317714] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 03:04:15,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 03:04:15,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2024-10-13 03:04:15,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704168969] [2024-10-13 03:04:15,115 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 03:04:15,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-13 03:04:15,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:04:15,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-13 03:04:15,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2024-10-13 03:04:15,118 INFO L87 Difference]: Start difference. First operand 142 states and 201 transitions. Second operand has 19 states, 19 states have (on average 4.473684210526316) internal successors, (85), 19 states have internal predecessors, (85), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2024-10-13 03:04:16,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:04:16,004 INFO L93 Difference]: Finished difference Result 299 states and 392 transitions. [2024-10-13 03:04:16,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-13 03:04:16,005 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.473684210526316) internal successors, (85), 19 states have internal predecessors, (85), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) Word has length 150 [2024-10-13 03:04:16,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:04:16,007 INFO L225 Difference]: With dead ends: 299 [2024-10-13 03:04:16,008 INFO L226 Difference]: Without dead ends: 220 [2024-10-13 03:04:16,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=339, Invalid=993, Unknown=0, NotChecked=0, Total=1332 [2024-10-13 03:04:16,010 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 329 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 03:04:16,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 426 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 03:04:16,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-10-13 03:04:16,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 166. [2024-10-13 03:04:16,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 109 states have (on average 1.1926605504587156) internal successors, (130), 109 states have internal predecessors, (130), 44 states have call successors, (44), 12 states have call predecessors, (44), 12 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-13 03:04:16,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 218 transitions. [2024-10-13 03:04:16,037 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 218 transitions. Word has length 150 [2024-10-13 03:04:16,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:04:16,038 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 218 transitions. [2024-10-13 03:04:16,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.473684210526316) internal successors, (85), 19 states have internal predecessors, (85), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2024-10-13 03:04:16,038 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 218 transitions. [2024-10-13 03:04:16,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-13 03:04:16,042 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:04:16,043 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:04:16,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 03:04:16,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-10-13 03:04:16,244 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:04:16,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:04:16,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1140253301, now seen corresponding path program 1 times [2024-10-13 03:04:16,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:04:16,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235873086] [2024-10-13 03:04:16,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:04:16,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:04:16,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 03:04:16,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1221477398] [2024-10-13 03:04:16,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:04:16,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 03:04:16,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:04:16,358 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 03:04:16,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 03:04:16,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:04:16,554 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 03:04:16,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:04:16,735 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 03:04:16,735 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 03:04:16,736 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 03:04:16,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-13 03:04:16,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 03:04:16,942 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-13 03:04:17,076 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 03:04:17,081 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 03:04:17 BoogieIcfgContainer [2024-10-13 03:04:17,081 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 03:04:17,082 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 03:04:17,082 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 03:04:17,082 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 03:04:17,083 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:04:07" (3/4) ... [2024-10-13 03:04:17,085 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 03:04:17,087 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 03:04:17,087 INFO L158 Benchmark]: Toolchain (without parser) took 10436.63ms. Allocated memory was 180.4MB in the beginning and 249.6MB in the end (delta: 69.2MB). Free memory was 146.5MB in the beginning and 196.6MB in the end (delta: -50.1MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. [2024-10-13 03:04:17,089 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 121.6MB. Free memory was 83.4MB in the beginning and 83.3MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:04:17,089 INFO L158 Benchmark]: CACSL2BoogieTranslator took 380.76ms. Allocated memory is still 180.4MB. Free memory was 146.5MB in the beginning and 129.8MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 03:04:17,089 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.90ms. Allocated memory is still 180.4MB. Free memory was 129.8MB in the beginning and 125.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 03:04:17,090 INFO L158 Benchmark]: Boogie Preprocessor took 62.31ms. Allocated memory is still 180.4MB. Free memory was 125.6MB in the beginning and 119.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 03:04:17,092 INFO L158 Benchmark]: RCFGBuilder took 666.64ms. Allocated memory is still 180.4MB. Free memory was 119.3MB in the beginning and 90.0MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-13 03:04:17,092 INFO L158 Benchmark]: TraceAbstraction took 9239.92ms. Allocated memory was 180.4MB in the beginning and 249.6MB in the end (delta: 69.2MB). Free memory was 89.3MB in the beginning and 196.6MB in the end (delta: -107.2MB). Peak memory consumption was 92.6MB. Max. memory is 16.1GB. [2024-10-13 03:04:17,092 INFO L158 Benchmark]: Witness Printer took 4.78ms. Allocated memory is still 249.6MB. Free memory is still 196.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:04:17,093 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.17ms. Allocated memory is still 121.6MB. Free memory was 83.4MB in the beginning and 83.3MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 380.76ms. Allocated memory is still 180.4MB. Free memory was 146.5MB in the beginning and 129.8MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.90ms. Allocated memory is still 180.4MB. Free memory was 129.8MB in the beginning and 125.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.31ms. Allocated memory is still 180.4MB. Free memory was 125.6MB in the beginning and 119.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 666.64ms. Allocated memory is still 180.4MB. Free memory was 119.3MB in the beginning and 90.0MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 9239.92ms. Allocated memory was 180.4MB in the beginning and 249.6MB in the end (delta: 69.2MB). Free memory was 89.3MB in the beginning and 196.6MB in the end (delta: -107.2MB). Peak memory consumption was 92.6MB. Max. memory is 16.1GB. * Witness Printer took 4.78ms. Allocated memory is still 249.6MB. Free memory is still 196.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 179, overapproximation of someBinaryDOUBLEComparisonOperation at line 179. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 1; [L24] unsigned char var_1_5 = 1; [L25] unsigned char var_1_6 = 0; [L26] signed char var_1_8 = 64; [L27] signed char var_1_11 = -10; [L28] signed char var_1_12 = 64; [L29] float var_1_13 = 1.6; [L30] float var_1_14 = 3.5; [L31] unsigned char var_1_15 = 8; [L32] unsigned char var_1_16 = 4; [L33] unsigned short int var_1_17 = 2; [L34] unsigned short int var_1_18 = 10000; [L35] signed short int var_1_20 = 4; [L36] signed char var_1_22 = -32; [L37] unsigned long int var_1_23 = 0; [L38] signed short int var_1_24 = 25; [L39] unsigned char var_1_27 = 50; [L40] unsigned char var_1_28 = 8; [L41] signed short int var_1_29 = 10; [L42] double var_1_33 = 7.125; [L43] float var_1_34 = 0.75; [L44] float var_1_35 = 25.5; [L45] float var_1_36 = 9.038; [L46] double var_1_38 = 15.5; [L47] float var_1_39 = 128.5; [L48] float var_1_41 = 15.25; [L49] float var_1_42 = 64.5; [L50] float var_1_43 = 256.3; [L51] unsigned long int var_1_44 = 32; [L52] double var_1_45 = 63.25; [L53] unsigned char last_1_var_1_15 = 8; [L183] isInitial = 1 [L184] FCALL initially() [L185] COND TRUE 1 [L186] CALL updateLastVariables() [L176] last_1_var_1_15 = var_1_15 [L186] RET updateLastVariables() [L187] CALL updateVariables() [L137] var_1_4 = __VERIFIER_nondet_uchar() [L138] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L138] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L139] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L139] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L140] var_1_5 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_5 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L141] RET assume_abort_if_not(var_1_5 >= 1) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L142] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L142] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L143] var_1_11 = __VERIFIER_nondet_char() [L144] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L144] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L145] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L145] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L146] var_1_12 = __VERIFIER_nondet_char() [L147] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L147] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L148] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L148] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L149] var_1_14 = __VERIFIER_nondet_float() [L150] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L150] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L151] var_1_16 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L152] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L153] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_16=-510, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_16=-510, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L153] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_16=-510, var_1_17=2, var_1_18=10000, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L154] var_1_18 = __VERIFIER_nondet_ushort() [L155] CALL assume_abort_if_not(var_1_18 >= 8192) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_16=-510, var_1_17=2, var_1_18=73728, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_16=-510, var_1_17=2, var_1_18=73728, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L155] RET assume_abort_if_not(var_1_18 >= 8192) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_16=-510, var_1_17=2, var_1_18=73728, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L156] CALL assume_abort_if_not(var_1_18 <= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_16=-510, var_1_17=2, var_1_18=73728, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_16=-510, var_1_17=2, var_1_18=73728, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L156] RET assume_abort_if_not(var_1_18 <= 16384) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_16=-510, var_1_17=2, var_1_18=73728, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=8, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L157] var_1_28 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_16=-510, var_1_17=2, var_1_18=73728, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_16=-510, var_1_17=2, var_1_18=73728, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L158] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_16=-510, var_1_17=2, var_1_18=73728, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L159] CALL assume_abort_if_not(var_1_28 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_16=-510, var_1_17=2, var_1_18=73728, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_16=-510, var_1_17=2, var_1_18=73728, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L159] RET assume_abort_if_not(var_1_28 <= 254) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_16=-510, var_1_17=2, var_1_18=73728, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_34=3/4, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L160] var_1_34 = __VERIFIER_nondet_float() [L161] CALL assume_abort_if_not((var_1_34 >= 0.0F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854776000e+12F && var_1_34 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_16=-510, var_1_17=2, var_1_18=73728, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_16=-510, var_1_17=2, var_1_18=73728, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L161] RET assume_abort_if_not((var_1_34 >= 0.0F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854776000e+12F && var_1_34 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_16=-510, var_1_17=2, var_1_18=73728, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_35=51/2, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L162] var_1_35 = __VERIFIER_nondet_float() [L163] CALL assume_abort_if_not((var_1_35 >= 0.0F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854776000e+12F && var_1_35 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_16=-510, var_1_17=2, var_1_18=73728, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_16=-510, var_1_17=2, var_1_18=73728, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L163] RET assume_abort_if_not((var_1_35 >= 0.0F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854776000e+12F && var_1_35 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_16=-510, var_1_17=2, var_1_18=73728, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_36=4519/500, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L164] var_1_36 = __VERIFIER_nondet_float() [L165] CALL assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854776000e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_16=-510, var_1_17=2, var_1_18=73728, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_16=-510, var_1_17=2, var_1_18=73728, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L165] RET assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854776000e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_16=-510, var_1_17=2, var_1_18=73728, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_38=31/2, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L166] var_1_38 = __VERIFIER_nondet_double() [L167] CALL assume_abort_if_not((var_1_38 >= -922337.2036854765600e+13F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 9223372.036854765600e+12F && var_1_38 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_16=-510, var_1_17=2, var_1_18=73728, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_16=-510, var_1_17=2, var_1_18=73728, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L167] RET assume_abort_if_not((var_1_38 >= -922337.2036854765600e+13F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 9223372.036854765600e+12F && var_1_38 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_16=-510, var_1_17=2, var_1_18=73728, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_41=61/4, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L168] var_1_41 = __VERIFIER_nondet_float() [L169] CALL assume_abort_if_not((var_1_41 >= 0.0F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 4611686.018427382800e+12F && var_1_41 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_16=-510, var_1_17=2, var_1_18=73728, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_16=-510, var_1_17=2, var_1_18=73728, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L169] RET assume_abort_if_not((var_1_41 >= 0.0F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 4611686.018427382800e+12F && var_1_41 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_16=-510, var_1_17=2, var_1_18=73728, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_42=129/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L170] var_1_42 = __VERIFIER_nondet_float() [L171] CALL assume_abort_if_not((var_1_42 >= 0.0F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 4611686.018427382800e+12F && var_1_42 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_16=-510, var_1_17=2, var_1_18=73728, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_16=-510, var_1_17=2, var_1_18=73728, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L171] RET assume_abort_if_not((var_1_42 >= 0.0F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 4611686.018427382800e+12F && var_1_42 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_16=-510, var_1_17=2, var_1_18=73728, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_43=2563/10, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L172] var_1_43 = __VERIFIER_nondet_float() [L173] CALL assume_abort_if_not((var_1_43 >= -461168.6018427382800e+13F && var_1_43 <= -1.0e-20F) || (var_1_43 <= 4611686.018427382800e+12F && var_1_43 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_16=-510, var_1_17=2, var_1_18=73728, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_16=-510, var_1_17=2, var_1_18=73728, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L173] RET assume_abort_if_not((var_1_43 >= -461168.6018427382800e+13F && var_1_43 <= -1.0e-20F) || (var_1_43 <= 4611686.018427382800e+12F && var_1_43 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_16=-510, var_1_17=2, var_1_18=73728, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=25, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L187] RET updateVariables() [L188] CALL step() [L57] COND TRUE 32.2f > (25.5f - ((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))) [L58] var_1_24 = ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_16=-510, var_1_17=2, var_1_18=73728, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=64, var_1_27=50, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L60] var_1_27 = var_1_28 VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_16=-510, var_1_17=2, var_1_18=73728, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=64, var_1_27=0, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L61] COND FALSE !(var_1_13 <= ((((var_1_13) < (var_1_13)) ? (var_1_13) : (var_1_13)))) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_16=-510, var_1_17=2, var_1_18=73728, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=64, var_1_27=0, var_1_28=0, var_1_29=10, var_1_33=57/8, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L68] COND FALSE !(var_1_13 > (((((var_1_34) < (var_1_35)) ? (var_1_34) : (var_1_35))) - var_1_36)) [L77] var_1_33 = 10000.5 VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_16=-510, var_1_17=2, var_1_18=73728, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=64, var_1_27=0, var_1_28=0, var_1_29=10, var_1_33=20001/2, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L79] COND FALSE !(\read(var_1_1)) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_16=-510, var_1_17=2, var_1_18=73728, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=64, var_1_27=0, var_1_28=0, var_1_29=10, var_1_33=20001/2, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L82] EXPR var_1_22 | var_1_22 VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_16=-510, var_1_17=2, var_1_18=73728, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=64, var_1_27=0, var_1_28=0, var_1_29=10, var_1_33=20001/2, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L82] COND FALSE !(var_1_15 < (var_1_22 | var_1_22)) [L86] COND TRUE ((var_1_38 + var_1_13) * ((((var_1_42) < 0 ) ? -(var_1_42) : (var_1_42)))) >= var_1_35 [L87] var_1_44 = ((((((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15)))) > (((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))))) ? (((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15)))) : (((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))))) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_16=-510, var_1_17=2, var_1_18=73728, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=64, var_1_27=0, var_1_28=0, var_1_29=10, var_1_33=20001/2, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L89] COND FALSE !(\read(var_1_1)) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_16=-510, var_1_17=2, var_1_18=73728, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=64, var_1_27=0, var_1_28=0, var_1_29=10, var_1_33=20001/2, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L92] unsigned char stepLocal_1 = ! var_1_5; VAL [isInitial=1, last_1_var_1_15=8, stepLocal_1=0, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_16=-510, var_1_17=2, var_1_18=73728, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=64, var_1_27=0, var_1_28=0, var_1_29=10, var_1_33=20001/2, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L93] COND FALSE !(stepLocal_1 || (var_1_12 < last_1_var_1_15)) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_16=-510, var_1_17=2, var_1_18=73728, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=64, var_1_27=0, var_1_28=0, var_1_29=10, var_1_33=20001/2, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L100] COND FALSE !((127.35 + var_1_13) <= var_1_13) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_16=-510, var_1_17=2, var_1_18=73728, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=64, var_1_27=0, var_1_28=0, var_1_29=10, var_1_33=20001/2, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L105] COND TRUE (- var_1_13) > 31.9f [L106] var_1_1 = ((var_1_6 || var_1_4) && var_1_5) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=8, var_1_16=-510, var_1_17=2, var_1_18=73728, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=64, var_1_27=0, var_1_28=0, var_1_29=10, var_1_33=20001/2, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L110] COND TRUE \read(var_1_1) [L111] var_1_15 = var_1_16 VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=-510, var_1_16=-510, var_1_17=2, var_1_18=73728, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_24=64, var_1_27=0, var_1_28=0, var_1_29=10, var_1_33=20001/2, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L113] var_1_22 = 1 [L114] var_1_23 = var_1_22 [L115] unsigned long int stepLocal_0 = var_1_23; VAL [isInitial=1, last_1_var_1_15=8, stepLocal_0=1, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=-510, var_1_16=-510, var_1_17=2, var_1_18=73728, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_24=64, var_1_27=0, var_1_28=0, var_1_29=10, var_1_33=20001/2, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L116] COND TRUE var_1_15 > stepLocal_0 [L117] var_1_8 = ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=-510, var_1_16=-510, var_1_17=2, var_1_18=73728, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_24=64, var_1_27=0, var_1_28=0, var_1_29=10, var_1_33=20001/2, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=126] [L119] unsigned char stepLocal_2 = var_1_23 < var_1_15; VAL [isInitial=1, last_1_var_1_15=8, stepLocal_2=1, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=-510, var_1_16=-510, var_1_17=2, var_1_18=73728, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_24=64, var_1_27=0, var_1_28=0, var_1_29=10, var_1_33=20001/2, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=126] [L120] COND TRUE var_1_1 || stepLocal_2 [L121] var_1_17 = (var_1_15 + ((var_1_18 - var_1_16) + var_1_15)) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=-510, var_1_16=-510, var_1_17=8194, var_1_18=73728, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_24=64, var_1_27=0, var_1_28=0, var_1_29=10, var_1_33=20001/2, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=126] [L125] signed long int stepLocal_3 = -10; VAL [isInitial=1, last_1_var_1_15=8, stepLocal_3=-10, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=-510, var_1_16=-510, var_1_17=8194, var_1_18=73728, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_24=64, var_1_27=0, var_1_28=0, var_1_29=10, var_1_33=20001/2, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=126] [L126] COND FALSE !(((var_1_15 / var_1_18) * var_1_15) < stepLocal_3) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=-510, var_1_16=-510, var_1_17=8194, var_1_18=73728, var_1_1=1, var_1_20=4, var_1_22=1, var_1_23=1, var_1_24=64, var_1_27=0, var_1_28=0, var_1_29=10, var_1_33=20001/2, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=126] [L129] COND FALSE !(! (var_1_17 <= var_1_17)) [L132] var_1_20 = var_1_12 VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=-510, var_1_16=-510, var_1_17=8194, var_1_18=73728, var_1_1=1, var_1_20=126, var_1_22=1, var_1_23=1, var_1_24=64, var_1_27=0, var_1_28=0, var_1_29=10, var_1_33=20001/2, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=126] [L188] RET step() [L189] CALL, EXPR property() [L179-L180] return ((((((((((- var_1_13) > 31.9f) ? (var_1_1 == ((unsigned char) ((var_1_6 || var_1_4) && var_1_5))) : (var_1_1 == ((unsigned char) var_1_5))) && (((127.35 + var_1_13) <= var_1_13) ? ((4.5 <= (var_1_13 * var_1_13)) ? (var_1_6 == ((unsigned char) var_1_5)) : 1) : 1)) && ((var_1_15 > var_1_23) ? (var_1_8 == ((signed char) ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))))) : 1)) && (((! var_1_5) || (var_1_12 < last_1_var_1_15)) ? ((! var_1_5) ? (var_1_13 == ((float) var_1_14)) : (var_1_13 == ((float) var_1_14))) : 1)) && (var_1_1 ? (var_1_15 == ((unsigned char) var_1_16)) : 1)) && ((var_1_1 || (var_1_23 < var_1_15)) ? (var_1_17 == ((unsigned short int) (var_1_15 + ((var_1_18 - var_1_16) + var_1_15)))) : (var_1_17 == ((unsigned short int) (var_1_16 + var_1_18))))) && ((((var_1_15 / var_1_18) * var_1_15) < -10) ? (var_1_20 == ((signed short int) ((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))))) : ((! (var_1_17 <= var_1_17)) ? (var_1_20 == ((signed short int) var_1_11)) : (var_1_20 == ((signed short int) var_1_12))))) && (var_1_22 == ((signed char) 1))) && (var_1_23 == ((unsigned long int) var_1_22)) ; [L189] RET, EXPR property() [L189] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=-510, var_1_16=-510, var_1_17=8194, var_1_18=73728, var_1_1=1, var_1_20=126, var_1_22=1, var_1_23=1, var_1_24=64, var_1_27=0, var_1_28=0, var_1_29=10, var_1_33=20001/2, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=126] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=8, var_1_11=126, var_1_12=126, var_1_13=8/5, var_1_15=-510, var_1_16=-510, var_1_17=8194, var_1_18=73728, var_1_1=1, var_1_20=126, var_1_22=1, var_1_23=1, var_1_24=64, var_1_27=0, var_1_28=0, var_1_29=10, var_1_33=20001/2, var_1_39=257/2, var_1_44=32, var_1_45=253/4, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=126] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.0s, OverallIterations: 5, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 737 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 712 mSDsluCounter, 1622 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1185 mSDsCounter, 409 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1419 IncrementalHoareTripleChecker+Invalid, 1828 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 409 mSolverCounterUnsat, 437 mSDtfsCounter, 1419 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 813 GetRequests, 735 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=4, InterpolantAutomatonStates: 65, 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, 4 MinimizatonAttempts, 151 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 1198 NumberOfCodeBlocks, 1198 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1039 ConstructedInterpolants, 0 QuantifiedInterpolants, 3961 SizeOfPredicates, 11 NumberOfNonLiveVariables, 721 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 7 InterpolantComputations, 2 PerfectInterpolantSequences, 6189/6468 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 03:04:17,126 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-41.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 0ce0eb489df8fa084a208059955735f91d7eaccc5d3a522f7cf2150fa7a42b6a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:04:19,344 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:04:19,428 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 03:04:19,439 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:04:19,439 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:04:19,477 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:04:19,478 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:04:19,478 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:04:19,479 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:04:19,480 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:04:19,481 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:04:19,481 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:04:19,482 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:04:19,484 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:04:19,484 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:04:19,485 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:04:19,485 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:04:19,485 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:04:19,486 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:04:19,486 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:04:19,489 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:04:19,491 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:04:19,491 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:04:19,491 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 03:04:19,491 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 03:04:19,491 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:04:19,492 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 03:04:19,492 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:04:19,492 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:04:19,493 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:04:19,493 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:04:19,493 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:04:19,493 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:04:19,494 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:04:19,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:04:19,496 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:04:19,497 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:04:19,497 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:04:19,498 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 03:04:19,498 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 03:04:19,498 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:04:19,499 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:04:19,499 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:04:19,499 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:04:19,500 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 03:04:19,500 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 -> 0ce0eb489df8fa084a208059955735f91d7eaccc5d3a522f7cf2150fa7a42b6a [2024-10-13 03:04:19,854 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:04:19,881 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:04:19,883 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:04:19,883 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:04:19,884 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:04:19,885 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-41.i [2024-10-13 03:04:21,473 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:04:21,687 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:04:21,688 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-41.i [2024-10-13 03:04:21,705 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/768ddea9d/e4b4cb8c65b3494ea7c68a4e9d4c48bb/FLAGd10fcda83 [2024-10-13 03:04:21,725 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/768ddea9d/e4b4cb8c65b3494ea7c68a4e9d4c48bb [2024-10-13 03:04:21,728 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:04:21,729 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:04:21,733 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:04:21,733 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:04:21,738 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:04:21,739 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:04:21" (1/1) ... [2024-10-13 03:04:21,740 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9a6dc0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:04:21, skipping insertion in model container [2024-10-13 03:04:21,742 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:04:21" (1/1) ... [2024-10-13 03:04:21,775 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:04:21,963 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-41.i[919,932] [2024-10-13 03:04:22,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:04:22,065 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:04:22,079 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-41.i[919,932] [2024-10-13 03:04:22,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:04:22,144 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:04:22,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:04:22 WrapperNode [2024-10-13 03:04:22,145 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:04:22,146 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:04:22,146 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:04:22,146 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:04:22,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:04:22" (1/1) ... [2024-10-13 03:04:22,171 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:04:22" (1/1) ... [2024-10-13 03:04:22,202 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 183 [2024-10-13 03:04:22,202 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:04:22,203 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:04:22,203 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:04:22,203 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:04:22,214 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:04:22" (1/1) ... [2024-10-13 03:04:22,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:04:22" (1/1) ... [2024-10-13 03:04:22,221 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:04:22" (1/1) ... [2024-10-13 03:04:22,242 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 03:04:22,245 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:04:22" (1/1) ... [2024-10-13 03:04:22,249 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:04:22" (1/1) ... [2024-10-13 03:04:22,262 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:04:22" (1/1) ... [2024-10-13 03:04:22,265 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:04:22" (1/1) ... [2024-10-13 03:04:22,275 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:04:22" (1/1) ... [2024-10-13 03:04:22,277 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:04:22" (1/1) ... [2024-10-13 03:04:22,284 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:04:22,285 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:04:22,285 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:04:22,285 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:04:22,286 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:04:22" (1/1) ... [2024-10-13 03:04:22,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:04:22,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:04:22,319 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 03:04:22,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 03:04:22,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:04:22,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 03:04:22,358 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:04:22,359 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:04:22,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:04:22,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:04:22,460 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:04:22,462 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:04:35,540 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-13 03:04:35,540 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:04:35,595 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:04:35,596 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:04:35,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:04:35 BoogieIcfgContainer [2024-10-13 03:04:35,596 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:04:35,598 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:04:35,599 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:04:35,602 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:04:35,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:04:21" (1/3) ... [2024-10-13 03:04:35,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d880b93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:04:35, skipping insertion in model container [2024-10-13 03:04:35,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:04:22" (2/3) ... [2024-10-13 03:04:35,605 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d880b93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:04:35, skipping insertion in model container [2024-10-13 03:04:35,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:04:35" (3/3) ... [2024-10-13 03:04:35,606 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-41.i [2024-10-13 03:04:35,635 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:04:35,636 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:04:35,710 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:04:35,718 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;@c3f22b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:04:35,718 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:04:35,727 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 50 states have (on average 1.5) internal successors, (75), 51 states have internal predecessors, (75), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 03:04:35,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-13 03:04:35,746 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:04:35,747 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:04:35,747 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:04:35,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:04:35,753 INFO L85 PathProgramCache]: Analyzing trace with hash -972953968, now seen corresponding path program 1 times [2024-10-13 03:04:35,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:04:35,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [716134433] [2024-10-13 03:04:35,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:04:35,769 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:04:35,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:04:35,773 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 03:04:35,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 03:04:36,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:36,370 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 03:04:36,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:04:36,427 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 482 proven. 0 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2024-10-13 03:04:36,427 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:04:36,428 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:04:36,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [716134433] [2024-10-13 03:04:36,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [716134433] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:04:36,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:04:36,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:04:36,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157821634] [2024-10-13 03:04:36,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:04:36,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:04:36,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:04:36,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:04:36,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:04:36,467 INFO L87 Difference]: Start difference. First operand has 75 states, 50 states have (on average 1.5) internal successors, (75), 51 states have internal predecessors, (75), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-13 03:04:39,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.68s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:04:39,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:04:39,216 INFO L93 Difference]: Finished difference Result 147 states and 258 transitions. [2024-10-13 03:04:39,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:04:39,244 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 148 [2024-10-13 03:04:39,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:04:39,251 INFO L225 Difference]: With dead ends: 147 [2024-10-13 03:04:39,252 INFO L226 Difference]: Without dead ends: 73 [2024-10-13 03:04:39,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:04:39,259 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-13 03:04:39,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-13 03:04:39,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-13 03:04:39,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-13 03:04:39,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 49 states have internal predecessors, (69), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 03:04:39,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 113 transitions. [2024-10-13 03:04:39,316 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 113 transitions. Word has length 148 [2024-10-13 03:04:39,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:04:39,317 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 113 transitions. [2024-10-13 03:04:39,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-13 03:04:39,318 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 113 transitions. [2024-10-13 03:04:39,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-13 03:04:39,321 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:04:39,322 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:04:39,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 03:04:39,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:04:39,523 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:04:39,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:04:39,524 INFO L85 PathProgramCache]: Analyzing trace with hash 77623068, now seen corresponding path program 1 times [2024-10-13 03:04:39,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:04:39,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1735419737] [2024-10-13 03:04:39,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:04:39,525 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:04:39,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:04:39,528 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 03:04:39,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 03:04:40,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:04:40,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 03:04:40,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:04:42,505 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 03:04:42,505 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:04:42,506 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:04:42,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1735419737] [2024-10-13 03:04:42,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1735419737] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:04:42,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:04:42,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:04:42,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714772710] [2024-10-13 03:04:42,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:04:42,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:04:42,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:04:42,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:04:42,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:04:42,511 INFO L87 Difference]: Start difference. First operand 73 states and 113 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 03:04:47,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:04:51,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:04:59,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:05:03,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:05:03,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:05:03,785 INFO L93 Difference]: Finished difference Result 216 states and 335 transitions. [2024-10-13 03:05:03,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:05:03,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 148 [2024-10-13 03:05:03,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:05:03,851 INFO L225 Difference]: With dead ends: 216 [2024-10-13 03:05:03,851 INFO L226 Difference]: Without dead ends: 144 [2024-10-13 03:05:03,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:05:03,853 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 39 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:05:03,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 198 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 4 Unknown, 0 Unchecked, 21.2s Time] [2024-10-13 03:05:03,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-10-13 03:05:03,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2024-10-13 03:05:03,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 94 states have (on average 1.3617021276595744) internal successors, (128), 94 states have internal predecessors, (128), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-13 03:05:03,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 216 transitions. [2024-10-13 03:05:03,874 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 216 transitions. Word has length 148 [2024-10-13 03:05:03,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:05:03,875 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 216 transitions. [2024-10-13 03:05:03,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 03:05:03,875 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 216 transitions. [2024-10-13 03:05:03,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-13 03:05:03,877 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:05:03,878 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:05:03,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-13 03:05:04,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:05:04,079 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:05:04,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:05:04,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1709351374, now seen corresponding path program 1 times [2024-10-13 03:05:04,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:05:04,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1701037144] [2024-10-13 03:05:04,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:05:04,081 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:05:04,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:05:04,084 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 03:05:04,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 03:05:04,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:05:04,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 03:05:04,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:05:09,772 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 03:05:09,776 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:05:09,776 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:05:09,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1701037144] [2024-10-13 03:05:09,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1701037144] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:05:09,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:05:09,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:05:09,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316190551] [2024-10-13 03:05:09,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:05:09,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:05:09,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:05:09,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:05:09,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:05:09,779 INFO L87 Difference]: Start difference. First operand 141 states and 216 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 03:05:14,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:05:15,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:05:20,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:05:20,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:05:20,444 INFO L93 Difference]: Finished difference Result 346 states and 532 transitions. [2024-10-13 03:05:20,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:05:20,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 149 [2024-10-13 03:05:20,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:05:20,449 INFO L225 Difference]: With dead ends: 346 [2024-10-13 03:05:20,451 INFO L226 Difference]: Without dead ends: 206 [2024-10-13 03:05:20,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:05:20,456 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 26 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2024-10-13 03:05:20,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 198 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 2 Unknown, 0 Unchecked, 10.6s Time] [2024-10-13 03:05:20,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-10-13 03:05:20,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 190. [2024-10-13 03:05:20,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 120 states have (on average 1.3) internal successors, (156), 120 states have internal predecessors, (156), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-13 03:05:20,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 288 transitions. [2024-10-13 03:05:20,507 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 288 transitions. Word has length 149 [2024-10-13 03:05:20,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:05:20,510 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 288 transitions. [2024-10-13 03:05:20,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 03:05:20,511 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 288 transitions. [2024-10-13 03:05:20,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-13 03:05:20,513 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:05:20,513 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:05:20,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-13 03:05:20,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:05:20,718 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:05:20,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:05:20,719 INFO L85 PathProgramCache]: Analyzing trace with hash 20407632, now seen corresponding path program 1 times [2024-10-13 03:05:20,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:05:20,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1442774922] [2024-10-13 03:05:20,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:05:20,720 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:05:20,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:05:20,723 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 03:05:20,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 03:05:21,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:05:21,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 03:05:21,293 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:05:23,285 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 03:05:23,285 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:05:23,285 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:05:23,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1442774922] [2024-10-13 03:05:23,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1442774922] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:05:23,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:05:23,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:05:23,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643138074] [2024-10-13 03:05:23,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:05:23,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:05:23,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:05:23,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:05:23,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:05:23,288 INFO L87 Difference]: Start difference. First operand 190 states and 288 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 03:05:26,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.91s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:05:26,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:05:26,809 INFO L93 Difference]: Finished difference Result 466 states and 710 transitions. [2024-10-13 03:05:26,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:05:26,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 149 [2024-10-13 03:05:26,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:05:26,822 INFO L225 Difference]: With dead ends: 466 [2024-10-13 03:05:26,823 INFO L226 Difference]: Without dead ends: 326 [2024-10-13 03:05:26,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:05:26,825 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 37 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-13 03:05:26,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 222 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-13 03:05:26,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-10-13 03:05:26,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 314. [2024-10-13 03:05:26,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 198 states have (on average 1.2828282828282829) internal successors, (254), 198 states have internal predecessors, (254), 110 states have call successors, (110), 5 states have call predecessors, (110), 5 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) [2024-10-13 03:05:26,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 474 transitions. [2024-10-13 03:05:26,889 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 474 transitions. Word has length 149 [2024-10-13 03:05:26,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:05:26,890 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 474 transitions. [2024-10-13 03:05:26,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 03:05:26,890 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 474 transitions. [2024-10-13 03:05:26,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-13 03:05:26,892 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:05:26,892 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:05:26,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-13 03:05:27,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:05:27,093 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:05:27,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:05:27,094 INFO L85 PathProgramCache]: Analyzing trace with hash -756988566, now seen corresponding path program 1 times [2024-10-13 03:05:27,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:05:27,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2064120812] [2024-10-13 03:05:27,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:05:27,094 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 03:05:27,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:05:27,096 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 03:05:27,097 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 (6)] Waiting until timeout for monitored process [2024-10-13 03:05:27,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:05:27,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 03:05:27,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:05:29,853 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 03:05:29,853 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:05:29,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:05:29,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2064120812] [2024-10-13 03:05:29,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2064120812] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:05:29,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:05:29,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:05:29,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134380270] [2024-10-13 03:05:29,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:05:29,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:05:29,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:05:29,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:05:29,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:05:29,858 INFO L87 Difference]: Start difference. First operand 314 states and 474 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22)