./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-ci_file-48.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-ci_file-48.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 12d6d24ada43a89a4eca053b99e113ed2849ef8ba81bc1d009eb54d431f777d1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 02:43:07,134 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 02:43:07,169 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 02:43:07,172 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 02:43:07,172 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 02:43:07,187 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 02:43:07,187 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 02:43:07,187 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 02:43:07,188 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 02:43:07,188 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 02:43:07,188 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 02:43:07,189 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 02:43:07,189 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 02:43:07,189 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 02:43:07,190 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 02:43:07,190 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 02:43:07,190 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 02:43:07,190 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 02:43:07,191 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 02:43:07,191 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 02:43:07,191 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 02:43:07,192 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 02:43:07,192 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 02:43:07,192 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 02:43:07,192 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 02:43:07,193 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 02:43:07,193 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 02:43:07,193 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 02:43:07,193 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 02:43:07,194 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 02:43:07,194 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 02:43:07,194 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 02:43:07,194 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:43:07,194 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 02:43:07,195 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 02:43:07,195 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 02:43:07,195 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 02:43:07,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 02:43:07,195 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 02:43:07,196 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 02:43:07,196 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 02:43:07,198 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 02:43:07,198 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 -> 12d6d24ada43a89a4eca053b99e113ed2849ef8ba81bc1d009eb54d431f777d1 [2024-10-13 02:43:07,399 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 02:43:07,416 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 02:43:07,420 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 02:43:07,421 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 02:43:07,422 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 02:43:07,423 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-48.i [2024-10-13 02:43:08,642 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 02:43:08,829 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 02:43:08,832 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-48.i [2024-10-13 02:43:08,843 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0c983fd6/9cb89d2a2b494000b7e52b79a18407e1/FLAG5982d323e [2024-10-13 02:43:08,874 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0c983fd6/9cb89d2a2b494000b7e52b79a18407e1 [2024-10-13 02:43:08,876 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 02:43:08,877 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 02:43:08,878 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 02:43:08,878 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 02:43:08,884 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 02:43:08,884 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:43:08" (1/1) ... [2024-10-13 02:43:08,885 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49973b40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:08, skipping insertion in model container [2024-10-13 02:43:08,887 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:43:08" (1/1) ... [2024-10-13 02:43:08,915 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 02:43:09,044 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-ci_file-48.i[919,932] [2024-10-13 02:43:09,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:43:09,112 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 02:43:09,121 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-ci_file-48.i[919,932] [2024-10-13 02:43:09,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:43:09,167 INFO L204 MainTranslator]: Completed translation [2024-10-13 02:43:09,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:09 WrapperNode [2024-10-13 02:43:09,168 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 02:43:09,169 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 02:43:09,169 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 02:43:09,169 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 02:43:09,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:09" (1/1) ... [2024-10-13 02:43:09,183 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:09" (1/1) ... [2024-10-13 02:43:09,211 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 223 [2024-10-13 02:43:09,211 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 02:43:09,212 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 02:43:09,212 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 02:43:09,212 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 02:43:09,223 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:09" (1/1) ... [2024-10-13 02:43:09,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:09" (1/1) ... [2024-10-13 02:43:09,227 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:09" (1/1) ... [2024-10-13 02:43:09,240 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 02:43:09,240 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:09" (1/1) ... [2024-10-13 02:43:09,241 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:09" (1/1) ... [2024-10-13 02:43:09,249 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:09" (1/1) ... [2024-10-13 02:43:09,252 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:09" (1/1) ... [2024-10-13 02:43:09,256 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:09" (1/1) ... [2024-10-13 02:43:09,258 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:09" (1/1) ... [2024-10-13 02:43:09,263 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 02:43:09,264 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 02:43:09,264 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 02:43:09,264 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 02:43:09,264 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:09" (1/1) ... [2024-10-13 02:43:09,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:43:09,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:43:09,299 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 02:43:09,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 02:43:09,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 02:43:09,335 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 02:43:09,335 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 02:43:09,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 02:43:09,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 02:43:09,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 02:43:09,407 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 02:43:09,409 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 02:43:09,721 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-13 02:43:09,721 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 02:43:09,762 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 02:43:09,762 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 02:43:09,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:43:09 BoogieIcfgContainer [2024-10-13 02:43:09,762 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 02:43:09,765 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 02:43:09,765 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 02:43:09,768 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 02:43:09,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:43:08" (1/3) ... [2024-10-13 02:43:09,769 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3311438 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:43:09, skipping insertion in model container [2024-10-13 02:43:09,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:09" (2/3) ... [2024-10-13 02:43:09,770 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3311438 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:43:09, skipping insertion in model container [2024-10-13 02:43:09,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:43:09" (3/3) ... [2024-10-13 02:43:09,771 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-48.i [2024-10-13 02:43:09,784 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 02:43:09,785 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 02:43:09,836 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 02:43:09,842 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;@1c8d0090, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 02:43:09,842 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 02:43:09,846 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 57 states have (on average 1.5087719298245614) internal successors, (86), 58 states have internal predecessors, (86), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-13 02:43:09,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-13 02:43:09,862 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:43:09,863 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:43:09,864 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:43:09,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:43:09,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1882868372, now seen corresponding path program 1 times [2024-10-13 02:43:09,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:43:09,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957976681] [2024-10-13 02:43:09,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:43:09,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:43:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:43:10,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:43:10,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:43:10,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 02:43:10,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:43:10,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 02:43:10,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 02:43:10,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 02:43:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 02:43:10,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:43:10,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 02:43:10,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 02:43:10,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 02:43:10,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 02:43:10,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 02:43:10,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 02:43:10,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 02:43:10,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 02:43:10,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 02:43:10,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:43:10,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 02:43:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:43:10,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 02:43:10,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 02:43:10,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 02:43:10,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 02:43:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 02:43:10,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 02:43:10,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-13 02:43:10,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-13 02:43:10,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:43:10,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957976681] [2024-10-13 02:43:10,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957976681] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:43:10,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:43:10,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:43:10,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251385036] [2024-10-13 02:43:10,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:43:10,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 02:43:10,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:43:10,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 02:43:10,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:43:10,354 INFO L87 Difference]: Start difference. First operand has 89 states, 57 states have (on average 1.5087719298245614) internal successors, (86), 58 states have internal predecessors, (86), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-13 02:43:10,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:43:10,396 INFO L93 Difference]: Finished difference Result 174 states and 313 transitions. [2024-10-13 02:43:10,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 02:43:10,399 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 187 [2024-10-13 02:43:10,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:43:10,406 INFO L225 Difference]: With dead ends: 174 [2024-10-13 02:43:10,406 INFO L226 Difference]: Without dead ends: 86 [2024-10-13 02:43:10,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:43:10,412 INFO L432 NwaCegarLoop]: 133 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, 133 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:43:10,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:43:10,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-13 02:43:10,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-13 02:43:10,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 55 states have internal predecessors, (78), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-13 02:43:10,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 136 transitions. [2024-10-13 02:43:10,446 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 136 transitions. Word has length 187 [2024-10-13 02:43:10,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:43:10,446 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 136 transitions. [2024-10-13 02:43:10,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-13 02:43:10,447 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 136 transitions. [2024-10-13 02:43:10,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-13 02:43:10,449 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:43:10,449 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:43:10,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 02:43:10,450 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:43:10,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:43:10,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1009179298, now seen corresponding path program 1 times [2024-10-13 02:43:10,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:43:10,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17950166] [2024-10-13 02:43:10,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:43:10,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:43:10,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:43:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:43:10,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:43:10,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 02:43:10,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:43:10,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 02:43:10,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 02:43:10,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 02:43:10,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 02:43:10,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:43:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 02:43:10,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 02:43:10,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 02:43:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 02:43:10,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 02:43:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 02:43:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 02:43:10,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 02:43:10,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 02:43:10,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:43:10,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 02:43:10,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:43:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 02:43:10,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 02:43:10,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 02:43:10,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 02:43:10,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 02:43:10,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 02:43:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-13 02:43:10,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-13 02:43:10,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:43:10,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17950166] [2024-10-13 02:43:10,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17950166] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:43:10,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:43:10,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:43:10,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064468510] [2024-10-13 02:43:10,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:43:10,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:43:10,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:43:10,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:43:10,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:43:10,657 INFO L87 Difference]: Start difference. First operand 86 states and 136 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 02:43:10,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:43:10,725 INFO L93 Difference]: Finished difference Result 201 states and 320 transitions. [2024-10-13 02:43:10,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:43:10,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 187 [2024-10-13 02:43:10,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:43:10,731 INFO L225 Difference]: With dead ends: 201 [2024-10-13 02:43:10,731 INFO L226 Difference]: Without dead ends: 116 [2024-10-13 02:43:10,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:43:10,735 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 44 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:43:10,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 253 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:43:10,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-13 02:43:10,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 107. [2024-10-13 02:43:10,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 76 states have internal predecessors, (110), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-13 02:43:10,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 168 transitions. [2024-10-13 02:43:10,747 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 168 transitions. Word has length 187 [2024-10-13 02:43:10,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:43:10,749 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 168 transitions. [2024-10-13 02:43:10,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 02:43:10,749 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 168 transitions. [2024-10-13 02:43:10,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-13 02:43:10,751 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:43:10,751 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:43:10,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 02:43:10,752 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:43:10,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:43:10,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1173283486, now seen corresponding path program 1 times [2024-10-13 02:43:10,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:43:10,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688305497] [2024-10-13 02:43:10,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:43:10,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:43:10,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:43:10,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:43:10,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:43:10,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 02:43:10,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:43:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 02:43:10,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 02:43:10,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 02:43:10,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 02:43:10,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:43:10,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 02:43:10,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 02:43:10,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 02:43:10,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 02:43:10,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 02:43:10,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 02:43:10,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 02:43:10,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 02:43:10,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 02:43:10,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:43:10,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 02:43:10,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:43:10,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 02:43:10,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 02:43:10,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 02:43:10,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 02:43:10,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 02:43:10,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 02:43:10,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-13 02:43:10,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:10,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-13 02:43:10,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:43:10,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688305497] [2024-10-13 02:43:10,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688305497] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:43:10,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:43:10,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:43:10,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524724321] [2024-10-13 02:43:10,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:43:10,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:43:10,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:43:10,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:43:10,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:43:10,996 INFO L87 Difference]: Start difference. First operand 107 states and 168 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 02:43:11,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:43:11,052 INFO L93 Difference]: Finished difference Result 223 states and 349 transitions. [2024-10-13 02:43:11,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:43:11,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 187 [2024-10-13 02:43:11,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:43:11,054 INFO L225 Difference]: With dead ends: 223 [2024-10-13 02:43:11,054 INFO L226 Difference]: Without dead ends: 117 [2024-10-13 02:43:11,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:43:11,056 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 28 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:43:11,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 265 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:43:11,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-13 02:43:11,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 108. [2024-10-13 02:43:11,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 77 states have (on average 1.3766233766233766) internal successors, (106), 77 states have internal predecessors, (106), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-13 02:43:11,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 164 transitions. [2024-10-13 02:43:11,066 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 164 transitions. Word has length 187 [2024-10-13 02:43:11,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:43:11,068 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 164 transitions. [2024-10-13 02:43:11,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 02:43:11,068 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 164 transitions. [2024-10-13 02:43:11,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-13 02:43:11,071 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:43:11,071 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:43:11,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 02:43:11,072 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:43:11,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:43:11,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1171436444, now seen corresponding path program 1 times [2024-10-13 02:43:11,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:43:11,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661572659] [2024-10-13 02:43:11,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:43:11,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:43:11,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:43:11,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:43:11,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:43:11,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 02:43:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:43:11,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 02:43:11,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 02:43:11,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 02:43:11,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 02:43:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:43:11,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 02:43:11,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 02:43:11,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 02:43:11,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 02:43:11,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 02:43:11,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 02:43:11,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 02:43:11,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 02:43:11,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 02:43:11,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:43:11,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 02:43:11,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:43:11,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 02:43:11,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 02:43:11,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 02:43:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 02:43:11,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 02:43:11,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 02:43:11,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-13 02:43:11,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-13 02:43:11,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:43:11,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661572659] [2024-10-13 02:43:11,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661572659] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:43:11,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:43:11,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:43:11,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33153517] [2024-10-13 02:43:11,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:43:11,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:43:11,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:43:11,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:43:11,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:43:11,307 INFO L87 Difference]: Start difference. First operand 108 states and 164 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 02:43:11,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:43:11,346 INFO L93 Difference]: Finished difference Result 322 states and 490 transitions. [2024-10-13 02:43:11,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:43:11,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 187 [2024-10-13 02:43:11,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:43:11,349 INFO L225 Difference]: With dead ends: 322 [2024-10-13 02:43:11,349 INFO L226 Difference]: Without dead ends: 215 [2024-10-13 02:43:11,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:43:11,350 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 66 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:43:11,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 259 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:43:11,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-10-13 02:43:11,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 190. [2024-10-13 02:43:11,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 129 states have (on average 1.3410852713178294) internal successors, (173), 129 states have internal predecessors, (173), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-13 02:43:11,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 289 transitions. [2024-10-13 02:43:11,368 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 289 transitions. Word has length 187 [2024-10-13 02:43:11,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:43:11,368 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 289 transitions. [2024-10-13 02:43:11,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 02:43:11,369 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 289 transitions. [2024-10-13 02:43:11,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-13 02:43:11,371 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:43:11,371 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:43:11,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 02:43:11,371 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:43:11,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:43:11,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1955516797, now seen corresponding path program 1 times [2024-10-13 02:43:11,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:43:11,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34790925] [2024-10-13 02:43:11,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:43:11,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:43:11,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:43:11,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:43:11,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:43:11,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 02:43:11,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:43:11,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 02:43:11,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 02:43:11,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 02:43:11,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 02:43:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:43:11,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 02:43:11,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 02:43:11,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 02:43:11,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 02:43:11,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 02:43:11,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 02:43:11,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 02:43:11,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 02:43:11,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 02:43:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:43:11,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 02:43:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:43:11,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 02:43:11,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 02:43:11,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 02:43:11,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 02:43:11,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 02:43:11,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 02:43:11,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-13 02:43:11,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:11,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-13 02:43:11,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:43:11,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34790925] [2024-10-13 02:43:11,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34790925] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:43:11,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:43:11,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 02:43:11,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292573676] [2024-10-13 02:43:11,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:43:11,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 02:43:11,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:43:11,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 02:43:11,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 02:43:11,711 INFO L87 Difference]: Start difference. First operand 190 states and 289 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 02:43:12,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:43:12,003 INFO L93 Difference]: Finished difference Result 616 states and 924 transitions. [2024-10-13 02:43:12,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 02:43:12,004 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 188 [2024-10-13 02:43:12,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:43:12,007 INFO L225 Difference]: With dead ends: 616 [2024-10-13 02:43:12,007 INFO L226 Difference]: Without dead ends: 427 [2024-10-13 02:43:12,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-13 02:43:12,010 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 206 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 02:43:12,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 439 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 02:43:12,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2024-10-13 02:43:12,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 318. [2024-10-13 02:43:12,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 231 states have (on average 1.3766233766233766) internal successors, (318), 233 states have internal predecessors, (318), 82 states have call successors, (82), 4 states have call predecessors, (82), 4 states have return successors, (82), 80 states have call predecessors, (82), 82 states have call successors, (82) [2024-10-13 02:43:12,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 482 transitions. [2024-10-13 02:43:12,053 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 482 transitions. Word has length 188 [2024-10-13 02:43:12,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:43:12,054 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 482 transitions. [2024-10-13 02:43:12,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 02:43:12,054 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 482 transitions. [2024-10-13 02:43:12,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-13 02:43:12,056 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:43:12,056 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:43:12,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 02:43:12,057 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:43:12,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:43:12,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1318382145, now seen corresponding path program 1 times [2024-10-13 02:43:12,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:43:12,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404134605] [2024-10-13 02:43:12,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:43:12,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:43:12,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:12,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:43:12,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:12,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:43:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:12,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:43:12,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:12,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 02:43:12,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:12,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:43:12,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:12,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 02:43:12,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:12,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 02:43:12,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:12,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 02:43:12,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:12,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 02:43:12,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:12,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:43:12,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:12,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 02:43:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:12,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 02:43:12,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:12,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 02:43:12,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:12,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 02:43:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:12,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 02:43:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:12,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 02:43:12,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:12,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 02:43:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:12,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 02:43:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:12,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 02:43:12,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:12,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:43:12,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:12,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 02:43:12,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:12,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:43:12,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:12,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 02:43:12,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:12,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 02:43:12,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:12,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 02:43:12,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:12,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 02:43:12,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:12,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 02:43:12,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:12,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 02:43:12,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:12,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-13 02:43:12,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:12,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-13 02:43:12,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:43:12,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404134605] [2024-10-13 02:43:12,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404134605] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:43:12,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:43:12,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 02:43:12,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750221670] [2024-10-13 02:43:12,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:43:12,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 02:43:12,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:43:12,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 02:43:12,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-13 02:43:12,498 INFO L87 Difference]: Start difference. First operand 318 states and 482 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 02:43:12,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:43:12,984 INFO L93 Difference]: Finished difference Result 896 states and 1342 transitions. [2024-10-13 02:43:12,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 02:43:12,985 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 188 [2024-10-13 02:43:12,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:43:12,989 INFO L225 Difference]: With dead ends: 896 [2024-10-13 02:43:12,989 INFO L226 Difference]: Without dead ends: 579 [2024-10-13 02:43:12,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2024-10-13 02:43:12,991 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 395 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 02:43:12,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 623 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 02:43:12,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2024-10-13 02:43:13,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 413. [2024-10-13 02:43:13,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 296 states have (on average 1.3614864864864864) internal successors, (403), 298 states have internal predecessors, (403), 111 states have call successors, (111), 5 states have call predecessors, (111), 5 states have return successors, (111), 109 states have call predecessors, (111), 111 states have call successors, (111) [2024-10-13 02:43:13,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 625 transitions. [2024-10-13 02:43:13,032 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 625 transitions. Word has length 188 [2024-10-13 02:43:13,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:43:13,033 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 625 transitions. [2024-10-13 02:43:13,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 02:43:13,033 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 625 transitions. [2024-10-13 02:43:13,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-13 02:43:13,035 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:43:13,035 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:43:13,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 02:43:13,035 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:43:13,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:43:13,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1521802049, now seen corresponding path program 1 times [2024-10-13 02:43:13,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:43:13,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089455982] [2024-10-13 02:43:13,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:43:13,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:43:13,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:13,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:43:13,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:13,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:43:13,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:13,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:43:13,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:13,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 02:43:13,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:13,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:43:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:13,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 02:43:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:13,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-13 02:43:13,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:13,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 02:43:13,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:13,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 02:43:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:13,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:43:13,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:13,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 02:43:13,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:13,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 02:43:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:13,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 02:43:13,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:13,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 02:43:13,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:13,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 02:43:13,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:13,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 02:43:13,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:13,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 02:43:13,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:13,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 02:43:13,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:13,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 02:43:13,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:13,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:43:13,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:13,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 02:43:13,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:13,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:43:13,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:13,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-13 02:43:13,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:13,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 02:43:13,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:13,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-13 02:43:13,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:13,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 02:43:13,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:13,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 02:43:13,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:13,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-13 02:43:13,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:13,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-13 02:43:13,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:13,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-13 02:43:13,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:43:13,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089455982] [2024-10-13 02:43:13,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089455982] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:43:13,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:43:13,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 02:43:13,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668346772] [2024-10-13 02:43:13,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:43:13,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 02:43:13,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:43:13,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 02:43:13,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 02:43:13,390 INFO L87 Difference]: Start difference. First operand 413 states and 625 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 02:43:13,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:43:13,603 INFO L93 Difference]: Finished difference Result 928 states and 1392 transitions. [2024-10-13 02:43:13,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 02:43:13,603 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 188 [2024-10-13 02:43:13,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:43:13,606 INFO L225 Difference]: With dead ends: 928 [2024-10-13 02:43:13,606 INFO L226 Difference]: Without dead ends: 611 [2024-10-13 02:43:13,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-13 02:43:13,607 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 202 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 02:43:13,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 429 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 02:43:13,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2024-10-13 02:43:13,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 455. [2024-10-13 02:43:13,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 338 states have (on average 1.3757396449704142) internal successors, (465), 340 states have internal predecessors, (465), 111 states have call successors, (111), 5 states have call predecessors, (111), 5 states have return successors, (111), 109 states have call predecessors, (111), 111 states have call successors, (111) [2024-10-13 02:43:13,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 687 transitions. [2024-10-13 02:43:13,637 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 687 transitions. Word has length 188 [2024-10-13 02:43:13,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:43:13,640 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 687 transitions. [2024-10-13 02:43:13,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 02:43:13,640 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 687 transitions. [2024-10-13 02:43:13,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-10-13 02:43:13,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:43:13,642 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:43:13,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 02:43:13,642 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:43:13,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:43:13,643 INFO L85 PathProgramCache]: Analyzing trace with hash 405187306, now seen corresponding path program 1 times [2024-10-13 02:43:13,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:43:13,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552272971] [2024-10-13 02:43:13,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:43:13,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:43:13,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 02:43:13,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [425362102] [2024-10-13 02:43:13,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:43:13,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:43:13,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:43:13,729 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 02:43:13,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 02:43:13,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 02:43:13,855 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 02:43:13,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 02:43:14,003 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 02:43:14,003 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 02:43:14,004 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 02:43:14,019 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 02:43:14,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:43:14,208 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:43:14,312 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 02:43:14,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 02:43:14 BoogieIcfgContainer [2024-10-13 02:43:14,314 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 02:43:14,314 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 02:43:14,314 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 02:43:14,314 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 02:43:14,314 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:43:09" (3/4) ... [2024-10-13 02:43:14,317 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 02:43:14,318 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 02:43:14,318 INFO L158 Benchmark]: Toolchain (without parser) took 5441.64ms. Allocated memory was 161.5MB in the beginning and 249.6MB in the end (delta: 88.1MB). Free memory was 130.7MB in the beginning and 150.6MB in the end (delta: -19.9MB). Peak memory consumption was 69.3MB. Max. memory is 16.1GB. [2024-10-13 02:43:14,319 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 161.5MB. Free memory is still 131.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 02:43:14,319 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.17ms. Allocated memory is still 161.5MB. Free memory was 130.1MB in the beginning and 112.1MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 02:43:14,319 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.89ms. Allocated memory is still 161.5MB. Free memory was 112.1MB in the beginning and 107.0MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 02:43:14,319 INFO L158 Benchmark]: Boogie Preprocessor took 51.17ms. Allocated memory is still 161.5MB. Free memory was 107.0MB in the beginning and 100.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 02:43:14,319 INFO L158 Benchmark]: RCFGBuilder took 498.81ms. Allocated memory is still 161.5MB. Free memory was 100.7MB in the beginning and 68.0MB in the end (delta: 32.7MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-13 02:43:14,320 INFO L158 Benchmark]: TraceAbstraction took 4548.39ms. Allocated memory was 161.5MB in the beginning and 249.6MB in the end (delta: 88.1MB). Free memory was 67.2MB in the beginning and 150.6MB in the end (delta: -83.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 02:43:14,320 INFO L158 Benchmark]: Witness Printer took 4.09ms. Allocated memory is still 249.6MB. Free memory is still 150.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 02:43:14,321 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.14ms. Allocated memory is still 161.5MB. Free memory is still 131.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 290.17ms. Allocated memory is still 161.5MB. Free memory was 130.1MB in the beginning and 112.1MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.89ms. Allocated memory is still 161.5MB. Free memory was 112.1MB in the beginning and 107.0MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.17ms. Allocated memory is still 161.5MB. Free memory was 107.0MB in the beginning and 100.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 498.81ms. Allocated memory is still 161.5MB. Free memory was 100.7MB in the beginning and 68.0MB in the end (delta: 32.7MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 4548.39ms. Allocated memory was 161.5MB in the beginning and 249.6MB in the end (delta: 88.1MB). Free memory was 67.2MB in the beginning and 150.6MB in the end (delta: -83.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Witness Printer took 4.09ms. Allocated memory is still 249.6MB. Free memory is still 150.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 someBinaryDOUBLEComparisonOperation at line 200, overapproximation of someBinaryFLOATComparisonOperation at line 193. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 10; [L23] unsigned char var_1_2 = 1; [L24] double var_1_3 = 0.0; [L25] double var_1_4 = 128.2; [L26] double var_1_5 = 50.1; [L27] double var_1_6 = 64.5; [L28] unsigned short int var_1_7 = 1; [L29] unsigned char var_1_8 = 5; [L30] double var_1_9 = 15.35; [L31] unsigned char var_1_10 = 10; [L32] unsigned char var_1_11 = 2; [L33] signed long int var_1_12 = 32; [L34] signed long int var_1_13 = 256; [L35] signed char var_1_14 = 1; [L36] unsigned char var_1_15 = 128; [L37] unsigned char var_1_16 = 0; [L38] signed char var_1_17 = -64; [L39] unsigned short int var_1_18 = 64; [L40] unsigned short int var_1_20 = 8; [L41] unsigned char var_1_22 = 0; [L42] unsigned char var_1_25 = 1; [L43] unsigned char var_1_26 = 1; [L44] unsigned char var_1_28 = 0; [L45] double var_1_29 = 50.2; [L46] signed char var_1_32 = -25; [L47] unsigned char var_1_36 = 0; [L48] unsigned char var_1_37 = 0; [L49] signed short int var_1_38 = -4; [L50] float var_1_40 = 16.2; [L51] float var_1_41 = 10.75; [L52] float var_1_42 = 999.6; [L53] float var_1_43 = 64.5; [L54] signed long int var_1_44 = -2; [L55] signed short int var_1_45 = 2; [L56] unsigned char last_1_var_1_8 = 5; [L57] unsigned short int last_1_var_1_18 = 64; [L204] isInitial = 1 [L205] FCALL initially() [L206] COND TRUE 1 [L207] CALL updateLastVariables() [L196] last_1_var_1_8 = var_1_8 [L197] last_1_var_1_18 = var_1_18 [L207] RET updateLastVariables() [L208] CALL updateVariables() [L147] var_1_2 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_3=0, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_3=0, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L148] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_3=0, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L149] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_3=0, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_3=0, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L149] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_3=0, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L150] var_1_3 = __VERIFIER_nondet_double() [L151] CALL assume_abort_if_not((var_1_3 >= 4611686.018427387900e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L151] RET assume_abort_if_not((var_1_3 >= 4611686.018427387900e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L152] var_1_4 = __VERIFIER_nondet_double() [L153] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427387900e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L153] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427387900e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L154] var_1_5 = __VERIFIER_nondet_double() [L155] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L155] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L156] var_1_6 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L157] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L158] var_1_7 = __VERIFIER_nondet_ushort() [L159] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_8=5, var_1_9=307/20] [L159] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_8=5, var_1_9=307/20] [L160] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5, var_1_9=307/20] [L160] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5, var_1_9=307/20] [L161] var_1_9 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L162] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L163] CALL assume_abort_if_not(var_1_9 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L163] RET assume_abort_if_not(var_1_9 != 0.0F) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L164] var_1_10 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L165] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L166] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L166] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L167] var_1_11 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L168] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L169] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L169] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L170] var_1_15 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_15 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L171] RET assume_abort_if_not(var_1_15 >= 127) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L172] CALL assume_abort_if_not(var_1_15 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L172] RET assume_abort_if_not(var_1_15 <= 255) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L173] var_1_16 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L174] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L175] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L175] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L176] var_1_17 = __VERIFIER_nondet_char() [L177] CALL assume_abort_if_not(var_1_17 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L177] RET assume_abort_if_not(var_1_17 >= -126) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L178] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L178] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L179] var_1_25 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_25 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L180] RET assume_abort_if_not(var_1_25 >= 1) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L181] CALL assume_abort_if_not(var_1_25 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L181] RET assume_abort_if_not(var_1_25 <= 1) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L182] var_1_28 = __VERIFIER_nondet_uchar() [L183] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L183] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L184] CALL assume_abort_if_not(var_1_28 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L184] RET assume_abort_if_not(var_1_28 <= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L185] var_1_37 = __VERIFIER_nondet_uchar() [L186] CALL assume_abort_if_not(var_1_37 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L186] RET assume_abort_if_not(var_1_37 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L187] CALL assume_abort_if_not(var_1_37 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L187] RET assume_abort_if_not(var_1_37 <= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L188] var_1_41 = __VERIFIER_nondet_float() [L189] CALL assume_abort_if_not((var_1_41 >= -461168.6018427382800e+13F && 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_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L189] RET assume_abort_if_not((var_1_41 >= -461168.6018427382800e+13F && 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_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L190] var_1_42 = __VERIFIER_nondet_float() [L191] CALL assume_abort_if_not((var_1_42 >= -461168.6018427382800e+13F && 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_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L191] RET assume_abort_if_not((var_1_42 >= -461168.6018427382800e+13F && 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_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L192] var_1_43 = __VERIFIER_nondet_float() [L193] 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_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L193] 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_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L208] RET updateVariables() [L209] CALL step() [L61] var_1_20 = var_1_11 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=127, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L62] COND TRUE var_1_2 || (2.65f > var_1_3) [L63] var_1_22 = (! (! var_1_25)) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=127, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L65] COND TRUE \read(var_1_2) [L66] var_1_26 = (! ((var_1_9 >= var_1_5) && var_1_28)) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=127, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=32767, var_1_8=5] [L68] COND TRUE \read(var_1_2) [L69] var_1_29 = ((((var_1_4) < (var_1_4)) ? (var_1_4) : (var_1_4))) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=127, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=2, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_4=2, var_1_7=32767, var_1_8=5] [L71] COND TRUE (((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))) - ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16)))) <= var_1_11 [L72] var_1_32 = ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=127, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=2, var_1_2=1, var_1_32=126, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_4=2, var_1_7=32767, var_1_8=5] [L74] EXPR var_1_16 & var_1_15 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=127, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=2, var_1_2=1, var_1_32=126, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_4=2, var_1_7=32767, var_1_8=5] [L74] COND TRUE (var_1_16 & var_1_15) <= ((var_1_15 - var_1_16) + -16) [L75] var_1_36 = var_1_25 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=127, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=2, var_1_2=1, var_1_32=126, var_1_36=1, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_4=2, var_1_7=32767, var_1_8=5] [L83] EXPR var_1_11 >> var_1_16 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=127, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=2, var_1_2=1, var_1_32=126, var_1_36=1, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_4=2, var_1_7=32767, var_1_8=5] [L83] COND FALSE !(((var_1_11 | 1) % var_1_15) >= (var_1_11 >> var_1_16)) [L86] COND FALSE !(\read(var_1_37)) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=127, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=2, var_1_2=1, var_1_32=126, var_1_36=1, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_4=2, var_1_7=32767, var_1_8=5] [L89] COND TRUE \read(var_1_2) [L90] var_1_44 = (-5 + var_1_16) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=127, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=2, var_1_2=1, var_1_32=126, var_1_36=1, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-5, var_1_45=2, var_1_4=2, var_1_7=32767, var_1_8=5] [L92] var_1_45 = var_1_18 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=127, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=2, var_1_2=1, var_1_32=126, var_1_36=1, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-5, var_1_45=64, var_1_4=2, var_1_7=32767, var_1_8=5] [L93] COND TRUE \read(var_1_2) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=10, var_1_20=127, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=2, var_1_2=1, var_1_32=126, var_1_36=1, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-5, var_1_45=64, var_1_4=2, var_1_7=32767, var_1_8=5] [L94] COND FALSE !(((var_1_3 - var_1_4) - var_1_5) == (15.75 - var_1_6)) [L97] var_1_1 = last_1_var_1_8 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=5, var_1_20=127, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=2, var_1_2=1, var_1_32=126, var_1_36=1, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-5, var_1_45=64, var_1_4=2, var_1_7=32767, var_1_8=5] [L102] unsigned short int stepLocal_0 = var_1_1; VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=5, var_1_20=127, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=2, var_1_2=1, var_1_32=126, var_1_36=1, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-5, var_1_45=64, var_1_4=2, var_1_7=32767, var_1_8=5] [L103] COND TRUE var_1_6 > (var_1_5 / ((((var_1_3) > (var_1_9)) ? (var_1_3) : (var_1_9)))) [L104] var_1_8 = ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=5, var_1_20=127, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=2, var_1_2=1, var_1_32=126, var_1_36=1, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-5, var_1_45=64, var_1_4=2, var_1_7=32767, var_1_8=127] [L112] COND TRUE \read(var_1_2) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=5, var_1_20=127, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=2, var_1_2=1, var_1_32=126, var_1_36=1, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-5, var_1_45=64, var_1_4=2, var_1_7=32767, var_1_8=127] [L113] COND FALSE !(-128 > var_1_10) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=5, var_1_20=127, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=2, var_1_2=1, var_1_32=126, var_1_36=1, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-5, var_1_45=64, var_1_4=2, var_1_7=32767, var_1_8=127] [L123] signed long int stepLocal_1 = ((((var_1_15 - var_1_16)) > (var_1_12)) ? ((var_1_15 - var_1_16)) : (var_1_12)); VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=5, stepLocal_1=127, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=5, var_1_20=127, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=2, var_1_2=1, var_1_32=126, var_1_36=1, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-5, var_1_45=64, var_1_4=2, var_1_7=32767, var_1_8=127] [L124] COND TRUE var_1_10 == stepLocal_1 [L125] var_1_14 = ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=256, var_1_14=126, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=5, var_1_20=127, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=2, var_1_2=1, var_1_32=126, var_1_36=1, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-5, var_1_45=64, var_1_4=2, var_1_7=32767, var_1_8=127] [L129] COND TRUE \read(var_1_2) [L130] var_1_13 = var_1_11 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=127, var_1_14=126, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=64, var_1_1=5, var_1_20=127, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=2, var_1_2=1, var_1_32=126, var_1_36=1, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-5, var_1_45=64, var_1_4=2, var_1_7=32767, var_1_8=127] [L132] COND TRUE var_1_8 == var_1_13 [L133] var_1_18 = (var_1_10 + ((((var_1_14) < (var_1_16)) ? (var_1_14) : (var_1_16)))) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=127, var_1_14=126, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=127, var_1_1=5, var_1_20=127, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=2, var_1_2=1, var_1_32=126, var_1_36=1, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-5, var_1_45=64, var_1_4=2, var_1_7=32767, var_1_8=127] [L209] RET step() [L210] CALL, EXPR property() [L200-L201] return (((((var_1_2 ? ((((var_1_3 - var_1_4) - var_1_5) == (15.75 - var_1_6)) ? (var_1_1 == ((unsigned short int) (5 + last_1_var_1_8))) : (var_1_1 == ((unsigned short int) last_1_var_1_8))) : (var_1_1 == ((unsigned short int) 1))) && ((var_1_6 > (var_1_5 / ((((var_1_3) > (var_1_9)) ? (var_1_3) : (var_1_9))))) ? (var_1_8 == ((unsigned char) ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))))) : ((var_1_1 <= var_1_7) ? (var_1_8 == ((unsigned char) var_1_10)) : (var_1_8 == ((unsigned char) var_1_11))))) && (var_1_2 ? ((-128 > var_1_10) ? ((var_1_3 >= (2.75 / var_1_9)) ? (var_1_12 == ((signed long int) (var_1_11 + (last_1_var_1_18 + var_1_10)))) : (var_1_12 == ((signed long int) last_1_var_1_18))) : 1) : (var_1_12 == ((signed long int) last_1_var_1_18)))) && (var_1_2 ? (var_1_13 == ((signed long int) var_1_11)) : 1)) && ((var_1_10 == (((((var_1_15 - var_1_16)) > (var_1_12)) ? ((var_1_15 - var_1_16)) : (var_1_12)))) ? (var_1_14 == ((signed char) ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))))) : (var_1_14 == ((signed char) var_1_17)))) && ((var_1_8 == var_1_13) ? (var_1_18 == ((unsigned short int) (var_1_10 + ((((var_1_14) < (var_1_16)) ? (var_1_14) : (var_1_16)))))) : ((last_1_var_1_18 != var_1_16) ? ((-256 >= var_1_13) ? (var_1_18 == ((unsigned short int) var_1_16)) : (var_1_18 == ((unsigned short int) var_1_15))) : (var_1_18 == ((unsigned short int) var_1_10)))) ; [L210] RET, EXPR property() [L210] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=127, var_1_14=126, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=127, var_1_1=5, var_1_20=127, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=2, var_1_2=1, var_1_32=126, var_1_36=1, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-5, var_1_45=64, var_1_4=2, var_1_7=32767, var_1_8=127] [L19] reach_error() VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=127, var_1_11=383, var_1_12=32, var_1_13=127, var_1_14=126, var_1_15=127, var_1_16=0, var_1_17=126, var_1_18=127, var_1_1=5, var_1_20=127, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=2, var_1_2=1, var_1_32=126, var_1_36=1, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-5, var_1_45=64, var_1_4=2, var_1_7=32767, var_1_8=127] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.4s, OverallIterations: 8, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 941 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 941 mSDsluCounter, 2401 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1468 mSDsCounter, 221 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 799 IncrementalHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 221 mSolverCounterUnsat, 933 mSDtfsCounter, 799 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 482 GetRequests, 453 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=455occurred in iteration=7, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 474 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1690 NumberOfCodeBlocks, 1690 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1305 ConstructedInterpolants, 0 QuantifiedInterpolants, 2791 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 11368/11368 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 02:43:14,351 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-ci_file-48.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 12d6d24ada43a89a4eca053b99e113ed2849ef8ba81bc1d009eb54d431f777d1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 02:43:16,080 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 02:43:16,139 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 02:43:16,144 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 02:43:16,145 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 02:43:16,170 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 02:43:16,171 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 02:43:16,171 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 02:43:16,172 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 02:43:16,172 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 02:43:16,173 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 02:43:16,173 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 02:43:16,173 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 02:43:16,173 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 02:43:16,174 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 02:43:16,175 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 02:43:16,175 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 02:43:16,175 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 02:43:16,175 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 02:43:16,176 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 02:43:16,176 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 02:43:16,179 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 02:43:16,179 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 02:43:16,179 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 02:43:16,179 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 02:43:16,179 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 02:43:16,179 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 02:43:16,180 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 02:43:16,180 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 02:43:16,180 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 02:43:16,180 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 02:43:16,180 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 02:43:16,180 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 02:43:16,180 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 02:43:16,181 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:43:16,186 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 02:43:16,186 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 02:43:16,187 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 02:43:16,187 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 02:43:16,187 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 02:43:16,187 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 02:43:16,188 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 02:43:16,188 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 02:43:16,188 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 02:43:16,189 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 02:43:16,189 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 -> 12d6d24ada43a89a4eca053b99e113ed2849ef8ba81bc1d009eb54d431f777d1 [2024-10-13 02:43:16,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 02:43:16,455 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 02:43:16,458 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 02:43:16,459 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 02:43:16,460 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 02:43:16,461 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-48.i [2024-10-13 02:43:17,725 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 02:43:17,921 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 02:43:17,921 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-48.i [2024-10-13 02:43:17,935 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afad9b973/4e4d79911f7044e18d9b0624cae7d04b/FLAG373092cdd [2024-10-13 02:43:18,287 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afad9b973/4e4d79911f7044e18d9b0624cae7d04b [2024-10-13 02:43:18,289 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 02:43:18,290 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 02:43:18,291 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 02:43:18,291 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 02:43:18,295 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 02:43:18,296 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:43:18" (1/1) ... [2024-10-13 02:43:18,298 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4006ab7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:18, skipping insertion in model container [2024-10-13 02:43:18,298 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:43:18" (1/1) ... [2024-10-13 02:43:18,324 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 02:43:18,461 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-ci_file-48.i[919,932] [2024-10-13 02:43:18,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:43:18,548 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 02:43:18,560 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-ci_file-48.i[919,932] [2024-10-13 02:43:18,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:43:18,617 INFO L204 MainTranslator]: Completed translation [2024-10-13 02:43:18,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:18 WrapperNode [2024-10-13 02:43:18,618 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 02:43:18,619 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 02:43:18,619 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 02:43:18,619 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 02:43:18,625 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:18" (1/1) ... [2024-10-13 02:43:18,641 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:18" (1/1) ... [2024-10-13 02:43:18,671 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 206 [2024-10-13 02:43:18,672 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 02:43:18,676 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 02:43:18,676 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 02:43:18,676 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 02:43:18,687 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:18" (1/1) ... [2024-10-13 02:43:18,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:18" (1/1) ... [2024-10-13 02:43:18,693 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:18" (1/1) ... [2024-10-13 02:43:18,710 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 02:43:18,712 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:18" (1/1) ... [2024-10-13 02:43:18,712 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:18" (1/1) ... [2024-10-13 02:43:18,724 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:18" (1/1) ... [2024-10-13 02:43:18,727 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:18" (1/1) ... [2024-10-13 02:43:18,730 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:18" (1/1) ... [2024-10-13 02:43:18,735 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:18" (1/1) ... [2024-10-13 02:43:18,740 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 02:43:18,741 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 02:43:18,741 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 02:43:18,741 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 02:43:18,742 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:18" (1/1) ... [2024-10-13 02:43:18,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:43:18,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:43:18,773 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 02:43:18,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 02:43:18,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 02:43:18,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 02:43:18,809 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 02:43:18,809 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 02:43:18,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 02:43:18,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 02:43:18,901 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 02:43:18,903 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 02:43:40,535 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-13 02:43:40,535 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 02:43:40,584 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 02:43:40,584 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 02:43:40,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:43:40 BoogieIcfgContainer [2024-10-13 02:43:40,585 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 02:43:40,586 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 02:43:40,586 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 02:43:40,589 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 02:43:40,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:43:18" (1/3) ... [2024-10-13 02:43:40,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f8fed74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:43:40, skipping insertion in model container [2024-10-13 02:43:40,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:43:18" (2/3) ... [2024-10-13 02:43:40,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f8fed74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:43:40, skipping insertion in model container [2024-10-13 02:43:40,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:43:40" (3/3) ... [2024-10-13 02:43:40,597 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-48.i [2024-10-13 02:43:40,610 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 02:43:40,610 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 02:43:40,657 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 02:43:40,662 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;@59965de4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 02:43:40,662 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 02:43:40,665 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 52 states have (on average 1.5) internal successors, (78), 53 states have internal predecessors, (78), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-13 02:43:40,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-13 02:43:40,677 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:43:40,677 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:43:40,677 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:43:40,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:43:40,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1231552401, now seen corresponding path program 1 times [2024-10-13 02:43:40,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:43:40,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2053717811] [2024-10-13 02:43:40,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:43:40,692 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:43:40,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:43:40,694 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:43:40,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 02:43:42,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:42,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 02:43:42,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:43:42,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 740 proven. 0 refuted. 0 times theorem prover too weak. 884 trivial. 0 not checked. [2024-10-13 02:43:42,272 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:43:42,273 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:43:42,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2053717811] [2024-10-13 02:43:42,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2053717811] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:43:42,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:43:42,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:43:42,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976805447] [2024-10-13 02:43:42,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:43:42,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 02:43:42,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:43:42,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 02:43:42,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:43:42,299 INFO L87 Difference]: Start difference. First operand has 84 states, 52 states have (on average 1.5) internal successors, (78), 53 states have internal predecessors, (78), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-13 02:43:46,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.41s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:43:46,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:43:46,786 INFO L93 Difference]: Finished difference Result 164 states and 297 transitions. [2024-10-13 02:43:46,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 02:43:46,955 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 185 [2024-10-13 02:43:46,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:43:46,960 INFO L225 Difference]: With dead ends: 164 [2024-10-13 02:43:46,961 INFO L226 Difference]: Without dead ends: 81 [2024-10-13 02:43:46,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:43:46,966 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-10-13 02:43:46,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2024-10-13 02:43:46,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-13 02:43:46,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-10-13 02:43:46,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 50 states have (on average 1.4) internal successors, (70), 50 states have internal predecessors, (70), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-13 02:43:47,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 128 transitions. [2024-10-13 02:43:47,001 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 128 transitions. Word has length 185 [2024-10-13 02:43:47,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:43:47,002 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 128 transitions. [2024-10-13 02:43:47,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-13 02:43:47,002 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 128 transitions. [2024-10-13 02:43:47,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-13 02:43:47,005 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:43:47,005 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:43:47,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 02:43:47,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:43:47,206 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:43:47,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:43:47,207 INFO L85 PathProgramCache]: Analyzing trace with hash 521847811, now seen corresponding path program 1 times [2024-10-13 02:43:47,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:43:47,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1516804623] [2024-10-13 02:43:47,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:43:47,208 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:43:47,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:43:47,210 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:43:47,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 02:43:48,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:43:48,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 02:43:48,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:43:49,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-13 02:43:49,108 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:43:49,108 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:43:49,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1516804623] [2024-10-13 02:43:49,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1516804623] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:43:49,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:43:49,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:43:49,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973954307] [2024-10-13 02:43:49,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:43:49,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:43:49,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:43:49,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:43:49,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:43:49,112 INFO L87 Difference]: Start difference. First operand 81 states and 128 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 02:43:53,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.44s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:43:58,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.42s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:44:02,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:44:02,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:44:02,853 INFO L93 Difference]: Finished difference Result 187 states and 298 transitions. [2024-10-13 02:44:02,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:44:02,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 185 [2024-10-13 02:44:02,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:44:02,856 INFO L225 Difference]: With dead ends: 187 [2024-10-13 02:44:02,856 INFO L226 Difference]: Without dead ends: 107 [2024-10-13 02:44:02,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:44:02,858 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 31 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 11 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.7s IncrementalHoareTripleChecker+Time [2024-10-13 02:44:02,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 230 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 21 Invalid, 3 Unknown, 0 Unchecked, 13.7s Time] [2024-10-13 02:44:02,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-13 02:44:02,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 98. [2024-10-13 02:44:02,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 67 states have internal predecessors, (95), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-13 02:44:02,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 153 transitions. [2024-10-13 02:44:02,875 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 153 transitions. Word has length 185 [2024-10-13 02:44:02,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:44:02,876 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 153 transitions. [2024-10-13 02:44:02,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 02:44:02,877 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 153 transitions. [2024-10-13 02:44:02,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-13 02:44:02,880 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:44:02,881 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:44:02,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-13 02:44:03,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:44:03,082 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:44:03,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:44:03,082 INFO L85 PathProgramCache]: Analyzing trace with hash -63111161, now seen corresponding path program 1 times [2024-10-13 02:44:03,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:44:03,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1503779347] [2024-10-13 02:44:03,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:44:03,083 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:44:03,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:44:03,085 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:44:03,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 02:44:04,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:44:04,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 02:44:04,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:44:05,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-13 02:44:05,162 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:44:05,162 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:44:05,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1503779347] [2024-10-13 02:44:05,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1503779347] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:44:05,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:44:05,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:44:05,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177866544] [2024-10-13 02:44:05,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:44:05,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:44:05,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:44:05,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:44:05,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:44:05,165 INFO L87 Difference]: Start difference. First operand 98 states and 153 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 02:44:09,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.41s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:44:13,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:44:18,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:44:18,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:44:18,003 INFO L93 Difference]: Finished difference Result 204 states and 317 transitions. [2024-10-13 02:44:18,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:44:18,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 185 [2024-10-13 02:44:18,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:44:18,180 INFO L225 Difference]: With dead ends: 204 [2024-10-13 02:44:18,180 INFO L226 Difference]: Without dead ends: 107 [2024-10-13 02:44:18,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:44:18,182 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 29 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2024-10-13 02:44:18,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 244 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 3 Unknown, 0 Unchecked, 12.8s Time] [2024-10-13 02:44:18,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-13 02:44:18,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 98. [2024-10-13 02:44:18,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 67 states have (on average 1.3432835820895523) internal successors, (90), 67 states have internal predecessors, (90), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-13 02:44:18,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 148 transitions. [2024-10-13 02:44:18,192 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 148 transitions. Word has length 185 [2024-10-13 02:44:18,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:44:18,192 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 148 transitions. [2024-10-13 02:44:18,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-13 02:44:18,192 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 148 transitions. [2024-10-13 02:44:18,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-13 02:44:18,194 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:44:18,194 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:44:18,234 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 (4)] Ended with exit code 0 [2024-10-13 02:44:18,394 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 02:44:18,395 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:44:18,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:44:18,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1752054903, now seen corresponding path program 1 times [2024-10-13 02:44:18,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:44:18,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [906838329] [2024-10-13 02:44:18,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:44:18,396 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:44:18,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:44:18,399 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 02:44:18,400 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 02:44:19,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:44:19,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 02:44:19,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:44:21,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 378 proven. 9 refuted. 0 times theorem prover too weak. 1237 trivial. 0 not checked. [2024-10-13 02:44:21,481 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:44:25,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 75 proven. 9 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-10-13 02:44:25,651 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:44:25,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [906838329] [2024-10-13 02:44:25,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [906838329] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 02:44:25,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 02:44:25,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-10-13 02:44:25,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029064466] [2024-10-13 02:44:25,652 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 02:44:25,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 02:44:25,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:44:25,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 02:44:25,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 02:44:25,654 INFO L87 Difference]: Start difference. First operand 98 states and 148 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-13 02:44:34,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.43s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:44:38,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:44:42,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:44:42,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:44:42,431 INFO L93 Difference]: Finished difference Result 203 states and 302 transitions. [2024-10-13 02:44:42,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 02:44:42,603 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 185 [2024-10-13 02:44:42,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:44:42,605 INFO L225 Difference]: With dead ends: 203 [2024-10-13 02:44:42,605 INFO L226 Difference]: Without dead ends: 106 [2024-10-13 02:44:42,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 362 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-13 02:44:42,611 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 81 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 10 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:44:42,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 211 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 167 Invalid, 3 Unknown, 0 Unchecked, 16.1s Time] [2024-10-13 02:44:42,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-13 02:44:42,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2024-10-13 02:44:42,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 70 states have (on average 1.3) internal successors, (91), 70 states have internal predecessors, (91), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-13 02:44:42,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 149 transitions. [2024-10-13 02:44:42,620 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 149 transitions. Word has length 185 [2024-10-13 02:44:42,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:44:42,621 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 149 transitions. [2024-10-13 02:44:42,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-13 02:44:42,621 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 149 transitions. [2024-10-13 02:44:42,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-13 02:44:42,623 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:44:42,623 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:44:42,661 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 02:44:42,823 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 02:44:42,824 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:44:42,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:44:42,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1531795143, now seen corresponding path program 1 times [2024-10-13 02:44:42,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:44:42,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [767280535] [2024-10-13 02:44:42,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:44:42,825 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:44:42,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:44:42,828 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 02:44:42,829 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 02:44:44,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:44:44,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 02:44:44,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:44:51,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-13 02:44:51,465 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:44:51,465 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:44:51,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [767280535] [2024-10-13 02:44:51,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [767280535] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:44:51,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:44:51,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:44:51,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116502397] [2024-10-13 02:44:51,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:44:51,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:44:51,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:44:51,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:44:51,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:44:51,466 INFO L87 Difference]: Start difference. First operand 102 states and 149 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, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29)